./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:30:44,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:30:44,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:30:44,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:30:44,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:30:45,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:30:45,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:30:45,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:30:45,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:30:45,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:30:45,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:30:45,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:30:45,018 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:30:45,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:30:45,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:30:45,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:30:45,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:30:45,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:30:45,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:30:45,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:30:45,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:30:45,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:30:45,022 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:30:45,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:30:45,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:30:45,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:30:45,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:30:45,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:30:45,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:30:45,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:30:45,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:30:45,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:30:45,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:30:45,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:30:45,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:30:45,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:30:45,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:30:45,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:30:45,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:30:45,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:30:45,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:30:45,029 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f [2024-10-24 15:30:45,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:30:45,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:30:45,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:30:45,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:30:45,303 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:30:45,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-10-24 15:30:46,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:30:47,016 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:30:47,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-10-24 15:30:47,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf7f3dd0/38a4b8a6a1cb487594c0da912c4efb5f/FLAGcb852fa6b [2024-10-24 15:30:47,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf7f3dd0/38a4b8a6a1cb487594c0da912c4efb5f [2024-10-24 15:30:47,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:30:47,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:30:47,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:30:47,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:30:47,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:30:47,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1889b8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47, skipping insertion in model container [2024-10-24 15:30:47,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:30:47,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:30:47,325 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:30:47,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:30:47,366 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:30:47,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47 WrapperNode [2024-10-24 15:30:47,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:30:47,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:30:47,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:30:47,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:30:47,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,412 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 241 [2024-10-24 15:30:47,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:30:47,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:30:47,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:30:47,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:30:47,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:30:47,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:30:47,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:30:47,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:30:47,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (1/1) ... [2024-10-24 15:30:47,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:30:47,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:30:47,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:30:47,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:30:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:30:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 15:30:47,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 15:30:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 15:30:47,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 15:30:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:30:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:30:47,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:30:47,565 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:30:47,668 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:30:47,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:30:48,093 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:30:48,093 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:30:48,122 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:30:48,124 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 15:30:48,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:30:48 BoogieIcfgContainer [2024-10-24 15:30:48,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:30:48,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:30:48,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:30:48,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:30:48,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:30:47" (1/3) ... [2024-10-24 15:30:48,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f433c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:30:48, skipping insertion in model container [2024-10-24 15:30:48,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:30:47" (2/3) ... [2024-10-24 15:30:48,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f433c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:30:48, skipping insertion in model container [2024-10-24 15:30:48,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:30:48" (3/3) ... [2024-10-24 15:30:48,136 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2024-10-24 15:30:48,153 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:30:48,153 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-24 15:30:48,154 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:30:48,275 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 15:30:48,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 341 transitions, 696 flow [2024-10-24 15:30:48,447 INFO L124 PetriNetUnfolderBase]: 16/339 cut-off events. [2024-10-24 15:30:48,448 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:30:48,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 339 events. 16/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2024-10-24 15:30:48,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 341 transitions, 696 flow [2024-10-24 15:30:48,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 319 transitions, 650 flow [2024-10-24 15:30:48,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:30:48,492 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;@1bdf7ffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:30:48,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-24 15:30:48,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:30:48,502 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-24 15:30:48,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:30:48,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:48,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:48,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:48,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:48,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1891127115, now seen corresponding path program 1 times [2024-10-24 15:30:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:48,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659173189] [2024-10-24 15:30:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:48,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:48,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659173189] [2024-10-24 15:30:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659173189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665522851] [2024-10-24 15:30:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:48,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:48,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:48,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-10-24 15:30:48,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 319 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:48,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:48,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-10-24 15:30:48,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:48,944 INFO L124 PetriNetUnfolderBase]: 14/504 cut-off events. [2024-10-24 15:30:48,944 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-10-24 15:30:48,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 504 events. 14/504 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1208 event pairs, 8 based on Foata normal form. 27/459 useless extension candidates. Maximal degree in co-relation 403. Up to 28 conditions per place. [2024-10-24 15:30:48,953 INFO L140 encePairwiseOnDemand]: 328/341 looper letters, 11 selfloop transitions, 2 changer transitions 2/308 dead transitions. [2024-10-24 15:30:48,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 654 flow [2024-10-24 15:30:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2024-10-24 15:30:48,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442815249266863 [2024-10-24 15:30:48,978 INFO L175 Difference]: Start difference. First operand has 312 places, 319 transitions, 650 flow. Second operand 3 states and 966 transitions. [2024-10-24 15:30:48,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 654 flow [2024-10-24 15:30:48,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 646 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 15:30:48,991 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 620 flow [2024-10-24 15:30:48,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2024-10-24 15:30:48,997 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -3 predicate places. [2024-10-24 15:30:48,998 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 620 flow [2024-10-24 15:30:48,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:48,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:49,000 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:49,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:30:49,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:49,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash 79721871, now seen corresponding path program 1 times [2024-10-24 15:30:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523754307] [2024-10-24 15:30:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523754307] [2024-10-24 15:30:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523754307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:49,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166808748] [2024-10-24 15:30:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:49,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:49,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-24 15:30:49,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:49,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-24 15:30:49,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:49,230 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-10-24 15:30:49,231 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:30:49,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1133 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 480. Up to 16 conditions per place. [2024-10-24 15:30:49,238 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-10-24 15:30:49,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 305 transitions, 640 flow [2024-10-24 15:30:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-24 15:30:49,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-24 15:30:49,247 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 620 flow. Second operand 3 states and 960 transitions. [2024-10-24 15:30:49,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 305 transitions, 640 flow [2024-10-24 15:30:49,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:49,281 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 618 flow [2024-10-24 15:30:49,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2024-10-24 15:30:49,286 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -6 predicate places. [2024-10-24 15:30:49,286 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 618 flow [2024-10-24 15:30:49,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:49,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:49,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:30:49,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:49,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 812410856, now seen corresponding path program 1 times [2024-10-24 15:30:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514237235] [2024-10-24 15:30:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:49,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:49,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514237235] [2024-10-24 15:30:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514237235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:49,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311103380] [2024-10-24 15:30:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:49,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:49,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:49,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-24 15:30:49,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:49,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-24 15:30:49,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:49,469 INFO L124 PetriNetUnfolderBase]: 9/480 cut-off events. [2024-10-24 15:30:49,469 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:30:49,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 480 events. 9/480 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1094 event pairs, 3 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 465. Up to 16 conditions per place. [2024-10-24 15:30:49,473 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-10-24 15:30:49,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 304 transitions, 638 flow [2024-10-24 15:30:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-24 15:30:49,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-24 15:30:49,477 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 618 flow. Second operand 3 states and 960 transitions. [2024-10-24 15:30:49,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 304 transitions, 638 flow [2024-10-24 15:30:49,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 304 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:49,482 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 616 flow [2024-10-24 15:30:49,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=305, PETRI_TRANSITIONS=304} [2024-10-24 15:30:49,484 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -7 predicate places. [2024-10-24 15:30:49,484 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 616 flow [2024-10-24 15:30:49,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:49,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:30:49,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:49,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2039657065, now seen corresponding path program 1 times [2024-10-24 15:30:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:49,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41027197] [2024-10-24 15:30:49,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:49,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:49,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41027197] [2024-10-24 15:30:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41027197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:49,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:49,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096234345] [2024-10-24 15:30:49,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:49,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:49,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:49,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:49,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-10-24 15:30:49,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:49,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-10-24 15:30:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:49,659 INFO L124 PetriNetUnfolderBase]: 14/499 cut-off events. [2024-10-24 15:30:49,659 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-24 15:30:49,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 499 events. 14/499 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1212 event pairs, 8 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 489. Up to 28 conditions per place. [2024-10-24 15:30:49,664 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 11 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2024-10-24 15:30:49,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 640 flow [2024-10-24 15:30:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-24 15:30:49,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-24 15:30:49,668 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 616 flow. Second operand 3 states and 956 transitions. [2024-10-24 15:30:49,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 303 transitions, 640 flow [2024-10-24 15:30:49,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 303 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:49,673 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 614 flow [2024-10-24 15:30:49,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2024-10-24 15:30:49,675 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-10-24 15:30:49,675 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 614 flow [2024-10-24 15:30:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:49,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:49,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:30:49,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1460679319, now seen corresponding path program 1 times [2024-10-24 15:30:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531650551] [2024-10-24 15:30:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:49,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-10-24 15:30:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531650551] [2024-10-24 15:30:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531650551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:49,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:49,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292622760] [2024-10-24 15:30:49,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:49,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:49,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:49,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:49,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-24 15:30:49,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:49,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-24 15:30:49,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:49,841 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-10-24 15:30:49,842 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-24 15:30:49,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 790 event pairs, 3 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 456. Up to 16 conditions per place. [2024-10-24 15:30:49,845 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-24 15:30:49,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 302 transitions, 634 flow [2024-10-24 15:30:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-24 15:30:49,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-24 15:30:49,849 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 614 flow. Second operand 3 states and 960 transitions. [2024-10-24 15:30:49,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 302 transitions, 634 flow [2024-10-24 15:30:49,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:49,854 INFO L231 Difference]: Finished difference. Result has 303 places, 302 transitions, 612 flow [2024-10-24 15:30:49,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=303, PETRI_TRANSITIONS=302} [2024-10-24 15:30:49,856 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-24 15:30:49,857 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 302 transitions, 612 flow [2024-10-24 15:30:49,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:49,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:49,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:30:49,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:49,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash -725008606, now seen corresponding path program 1 times [2024-10-24 15:30:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:49,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976952086] [2024-10-24 15:30:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:49,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976952086] [2024-10-24 15:30:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976952086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:49,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4454187] [2024-10-24 15:30:49,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:49,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:49,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:49,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-24 15:30:49,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:49,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:49,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-24 15:30:49,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:50,026 INFO L124 PetriNetUnfolderBase]: 9/483 cut-off events. [2024-10-24 15:30:50,026 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-24 15:30:50,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 483 events. 9/483 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 777 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 444. Up to 16 conditions per place. [2024-10-24 15:30:50,031 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2024-10-24 15:30:50,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 632 flow [2024-10-24 15:30:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-24 15:30:50,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-24 15:30:50,034 INFO L175 Difference]: Start difference. First operand has 303 places, 302 transitions, 612 flow. Second operand 3 states and 960 transitions. [2024-10-24 15:30:50,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 632 flow [2024-10-24 15:30:50,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:50,040 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 610 flow [2024-10-24 15:30:50,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-10-24 15:30:50,041 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-24 15:30:50,041 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 610 flow [2024-10-24 15:30:50,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:50,043 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:50,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:30:50,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:50,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash -808007066, now seen corresponding path program 1 times [2024-10-24 15:30:50,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468730851] [2024-10-24 15:30:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468730851] [2024-10-24 15:30:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468730851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:50,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660887248] [2024-10-24 15:30:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:50,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:50,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:50,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:50,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-24 15:30:50,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:50,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-24 15:30:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:50,210 INFO L124 PetriNetUnfolderBase]: 17/649 cut-off events. [2024-10-24 15:30:50,211 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 15:30:50,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 649 events. 17/649 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1959 event pairs, 4 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 611. Up to 22 conditions per place. [2024-10-24 15:30:50,215 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-24 15:30:50,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 637 flow [2024-10-24 15:30:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-24 15:30:50,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-24 15:30:50,218 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 610 flow. Second operand 3 states and 968 transitions. [2024-10-24 15:30:50,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 637 flow [2024-10-24 15:30:50,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:50,224 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 616 flow [2024-10-24 15:30:50,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2024-10-24 15:30:50,226 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -11 predicate places. [2024-10-24 15:30:50,226 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 616 flow [2024-10-24 15:30:50,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:50,227 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:50,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:30:50,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:50,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 894315208, now seen corresponding path program 1 times [2024-10-24 15:30:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:50,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512288368] [2024-10-24 15:30:50,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:50,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:50,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512288368] [2024-10-24 15:30:50,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512288368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:50,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:50,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:50,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498745508] [2024-10-24 15:30:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:50,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:50,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:50,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-24 15:30:50,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:50,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-24 15:30:50,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:50,383 INFO L124 PetriNetUnfolderBase]: 19/725 cut-off events. [2024-10-24 15:30:50,384 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 15:30:50,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 725 events. 19/725 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2490 event pairs, 5 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 625. Up to 24 conditions per place. [2024-10-24 15:30:50,389 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-24 15:30:50,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 643 flow [2024-10-24 15:30:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-24 15:30:50,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-24 15:30:50,392 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 616 flow. Second operand 3 states and 968 transitions. [2024-10-24 15:30:50,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 643 flow [2024-10-24 15:30:50,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 643 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:30:50,397 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 626 flow [2024-10-24 15:30:50,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-10-24 15:30:50,398 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-24 15:30:50,398 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 626 flow [2024-10-24 15:30:50,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:50,400 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:50,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:30:50,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1671683357, now seen corresponding path program 1 times [2024-10-24 15:30:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869887841] [2024-10-24 15:30:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869887841] [2024-10-24 15:30:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869887841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:50,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:50,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:50,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119135801] [2024-10-24 15:30:50,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:50,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:50,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:50,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:50,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-24 15:30:50,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:50,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-24 15:30:50,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:50,547 INFO L124 PetriNetUnfolderBase]: 20/667 cut-off events. [2024-10-24 15:30:50,547 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-24 15:30:50,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 667 events. 20/667 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2599 event pairs, 3 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 574. Up to 22 conditions per place. [2024-10-24 15:30:50,551 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-24 15:30:50,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 653 flow [2024-10-24 15:30:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-24 15:30:50,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-24 15:30:50,554 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 626 flow. Second operand 3 states and 968 transitions. [2024-10-24 15:30:50,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 653 flow [2024-10-24 15:30:50,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:30:50,559 INFO L231 Difference]: Finished difference. Result has 303 places, 301 transitions, 636 flow [2024-10-24 15:30:50,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=303, PETRI_TRANSITIONS=301} [2024-10-24 15:30:50,561 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-24 15:30:50,561 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 301 transitions, 636 flow [2024-10-24 15:30:50,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:50,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:30:50,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 169965439, now seen corresponding path program 1 times [2024-10-24 15:30:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053403014] [2024-10-24 15:30:50,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:50,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053403014] [2024-10-24 15:30:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053403014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:50,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:50,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656325051] [2024-10-24 15:30:50,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:50,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:50,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:50,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:50,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-24 15:30:50,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 301 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:50,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-24 15:30:50,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:50,738 INFO L124 PetriNetUnfolderBase]: 22/710 cut-off events. [2024-10-24 15:30:50,738 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-24 15:30:50,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 710 events. 22/710 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2979 event pairs, 3 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 626. Up to 25 conditions per place. [2024-10-24 15:30:50,743 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-24 15:30:50,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 663 flow [2024-10-24 15:30:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-24 15:30:50,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-24 15:30:50,746 INFO L175 Difference]: Start difference. First operand has 303 places, 301 transitions, 636 flow. Second operand 3 states and 968 transitions. [2024-10-24 15:30:50,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 663 flow [2024-10-24 15:30:50,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:30:50,752 INFO L231 Difference]: Finished difference. Result has 304 places, 301 transitions, 646 flow [2024-10-24 15:30:50,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=301} [2024-10-24 15:30:50,753 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-10-24 15:30:50,753 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 301 transitions, 646 flow [2024-10-24 15:30:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:50,755 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:50,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:30:50,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:50,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1498151222, now seen corresponding path program 1 times [2024-10-24 15:30:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:50,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654359550] [2024-10-24 15:30:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:50,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:50,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654359550] [2024-10-24 15:30:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654359550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:50,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:50,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755718697] [2024-10-24 15:30:50,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:50,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:50,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:50,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-10-24 15:30:50,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 301 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:50,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-10-24 15:30:50,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:50,928 INFO L124 PetriNetUnfolderBase]: 43/669 cut-off events. [2024-10-24 15:30:50,928 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-24 15:30:50,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 669 events. 43/669 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2597 event pairs, 16 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 642. Up to 76 conditions per place. [2024-10-24 15:30:50,933 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-10-24 15:30:50,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 677 flow [2024-10-24 15:30:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-24 15:30:50,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-24 15:30:50,936 INFO L175 Difference]: Start difference. First operand has 304 places, 301 transitions, 646 flow. Second operand 3 states and 956 transitions. [2024-10-24 15:30:50,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 677 flow [2024-10-24 15:30:50,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 300 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:30:50,942 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 652 flow [2024-10-24 15:30:50,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2024-10-24 15:30:50,943 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-24 15:30:50,943 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 652 flow [2024-10-24 15:30:50,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:50,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:50,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:50,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:30:50,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:50,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash -909252948, now seen corresponding path program 1 times [2024-10-24 15:30:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817361864] [2024-10-24 15:30:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:51,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817361864] [2024-10-24 15:30:51,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817361864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:51,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:51,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966890178] [2024-10-24 15:30:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:51,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:51,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-10-24 15:30:51,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:51,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-10-24 15:30:51,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:51,121 INFO L124 PetriNetUnfolderBase]: 47/692 cut-off events. [2024-10-24 15:30:51,122 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-24 15:30:51,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 692 events. 47/692 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2669 event pairs, 16 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 688. Up to 81 conditions per place. [2024-10-24 15:30:51,125 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-10-24 15:30:51,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 298 transitions, 683 flow [2024-10-24 15:30:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-24 15:30:51,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-24 15:30:51,128 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 652 flow. Second operand 3 states and 956 transitions. [2024-10-24 15:30:51,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 298 transitions, 683 flow [2024-10-24 15:30:51,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:30:51,133 INFO L231 Difference]: Finished difference. Result has 302 places, 297 transitions, 658 flow [2024-10-24 15:30:51,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=297} [2024-10-24 15:30:51,135 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-24 15:30:51,135 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 658 flow [2024-10-24 15:30:51,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:51,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:51,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:30:51,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:51,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1040875051, now seen corresponding path program 1 times [2024-10-24 15:30:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:51,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830187286] [2024-10-24 15:30:51,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:51,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:51,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830187286] [2024-10-24 15:30:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830187286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:51,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791502824] [2024-10-24 15:30:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:51,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:51,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-10-24 15:30:51,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:51,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-10-24 15:30:51,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:51,276 INFO L124 PetriNetUnfolderBase]: 21/545 cut-off events. [2024-10-24 15:30:51,276 INFO L125 PetriNetUnfolderBase]: For 4/9 co-relation queries the response was YES. [2024-10-24 15:30:51,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 545 events. 21/545 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1772 event pairs, 2 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 501. Up to 20 conditions per place. [2024-10-24 15:30:51,280 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-24 15:30:51,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 297 transitions, 683 flow [2024-10-24 15:30:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-24 15:30:51,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-10-24 15:30:51,283 INFO L175 Difference]: Start difference. First operand has 302 places, 297 transitions, 658 flow. Second operand 3 states and 964 transitions. [2024-10-24 15:30:51,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 297 transitions, 683 flow [2024-10-24 15:30:51,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 297 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:30:51,289 INFO L231 Difference]: Finished difference. Result has 303 places, 296 transitions, 660 flow [2024-10-24 15:30:51,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=303, PETRI_TRANSITIONS=296} [2024-10-24 15:30:51,290 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-24 15:30:51,290 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 296 transitions, 660 flow [2024-10-24 15:30:51,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:51,291 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:51,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:30:51,291 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1343105908, now seen corresponding path program 1 times [2024-10-24 15:30:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:51,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791075115] [2024-10-24 15:30:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:51,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791075115] [2024-10-24 15:30:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791075115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162031761] [2024-10-24 15:30:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:51,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:51,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-10-24 15:30:51,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:51,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-10-24 15:30:51,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:51,414 INFO L124 PetriNetUnfolderBase]: 20/536 cut-off events. [2024-10-24 15:30:51,414 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-24 15:30:51,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 536 events. 20/536 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1670 event pairs, 2 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 543. Up to 24 conditions per place. [2024-10-24 15:30:51,418 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-10-24 15:30:51,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 685 flow [2024-10-24 15:30:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-24 15:30:51,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-10-24 15:30:51,421 INFO L175 Difference]: Start difference. First operand has 303 places, 296 transitions, 660 flow. Second operand 3 states and 964 transitions. [2024-10-24 15:30:51,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 685 flow [2024-10-24 15:30:51,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 296 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:51,426 INFO L231 Difference]: Finished difference. Result has 302 places, 295 transitions, 658 flow [2024-10-24 15:30:51,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=295} [2024-10-24 15:30:51,427 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-24 15:30:51,427 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 295 transitions, 658 flow [2024-10-24 15:30:51,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:51,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:51,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:30:51,428 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:51,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1721930605, now seen corresponding path program 1 times [2024-10-24 15:30:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:51,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943391246] [2024-10-24 15:30:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:51,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943391246] [2024-10-24 15:30:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943391246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:51,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:30:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915613024] [2024-10-24 15:30:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:51,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-24 15:30:51,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 295 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:51,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-24 15:30:51,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:51,637 INFO L124 PetriNetUnfolderBase]: 20/639 cut-off events. [2024-10-24 15:30:51,637 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-24 15:30:51,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 639 events. 20/639 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2203 event pairs, 3 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 620. Up to 25 conditions per place. [2024-10-24 15:30:51,641 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 13 selfloop transitions, 1 changer transitions 2/298 dead transitions. [2024-10-24 15:30:51,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 298 transitions, 695 flow [2024-10-24 15:30:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2024-10-24 15:30:51,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9472140762463344 [2024-10-24 15:30:51,643 INFO L175 Difference]: Start difference. First operand has 302 places, 295 transitions, 658 flow. Second operand 3 states and 969 transitions. [2024-10-24 15:30:51,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 298 transitions, 695 flow [2024-10-24 15:30:51,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 298 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:30:51,648 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 655 flow [2024-10-24 15:30:51,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2024-10-24 15:30:51,649 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-24 15:30:51,649 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 655 flow [2024-10-24 15:30:51,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:51,650 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:51,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:30:51,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:51,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash 954116435, now seen corresponding path program 2 times [2024-10-24 15:30:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:51,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496385734] [2024-10-24 15:30:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:51,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496385734] [2024-10-24 15:30:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496385734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:30:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419475433] [2024-10-24 15:30:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:51,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:51,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-24 15:30:51,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:51,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-24 15:30:51,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:51,848 INFO L124 PetriNetUnfolderBase]: 18/719 cut-off events. [2024-10-24 15:30:51,849 INFO L125 PetriNetUnfolderBase]: For 33/37 co-relation queries the response was YES. [2024-10-24 15:30:51,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 719 events. 18/719 cut-off events. For 33/37 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2666 event pairs, 4 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 715. Up to 31 conditions per place. [2024-10-24 15:30:51,851 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 12 selfloop transitions, 1 changer transitions 2/295 dead transitions. [2024-10-24 15:30:51,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 687 flow [2024-10-24 15:30:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-24 15:30:51,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-24 15:30:51,854 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 655 flow. Second operand 3 states and 968 transitions. [2024-10-24 15:30:51,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 295 transitions, 687 flow [2024-10-24 15:30:51,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 295 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:30:51,859 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 655 flow [2024-10-24 15:30:51,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2024-10-24 15:30:51,860 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-24 15:30:51,860 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 655 flow [2024-10-24 15:30:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:51,861 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 15:30:51,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 169845892, now seen corresponding path program 1 times [2024-10-24 15:30:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573330488] [2024-10-24 15:30:51,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:51,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:51,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573330488] [2024-10-24 15:30:51,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573330488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:51,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:51,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622644815] [2024-10-24 15:30:51,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:51,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:51,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:51,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:51,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:51,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-10-24 15:30:51,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:51,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:51,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-10-24 15:30:51,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:52,033 INFO L124 PetriNetUnfolderBase]: 16/675 cut-off events. [2024-10-24 15:30:52,033 INFO L125 PetriNetUnfolderBase]: For 29/40 co-relation queries the response was YES. [2024-10-24 15:30:52,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 675 events. 16/675 cut-off events. For 29/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2453 event pairs, 2 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 687. Up to 22 conditions per place. [2024-10-24 15:30:52,037 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2024-10-24 15:30:52,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 671 flow [2024-10-24 15:30:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2024-10-24 15:30:52,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374389051808406 [2024-10-24 15:30:52,041 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 655 flow. Second operand 3 states and 959 transitions. [2024-10-24 15:30:52,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 671 flow [2024-10-24 15:30:52,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 288 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:30:52,045 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 650 flow [2024-10-24 15:30:52,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2024-10-24 15:30:52,047 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -13 predicate places. [2024-10-24 15:30:52,047 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 650 flow [2024-10-24 15:30:52,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:52,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:30:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:52,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 15:30:52,049 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-24 15:30:52,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:30:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1903255492, now seen corresponding path program 1 times [2024-10-24 15:30:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:30:52,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391550308] [2024-10-24 15:30:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:30:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:30:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:30:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:30:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:30:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391550308] [2024-10-24 15:30:52,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391550308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:30:52,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:30:52,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:30:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373235489] [2024-10-24 15:30:52,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:30:52,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:30:52,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:30:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:30:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:30:52,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-10-24 15:30:52,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:52,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:30:52,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-10-24 15:30:52,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:30:52,242 INFO L124 PetriNetUnfolderBase]: 18/740 cut-off events. [2024-10-24 15:30:52,243 INFO L125 PetriNetUnfolderBase]: For 18/21 co-relation queries the response was YES. [2024-10-24 15:30:52,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 740 events. 18/740 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2854 event pairs, 3 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 718. Up to 28 conditions per place. [2024-10-24 15:30:52,245 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2024-10-24 15:30:52,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 672 flow [2024-10-24 15:30:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:30:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:30:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-24 15:30:52,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-24 15:30:52,248 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 650 flow. Second operand 3 states and 960 transitions. [2024-10-24 15:30:52,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 672 flow [2024-10-24 15:30:52,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 287 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:30:52,252 INFO L231 Difference]: Finished difference. Result has 297 places, 0 transitions, 0 flow [2024-10-24 15:30:52,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=297, PETRI_TRANSITIONS=0} [2024-10-24 15:30:52,254 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -15 predicate places. [2024-10-24 15:30:52,255 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 0 transitions, 0 flow [2024-10-24 15:30:52,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:30:52,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-10-24 15:30:52,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-10-24 15:30:52,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-10-24 15:30:52,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-10-24 15:30:52,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-10-24 15:30:52,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-10-24 15:30:52,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-10-24 15:30:52,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-10-24 15:30:52,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-10-24 15:30:52,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-10-24 15:30:52,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-10-24 15:30:52,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-10-24 15:30:52,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-10-24 15:30:52,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-10-24 15:30:52,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-10-24 15:30:52,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-10-24 15:30:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-10-24 15:30:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-10-24 15:30:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-10-24 15:30:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-10-24 15:30:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-10-24 15:30:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-10-24 15:30:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-10-24 15:30:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-10-24 15:30:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-10-24 15:30:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-10-24 15:30:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-10-24 15:30:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-10-24 15:30:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-10-24 15:30:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-10-24 15:30:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-10-24 15:30:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-10-24 15:30:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-10-24 15:30:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-10-24 15:30:52,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-10-24 15:30:52,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-10-24 15:30:52,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-10-24 15:30:52,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-10-24 15:30:52,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-10-24 15:30:52,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-10-24 15:30:52,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-10-24 15:30:52,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-10-24 15:30:52,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-10-24 15:30:52,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-10-24 15:30:52,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-10-24 15:30:52,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-10-24 15:30:52,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-10-24 15:30:52,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-10-24 15:30:52,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-10-24 15:30:52,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-10-24 15:30:52,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 15:30:52,269 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:30:52,276 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 15:30:52,277 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:30:52,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:30:52 BasicIcfg [2024-10-24 15:30:52,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:30:52,283 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:30:52,283 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:30:52,283 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:30:52,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:30:48" (3/4) ... [2024-10-24 15:30:52,285 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 15:30:52,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-24 15:30:52,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-24 15:30:52,300 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-24 15:30:52,300 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 15:30:52,301 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 15:30:52,301 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 15:30:52,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 15:30:52,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 15:30:52,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:30:52,401 INFO L158 Benchmark]: Toolchain (without parser) took 5360.92ms. Allocated memory was 151.0MB in the beginning and 281.0MB in the end (delta: 130.0MB). Free memory was 96.4MB in the beginning and 210.2MB in the end (delta: -113.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-10-24 15:30:52,401 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:30:52,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.57ms. Allocated memory is still 151.0MB. Free memory was 96.1MB in the beginning and 82.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 15:30:52,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.53ms. Allocated memory is still 151.0MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:30:52,402 INFO L158 Benchmark]: Boogie Preprocessor took 30.49ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 77.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:30:52,402 INFO L158 Benchmark]: RCFGBuilder took 680.46ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 77.9MB in the beginning and 156.4MB in the end (delta: -78.5MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-24 15:30:52,402 INFO L158 Benchmark]: TraceAbstraction took 4153.83ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 155.3MB in the beginning and 215.5MB in the end (delta: -60.1MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2024-10-24 15:30:52,402 INFO L158 Benchmark]: Witness Printer took 117.28ms. Allocated memory is still 281.0MB. Free memory was 215.5MB in the beginning and 210.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 15:30:52,404 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.18ms. Allocated memory is still 151.0MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.57ms. Allocated memory is still 151.0MB. Free memory was 96.1MB in the beginning and 82.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.53ms. Allocated memory is still 151.0MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.49ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 77.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 680.46ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 77.9MB in the beginning and 156.4MB in the end (delta: -78.5MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4153.83ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 155.3MB in the beginning and 215.5MB in the end (delta: -60.1MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. * Witness Printer took 117.28ms. Allocated memory is still 281.0MB. Free memory was 215.5MB in the beginning and 210.2MB 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: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 508 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 125 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=13, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2020 NumberOfCodeBlocks, 2020 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 15:30:52,428 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