./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-subst.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 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:43:42,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:43:42,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:43:42,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:43:42,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:43:42,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:43:42,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:43:42,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:43:42,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:43:42,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:43:42,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:43:42,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:43:42,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:43:42,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:43:42,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:43:42,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:43:42,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:43:42,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:43:42,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:43:42,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:43:42,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:43:42,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:43:42,856 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:43:42,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:43:42,857 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:43:42,858 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:43:42,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:43:42,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:43:42,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:43:42,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:43:42,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:43:42,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:43:42,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:43:42,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:43:42,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:43:42,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:43:42,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:43:42,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:43:42,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:43:42,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:43:42,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:43:42,861 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 -> 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 [2024-11-16 23:43:43,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:43:43,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:43:43,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:43:43,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:43:43,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:43:43,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2024-11-16 23:43:44,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:43:44,433 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:43:44,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2024-11-16 23:43:44,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8f557ff/c0fe7570748548478fd39cf917f098b0/FLAG07df9d1bf [2024-11-16 23:43:44,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8f557ff/c0fe7570748548478fd39cf917f098b0 [2024-11-16 23:43:44,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:43:44,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:43:44,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:43:44,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:43:44,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:43:44,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:44" (1/1) ... [2024-11-16 23:43:44,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8074dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:44, skipping insertion in model container [2024-11-16 23:43:44,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:44" (1/1) ... [2024-11-16 23:43:44,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:43:45,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:43:45,106 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:43:45,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:43:45,140 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:43:45,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45 WrapperNode [2024-11-16 23:43:45,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:43:45,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:43:45,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:43:45,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:43:45,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,176 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 239 [2024-11-16 23:43:45,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:43:45,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:43:45,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:43:45,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:43:45,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:43:45,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:43:45,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:43:45,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:43:45,201 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (1/1) ... [2024-11-16 23:43:45,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:43:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:43:45,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:43:45,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:43:45,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:43:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:43:45,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:43:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:43:45,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:43:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 23:43:45,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 23:43:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:43:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:43:45,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:43:45,275 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:43:45,372 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:43:45,374 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:43:45,732 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:43:45,732 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:43:45,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:43:45,760 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:43:45,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:43:45 BoogieIcfgContainer [2024-11-16 23:43:45,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:43:45,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:43:45,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:43:45,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:43:45,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:43:44" (1/3) ... [2024-11-16 23:43:45,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dc7c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:43:45, skipping insertion in model container [2024-11-16 23:43:45,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:45" (2/3) ... [2024-11-16 23:43:45,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dc7c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:43:45, skipping insertion in model container [2024-11-16 23:43:45,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:43:45" (3/3) ... [2024-11-16 23:43:45,770 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2024-11-16 23:43:45,783 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:43:45,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-16 23:43:45,784 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:43:45,881 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:43:45,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 325 transitions, 671 flow [2024-11-16 23:43:46,002 INFO L124 PetriNetUnfolderBase]: 15/322 cut-off events. [2024-11-16 23:43:46,004 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:43:46,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 322 events. 15/322 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 778 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2024-11-16 23:43:46,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 325 transitions, 671 flow [2024-11-16 23:43:46,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 302 transitions, 622 flow [2024-11-16 23:43:46,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:43:46,037 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;@55d992a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:43:46,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-16 23:43:46,044 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:43:46,047 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-16 23:43:46,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:43:46,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:46,048 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] [2024-11-16 23:43:46,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash -672093088, now seen corresponding path program 1 times [2024-11-16 23:43:46,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:46,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048123147] [2024-11-16 23:43:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:46,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:46,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048123147] [2024-11-16 23:43:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048123147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:46,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996214346] [2024-11-16 23:43:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:46,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:46,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:46,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-11-16 23:43:46,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:46,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-11-16 23:43:46,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:46,456 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2024-11-16 23:43:46,456 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-16 23:43:46,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 649 events. 25/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3284 event pairs, 7 based on Foata normal form. 22/566 useless extension candidates. Maximal degree in co-relation 514. Up to 25 conditions per place. [2024-11-16 23:43:46,466 INFO L140 encePairwiseOnDemand]: 315/325 looper letters, 11 selfloop transitions, 2 changer transitions 1/294 dead transitions. [2024-11-16 23:43:46,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 294 transitions, 632 flow [2024-11-16 23:43:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-16 23:43:46,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-11-16 23:43:46,480 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 622 flow. Second operand 3 states and 924 transitions. [2024-11-16 23:43:46,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 294 transitions, 632 flow [2024-11-16 23:43:46,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 294 transitions, 620 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:43:46,488 INFO L231 Difference]: Finished difference. Result has 294 places, 293 transitions, 596 flow [2024-11-16 23:43:46,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=293} [2024-11-16 23:43:46,494 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -5 predicate places. [2024-11-16 23:43:46,495 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 293 transitions, 596 flow [2024-11-16 23:43:46,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:46,496 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] [2024-11-16 23:43:46,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:43:46,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:46,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -760951953, now seen corresponding path program 1 times [2024-11-16 23:43:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811513946] [2024-11-16 23:43:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811513946] [2024-11-16 23:43:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811513946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813400509] [2024-11-16 23:43:46,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:46,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-11-16 23:43:46,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:46,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-11-16 23:43:46,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:46,658 INFO L124 PetriNetUnfolderBase]: 21/551 cut-off events. [2024-11-16 23:43:46,659 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-11-16 23:43:46,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 551 events. 21/551 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2549 event pairs, 7 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 555. Up to 25 conditions per place. [2024-11-16 23:43:46,664 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-11-16 23:43:46,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 620 flow [2024-11-16 23:43:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-11-16 23:43:46,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-11-16 23:43:46,667 INFO L175 Difference]: Start difference. First operand has 294 places, 293 transitions, 596 flow. Second operand 3 states and 917 transitions. [2024-11-16 23:43:46,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 620 flow [2024-11-16 23:43:46,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 292 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:46,673 INFO L231 Difference]: Finished difference. Result has 292 places, 292 transitions, 594 flow [2024-11-16 23:43:46,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=292, PETRI_TRANSITIONS=292} [2024-11-16 23:43:46,675 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -7 predicate places. [2024-11-16 23:43:46,675 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 594 flow [2024-11-16 23:43:46,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:46,676 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] [2024-11-16 23:43:46,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:43:46,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:46,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1370942070, now seen corresponding path program 1 times [2024-11-16 23:43:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625209927] [2024-11-16 23:43:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625209927] [2024-11-16 23:43:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625209927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:46,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:46,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969486788] [2024-11-16 23:43:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:46,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:46,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-11-16 23:43:46,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:46,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-11-16 23:43:46,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:46,822 INFO L124 PetriNetUnfolderBase]: 20/460 cut-off events. [2024-11-16 23:43:46,822 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:43:46,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 460 events. 20/460 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1967 event pairs, 8 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 460. Up to 29 conditions per place. [2024-11-16 23:43:46,827 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-11-16 23:43:46,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 620 flow [2024-11-16 23:43:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2024-11-16 23:43:46,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2024-11-16 23:43:46,829 INFO L175 Difference]: Start difference. First operand has 292 places, 292 transitions, 594 flow. Second operand 3 states and 915 transitions. [2024-11-16 23:43:46,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 620 flow [2024-11-16 23:43:46,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:46,833 INFO L231 Difference]: Finished difference. Result has 291 places, 291 transitions, 592 flow [2024-11-16 23:43:46,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=291, PETRI_TRANSITIONS=291} [2024-11-16 23:43:46,834 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -8 predicate places. [2024-11-16 23:43:46,835 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 291 transitions, 592 flow [2024-11-16 23:43:46,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:46,836 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] [2024-11-16 23:43:46,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:43:46,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1421809370, now seen corresponding path program 1 times [2024-11-16 23:43:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639304340] [2024-11-16 23:43:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639304340] [2024-11-16 23:43:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639304340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514488072] [2024-11-16 23:43:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:46,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:46,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-11-16 23:43:46,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 291 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:46,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-11-16 23:43:46,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:46,955 INFO L124 PetriNetUnfolderBase]: 15/424 cut-off events. [2024-11-16 23:43:46,956 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-16 23:43:46,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 424 events. 15/424 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1681 event pairs, 5 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 407. Up to 22 conditions per place. [2024-11-16 23:43:46,959 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-11-16 23:43:46,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 290 transitions, 616 flow [2024-11-16 23:43:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-11-16 23:43:46,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-11-16 23:43:46,962 INFO L175 Difference]: Start difference. First operand has 291 places, 291 transitions, 592 flow. Second operand 3 states and 917 transitions. [2024-11-16 23:43:46,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 290 transitions, 616 flow [2024-11-16 23:43:46,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:46,965 INFO L231 Difference]: Finished difference. Result has 290 places, 290 transitions, 590 flow [2024-11-16 23:43:46,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=290, PETRI_TRANSITIONS=290} [2024-11-16 23:43:46,966 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2024-11-16 23:43:46,966 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 290 transitions, 590 flow [2024-11-16 23:43:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:46,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:46,967 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] [2024-11-16 23:43:46,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:43:46,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:46,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1938224164, now seen corresponding path program 1 times [2024-11-16 23:43:46,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:46,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435494103] [2024-11-16 23:43:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435494103] [2024-11-16 23:43:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435494103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:46,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735261111] [2024-11-16 23:43:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:47,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:47,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:47,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:47,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 325 [2024-11-16 23:43:47,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 290 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:47,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 325 [2024-11-16 23:43:47,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:47,088 INFO L124 PetriNetUnfolderBase]: 42/733 cut-off events. [2024-11-16 23:43:47,088 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-16 23:43:47,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 733 events. 42/733 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3768 event pairs, 20 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 736. Up to 50 conditions per place. [2024-11-16 23:43:47,096 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-16 23:43:47,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 289 transitions, 618 flow [2024-11-16 23:43:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2024-11-16 23:43:47,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9364102564102564 [2024-11-16 23:43:47,098 INFO L175 Difference]: Start difference. First operand has 290 places, 290 transitions, 590 flow. Second operand 3 states and 913 transitions. [2024-11-16 23:43:47,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 289 transitions, 618 flow [2024-11-16 23:43:47,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 289 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:47,101 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 588 flow [2024-11-16 23:43:47,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2024-11-16 23:43:47,102 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-11-16 23:43:47,102 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 588 flow [2024-11-16 23:43:47,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:47,103 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] [2024-11-16 23:43:47,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:43:47,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:47,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1717209069, now seen corresponding path program 1 times [2024-11-16 23:43:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791339186] [2024-11-16 23:43:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:47,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:47,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791339186] [2024-11-16 23:43:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791339186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142271714] [2024-11-16 23:43:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:47,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:47,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:47,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2024-11-16 23:43:47,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:47,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2024-11-16 23:43:47,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:47,212 INFO L124 PetriNetUnfolderBase]: 15/361 cut-off events. [2024-11-16 23:43:47,212 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-11-16 23:43:47,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 361 events. 15/361 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1260 event pairs, 7 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 330. Up to 25 conditions per place. [2024-11-16 23:43:47,217 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-16 23:43:47,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 288 transitions, 612 flow [2024-11-16 23:43:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2024-11-16 23:43:47,219 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2024-11-16 23:43:47,219 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 588 flow. Second operand 3 states and 917 transitions. [2024-11-16 23:43:47,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 288 transitions, 612 flow [2024-11-16 23:43:47,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 288 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:47,223 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 586 flow [2024-11-16 23:43:47,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2024-11-16 23:43:47,224 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-11-16 23:43:47,224 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 586 flow [2024-11-16 23:43:47,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:47,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:47,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:43:47,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:47,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1354308308, now seen corresponding path program 1 times [2024-11-16 23:43:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:47,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367255576] [2024-11-16 23:43:47,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:47,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367255576] [2024-11-16 23:43:47,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367255576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:47,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:47,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:47,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751656229] [2024-11-16 23:43:47,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:47,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:47,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:47,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:47,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:47,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:47,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:47,401 INFO L124 PetriNetUnfolderBase]: 46/884 cut-off events. [2024-11-16 23:43:47,405 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:43:47,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 884 events. 46/884 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5573 event pairs, 12 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 875. Up to 43 conditions per place. [2024-11-16 23:43:47,414 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-11-16 23:43:47,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 290 transitions, 622 flow [2024-11-16 23:43:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-11-16 23:43:47,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2024-11-16 23:43:47,416 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 586 flow. Second operand 3 states and 926 transitions. [2024-11-16 23:43:47,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 290 transitions, 622 flow [2024-11-16 23:43:47,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:47,422 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 592 flow [2024-11-16 23:43:47,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2024-11-16 23:43:47,423 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-11-16 23:43:47,424 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 592 flow [2024-11-16 23:43:47,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:47,425 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] [2024-11-16 23:43:47,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:43:47,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:47,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash -723357284, now seen corresponding path program 1 times [2024-11-16 23:43:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:47,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9890918] [2024-11-16 23:43:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:47,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9890918] [2024-11-16 23:43:47,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9890918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:47,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:47,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313710759] [2024-11-16 23:43:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:47,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:47,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-11-16 23:43:47,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:47,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-11-16 23:43:47,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:47,586 INFO L124 PetriNetUnfolderBase]: 45/803 cut-off events. [2024-11-16 23:43:47,587 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:43:47,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 803 events. 45/803 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4877 event pairs, 10 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 733. Up to 49 conditions per place. [2024-11-16 23:43:47,597 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 15 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2024-11-16 23:43:47,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 634 flow [2024-11-16 23:43:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-11-16 23:43:47,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2024-11-16 23:43:47,599 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 592 flow. Second operand 3 states and 921 transitions. [2024-11-16 23:43:47,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 634 flow [2024-11-16 23:43:47,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:47,621 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 607 flow [2024-11-16 23:43:47,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2024-11-16 23:43:47,623 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-11-16 23:43:47,623 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 607 flow [2024-11-16 23:43:47,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:47,625 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:43:47,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:47,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1655683683, now seen corresponding path program 1 times [2024-11-16 23:43:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086774084] [2024-11-16 23:43:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:47,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086774084] [2024-11-16 23:43:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086774084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:47,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:47,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:47,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103312634] [2024-11-16 23:43:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:47,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:47,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:47,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:47,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:47,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:47,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:47,795 INFO L124 PetriNetUnfolderBase]: 38/959 cut-off events. [2024-11-16 23:43:47,796 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-11-16 23:43:47,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 959 events. 38/959 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5929 event pairs, 4 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 847. Up to 53 conditions per place. [2024-11-16 23:43:47,808 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-16 23:43:47,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 293 transitions, 658 flow [2024-11-16 23:43:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-11-16 23:43:47,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2024-11-16 23:43:47,811 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 607 flow. Second operand 3 states and 929 transitions. [2024-11-16 23:43:47,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 293 transitions, 658 flow [2024-11-16 23:43:47,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 293 transitions, 658 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:47,815 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 617 flow [2024-11-16 23:43:47,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2024-11-16 23:43:47,816 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-11-16 23:43:47,816 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 617 flow [2024-11-16 23:43:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:47,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:47,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:43:47,819 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:47,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1974099328, now seen corresponding path program 1 times [2024-11-16 23:43:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:47,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899180979] [2024-11-16 23:43:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899180979] [2024-11-16 23:43:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899180979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:47,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:47,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:47,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702215245] [2024-11-16 23:43:47,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:47,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:47,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:47,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:47,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:47,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:47,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:47,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:47,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:48,015 INFO L124 PetriNetUnfolderBase]: 33/1027 cut-off events. [2024-11-16 23:43:48,015 INFO L125 PetriNetUnfolderBase]: For 15/25 co-relation queries the response was YES. [2024-11-16 23:43:48,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1027 events. 33/1027 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5870 event pairs, 4 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 965. Up to 51 conditions per place. [2024-11-16 23:43:48,027 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-16 23:43:48,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 293 transitions, 668 flow [2024-11-16 23:43:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-11-16 23:43:48,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2024-11-16 23:43:48,030 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 617 flow. Second operand 3 states and 929 transitions. [2024-11-16 23:43:48,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 293 transitions, 668 flow [2024-11-16 23:43:48,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:48,034 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 627 flow [2024-11-16 23:43:48,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2024-11-16 23:43:48,035 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-11-16 23:43:48,035 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 627 flow [2024-11-16 23:43:48,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:48,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:48,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:43:48,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash -368612929, now seen corresponding path program 1 times [2024-11-16 23:43:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:48,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5304518] [2024-11-16 23:43:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:48,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5304518] [2024-11-16 23:43:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5304518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:48,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:48,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382743611] [2024-11-16 23:43:48,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:48,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:48,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:48,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:48,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 325 [2024-11-16 23:43:48,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:48,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 325 [2024-11-16 23:43:48,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:48,201 INFO L124 PetriNetUnfolderBase]: 34/997 cut-off events. [2024-11-16 23:43:48,201 INFO L125 PetriNetUnfolderBase]: For 4/17 co-relation queries the response was YES. [2024-11-16 23:43:48,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 997 events. 34/997 cut-off events. For 4/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5846 event pairs, 8 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 965. Up to 38 conditions per place. [2024-11-16 23:43:48,216 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-16 23:43:48,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 657 flow [2024-11-16 23:43:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-11-16 23:43:48,219 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2024-11-16 23:43:48,219 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 627 flow. Second operand 3 states and 926 transitions. [2024-11-16 23:43:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 657 flow [2024-11-16 23:43:48,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:48,223 INFO L231 Difference]: Finished difference. Result has 290 places, 287 transitions, 629 flow [2024-11-16 23:43:48,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=290, PETRI_TRANSITIONS=287} [2024-11-16 23:43:48,223 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2024-11-16 23:43:48,224 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 287 transitions, 629 flow [2024-11-16 23:43:48,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:48,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:48,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:43:48,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash 714767436, now seen corresponding path program 1 times [2024-11-16 23:43:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418503346] [2024-11-16 23:43:48,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:48,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418503346] [2024-11-16 23:43:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418503346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:48,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163401967] [2024-11-16 23:43:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:48,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:48,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 325 [2024-11-16 23:43:48,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 287 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:48,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 325 [2024-11-16 23:43:48,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:48,501 INFO L124 PetriNetUnfolderBase]: 226/2802 cut-off events. [2024-11-16 23:43:48,502 INFO L125 PetriNetUnfolderBase]: For 71/221 co-relation queries the response was YES. [2024-11-16 23:43:48,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2802 events. 226/2802 cut-off events. For 71/221 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25475 event pairs, 100 based on Foata normal form. 1/2502 useless extension candidates. Maximal degree in co-relation 2762. Up to 329 conditions per place. [2024-11-16 23:43:48,526 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 17 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2024-11-16 23:43:48,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 677 flow [2024-11-16 23:43:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2024-11-16 23:43:48,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2024-11-16 23:43:48,528 INFO L175 Difference]: Start difference. First operand has 290 places, 287 transitions, 629 flow. Second operand 3 states and 916 transitions. [2024-11-16 23:43:48,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 677 flow [2024-11-16 23:43:48,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:48,532 INFO L231 Difference]: Finished difference. Result has 287 places, 287 transitions, 645 flow [2024-11-16 23:43:48,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=287, PETRI_TRANSITIONS=287} [2024-11-16 23:43:48,533 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-11-16 23:43:48,533 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 287 transitions, 645 flow [2024-11-16 23:43:48,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:48,534 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-11-16 23:43:48,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:43:48,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1481642641, now seen corresponding path program 1 times [2024-11-16 23:43:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765586455] [2024-11-16 23:43:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765586455] [2024-11-16 23:43:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765586455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:48,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774129543] [2024-11-16 23:43:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:48,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:48,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:48,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:48,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 287 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:48,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:48,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:48,786 INFO L124 PetriNetUnfolderBase]: 108/2656 cut-off events. [2024-11-16 23:43:48,787 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2024-11-16 23:43:48,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 2656 events. 108/2656 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 23421 event pairs, 14 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 2473. Up to 164 conditions per place. [2024-11-16 23:43:48,810 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 15 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-11-16 23:43:48,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 691 flow [2024-11-16 23:43:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-11-16 23:43:48,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-11-16 23:43:48,812 INFO L175 Difference]: Start difference. First operand has 287 places, 287 transitions, 645 flow. Second operand 3 states and 928 transitions. [2024-11-16 23:43:48,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 691 flow [2024-11-16 23:43:48,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 291 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:48,818 INFO L231 Difference]: Finished difference. Result has 288 places, 287 transitions, 655 flow [2024-11-16 23:43:48,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=287} [2024-11-16 23:43:48,819 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-11-16 23:43:48,820 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 287 transitions, 655 flow [2024-11-16 23:43:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:48,821 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-11-16 23:43:48,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:43:48,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:48,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash 123843758, now seen corresponding path program 1 times [2024-11-16 23:43:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903038120] [2024-11-16 23:43:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:48,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:48,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903038120] [2024-11-16 23:43:48,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903038120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:48,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562976021] [2024-11-16 23:43:48,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:48,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:48,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:48,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:48,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 287 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:48,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:48,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:48,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:49,053 INFO L124 PetriNetUnfolderBase]: 97/2277 cut-off events. [2024-11-16 23:43:49,053 INFO L125 PetriNetUnfolderBase]: For 24/60 co-relation queries the response was YES. [2024-11-16 23:43:49,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2277 events. 97/2277 cut-off events. For 24/60 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 19497 event pairs, 18 based on Foata normal form. 2/2073 useless extension candidates. Maximal degree in co-relation 2097. Up to 73 conditions per place. [2024-11-16 23:43:49,073 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-16 23:43:49,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 687 flow [2024-11-16 23:43:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-16 23:43:49,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-11-16 23:43:49,075 INFO L175 Difference]: Start difference. First operand has 288 places, 287 transitions, 655 flow. Second operand 3 states and 924 transitions. [2024-11-16 23:43:49,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 687 flow [2024-11-16 23:43:49,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 687 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:49,078 INFO L231 Difference]: Finished difference. Result has 289 places, 286 transitions, 657 flow [2024-11-16 23:43:49,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=289, PETRI_TRANSITIONS=286} [2024-11-16 23:43:49,079 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2024-11-16 23:43:49,079 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 286 transitions, 657 flow [2024-11-16 23:43:49,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:49,080 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] [2024-11-16 23:43:49,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:43:49,080 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:49,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1280770211, now seen corresponding path program 1 times [2024-11-16 23:43:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:49,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097994824] [2024-11-16 23:43:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:49,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097994824] [2024-11-16 23:43:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097994824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:49,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:49,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:49,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394318846] [2024-11-16 23:43:49,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:49,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:49,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:49,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:49,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:49,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:49,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:49,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([788] L55-6-->L55-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet12#1][181], [Black: 349#true, 368#true, Black: 353#true, 362#(= |#race~length_4~0| 0), 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 136#L55-5true, 347#(= |#race~length_2~0| 0), 250#L77true, Black: 341#true, 351#(= |#race~to_int_1~0| 0), 371#true, Black: 345#true, 355#(= |#race~to_int_3~0| 0)]) [2024-11-16 23:43:49,273 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2024-11-16 23:43:49,273 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is not cut-off event [2024-11-16 23:43:49,273 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-11-16 23:43:49,274 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-11-16 23:43:49,275 INFO L124 PetriNetUnfolderBase]: 131/1723 cut-off events. [2024-11-16 23:43:49,275 INFO L125 PetriNetUnfolderBase]: For 86/123 co-relation queries the response was YES. [2024-11-16 23:43:49,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1723 events. 131/1723 cut-off events. For 86/123 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14132 event pairs, 36 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1885. Up to 169 conditions per place. [2024-11-16 23:43:49,286 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-16 23:43:49,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 287 transitions, 689 flow [2024-11-16 23:43:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-16 23:43:49,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-11-16 23:43:49,288 INFO L175 Difference]: Start difference. First operand has 289 places, 286 transitions, 657 flow. Second operand 3 states and 924 transitions. [2024-11-16 23:43:49,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 287 transitions, 689 flow [2024-11-16 23:43:49,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 287 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:49,292 INFO L231 Difference]: Finished difference. Result has 288 places, 285 transitions, 655 flow [2024-11-16 23:43:49,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=285} [2024-11-16 23:43:49,293 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2024-11-16 23:43:49,294 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 285 transitions, 655 flow [2024-11-16 23:43:49,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:49,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:49,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:43:49,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash -400524107, now seen corresponding path program 1 times [2024-11-16 23:43:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5677155] [2024-11-16 23:43:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5677155] [2024-11-16 23:43:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5677155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609300388] [2024-11-16 23:43:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:49,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:49,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:49,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:49,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2024-11-16 23:43:49,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 285 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:49,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2024-11-16 23:43:49,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:49,517 INFO L124 PetriNetUnfolderBase]: 68/2037 cut-off events. [2024-11-16 23:43:49,517 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2024-11-16 23:43:49,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 2037 events. 68/2037 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 16343 event pairs, 4 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2046. Up to 66 conditions per place. [2024-11-16 23:43:49,529 INFO L140 encePairwiseOnDemand]: 323/325 looper letters, 8 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-11-16 23:43:49,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 284 transitions, 671 flow [2024-11-16 23:43:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-11-16 23:43:49,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-11-16 23:43:49,532 INFO L175 Difference]: Start difference. First operand has 288 places, 285 transitions, 655 flow. Second operand 3 states and 928 transitions. [2024-11-16 23:43:49,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 284 transitions, 671 flow [2024-11-16 23:43:49,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:49,537 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 651 flow [2024-11-16 23:43:49,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2024-11-16 23:43:49,538 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2024-11-16 23:43:49,538 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 651 flow [2024-11-16 23:43:49,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:49,539 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] [2024-11-16 23:43:49,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:43:49,539 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1442986464, now seen corresponding path program 1 times [2024-11-16 23:43:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852824111] [2024-11-16 23:43:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852824111] [2024-11-16 23:43:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852824111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:49,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074331300] [2024-11-16 23:43:49,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:49,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:49,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:49,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:49,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:49,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:49,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:49,746 INFO L124 PetriNetUnfolderBase]: 70/2113 cut-off events. [2024-11-16 23:43:49,746 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2024-11-16 23:43:49,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 2113 events. 70/2113 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17216 event pairs, 9 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 2290. Up to 70 conditions per place. [2024-11-16 23:43:49,762 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2024-11-16 23:43:49,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 282 transitions, 669 flow [2024-11-16 23:43:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 922 transitions. [2024-11-16 23:43:49,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456410256410256 [2024-11-16 23:43:49,764 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 651 flow. Second operand 3 states and 922 transitions. [2024-11-16 23:43:49,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 282 transitions, 669 flow [2024-11-16 23:43:49,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 282 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:43:49,768 INFO L231 Difference]: Finished difference. Result has 286 places, 282 transitions, 648 flow [2024-11-16 23:43:49,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=286, PETRI_TRANSITIONS=282} [2024-11-16 23:43:49,768 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -13 predicate places. [2024-11-16 23:43:49,769 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 282 transitions, 648 flow [2024-11-16 23:43:49,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:49,769 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] [2024-11-16 23:43:49,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:43:49,770 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1807523953, now seen corresponding path program 1 times [2024-11-16 23:43:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:49,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013782037] [2024-11-16 23:43:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:43:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013782037] [2024-11-16 23:43:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013782037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724125813] [2024-11-16 23:43:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:49,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:49,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:49,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-16 23:43:49,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 282 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:49,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-16 23:43:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:49,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([792] L55-5-->L55-4: Formula: (= |v_#race~result_8~0_3| |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, #race~result_8~0=|v_#race~result_8~0_3|} AuxVars[] AssignedVars[#race~result_8~0][187], [Black: 349#true, 30#L55-4true, Black: 353#true, 362#(= |#race~length_4~0| 0), 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 250#L77true, 380#true, 351#(= |#race~to_int_1~0| 0), 377#true, Black: 345#true, 355#(= |#race~to_int_3~0| 0)]) [2024-11-16 23:43:49,936 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-11-16 23:43:49,936 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-11-16 23:43:49,937 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-11-16 23:43:49,937 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-11-16 23:43:49,939 INFO L124 PetriNetUnfolderBase]: 68/1516 cut-off events. [2024-11-16 23:43:49,939 INFO L125 PetriNetUnfolderBase]: For 20/36 co-relation queries the response was YES. [2024-11-16 23:43:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1516 events. 68/1516 cut-off events. For 20/36 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11434 event pairs, 18 based on Foata normal form. 5/1415 useless extension candidates. Maximal degree in co-relation 1719. Up to 89 conditions per place. [2024-11-16 23:43:49,952 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 0 selfloop transitions, 0 changer transitions 280/280 dead transitions. [2024-11-16 23:43:49,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 280 transitions, 664 flow [2024-11-16 23:43:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-11-16 23:43:49,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2024-11-16 23:43:49,954 INFO L175 Difference]: Start difference. First operand has 286 places, 282 transitions, 648 flow. Second operand 3 states and 921 transitions. [2024-11-16 23:43:49,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 280 transitions, 664 flow [2024-11-16 23:43:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:43:49,957 INFO L231 Difference]: Finished difference. Result has 285 places, 0 transitions, 0 flow [2024-11-16 23:43:49,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=285, PETRI_TRANSITIONS=0} [2024-11-16 23:43:49,958 INFO L277 CegarLoopForPetriNet]: 299 programPoint places, -14 predicate places. [2024-11-16 23:43:49,958 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 0 transitions, 0 flow [2024-11-16 23:43:49,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:49,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-11-16 23:43:49,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-11-16 23:43:49,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-11-16 23:43:49,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-11-16 23:43:49,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-11-16 23:43:49,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-11-16 23:43:49,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-11-16 23:43:49,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-11-16 23:43:49,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-11-16 23:43:49,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-11-16 23:43:49,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-11-16 23:43:49,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 50 remaining) [2024-11-16 23:43:49,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-11-16 23:43:49,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-11-16 23:43:49,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-11-16 23:43:49,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:43:49,968 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:49,973 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:43:49,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:43:49,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:43:49 BasicIcfg [2024-11-16 23:43:49,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:43:49,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:43:49,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:43:49,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:43:49,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:43:45" (3/4) ... [2024-11-16 23:43:49,980 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:43:49,983 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 23:43:49,983 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 23:43:49,983 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-16 23:43:49,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-16 23:43:49,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:43:49,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:43:49,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:43:50,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:43:50,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:43:50,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:43:50,085 INFO L158 Benchmark]: Toolchain (without parser) took 5217.14ms. Allocated memory was 153.1MB in the beginning and 352.3MB in the end (delta: 199.2MB). Free memory was 96.7MB in the beginning and 209.7MB in the end (delta: -112.9MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2024-11-16 23:43:50,085 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:43:50,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.96ms. Allocated memory is still 153.1MB. Free memory was 96.7MB in the beginning and 83.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 23:43:50,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.60ms. Allocated memory is still 153.1MB. Free memory was 83.2MB in the beginning and 80.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:43:50,086 INFO L158 Benchmark]: Boogie Preprocessor took 22.65ms. Allocated memory is still 153.1MB. Free memory was 80.8MB in the beginning and 79.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:43:50,086 INFO L158 Benchmark]: IcfgBuilder took 561.01ms. Allocated memory is still 153.1MB. Free memory was 79.1MB in the beginning and 112.3MB in the end (delta: -33.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-11-16 23:43:50,086 INFO L158 Benchmark]: TraceAbstraction took 4215.60ms. Allocated memory was 153.1MB in the beginning and 352.3MB in the end (delta: 199.2MB). Free memory was 112.3MB in the beginning and 214.9MB in the end (delta: -102.6MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2024-11-16 23:43:50,086 INFO L158 Benchmark]: Witness Printer took 106.07ms. Allocated memory is still 352.3MB. Free memory was 214.9MB in the beginning and 209.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 23:43:50,088 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.96ms. Allocated memory is still 153.1MB. Free memory was 96.7MB in the beginning and 83.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.60ms. Allocated memory is still 153.1MB. Free memory was 83.2MB in the beginning and 80.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.65ms. Allocated memory is still 153.1MB. Free memory was 80.8MB in the beginning and 79.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 561.01ms. Allocated memory is still 153.1MB. Free memory was 79.1MB in the beginning and 112.3MB in the end (delta: -33.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4215.60ms. Allocated memory was 153.1MB in the beginning and 352.3MB in the end (delta: 199.2MB). Free memory was 112.3MB in the beginning and 214.9MB in the end (delta: -102.6MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. * Witness Printer took 106.07ms. Allocated memory is still 352.3MB. Free memory was 214.9MB in the beginning and 209.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 488 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 87 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=14, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1477 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-16 23:43:50,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE