./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/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:15:46,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:15:46,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:15:46,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:15:46,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:15:46,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:15:46,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:15:46,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:15:46,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:15:46,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:15:46,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:15:46,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:15:46,301 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:15:46,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:15:46,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:15:46,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:15:46,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:15:46,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:15:46,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:15:46,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:15:46,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:15:46,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:15:46,309 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:15:46,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:15:46,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:15:46,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:15:46,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:15:46,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:15:46,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:15:46,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:15:46,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:15:46,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:46,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:15:46,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:15:46,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:15:46,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:15:46,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:15:46,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:15:46,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:15:46,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:15:46,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:15:46,315 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-clean/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-clean/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 -> 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e [2024-10-11 17:15:46,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:15:46,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:15:46,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:15:46,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:15:46,611 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:15:46,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-10-11 17:15:48,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:15:48,232 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:15:48,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-10-11 17:15:48,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e45d44506/2efdb06104bf49c3b4c63b8657b7e9ca/FLAG17c2f1159 [2024-10-11 17:15:48,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e45d44506/2efdb06104bf49c3b4c63b8657b7e9ca [2024-10-11 17:15:48,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:15:48,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:15:48,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:48,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:15:48,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:15:48,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@251e88b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48, skipping insertion in model container [2024-10-11 17:15:48,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:15:48,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:48,594 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:15:48,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:48,633 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:15:48,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48 WrapperNode [2024-10-11 17:15:48,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:48,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:48,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:15:48,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:15:48,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,668 INFO L138 Inliner]: procedures = 20, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2024-10-11 17:15:48,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:48,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:15:48,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:15:48,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:15:48,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:15:48,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:15:48,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:15:48,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:15:48,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (1/1) ... [2024-10-11 17:15:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:48,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:15:48,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:15:48,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:15:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:15:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:15:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:15:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:15:48,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:15:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:15:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:15:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:15:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:15:48,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:15:48,812 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:15:48,927 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:15:48,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:15:49,247 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:15:49,247 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:15:49,338 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:15:49,338 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:15:49,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:49 BoogieIcfgContainer [2024-10-11 17:15:49,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:15:49,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:15:49,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:15:49,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:15:49,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:15:48" (1/3) ... [2024-10-11 17:15:49,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9ebdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:49, skipping insertion in model container [2024-10-11 17:15:49,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:48" (2/3) ... [2024-10-11 17:15:49,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9ebdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:49, skipping insertion in model container [2024-10-11 17:15:49,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:49" (3/3) ... [2024-10-11 17:15:49,349 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-10-11 17:15:49,364 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:15:49,364 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-11 17:15:49,365 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:15:49,436 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:15:49,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 220 transitions, 454 flow [2024-10-11 17:15:49,561 INFO L124 PetriNetUnfolderBase]: 10/218 cut-off events. [2024-10-11 17:15:49,561 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:15:49,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 218 events. 10/218 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 340 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2024-10-11 17:15:49,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 220 transitions, 454 flow [2024-10-11 17:15:49,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 201 transitions, 414 flow [2024-10-11 17:15:49,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:15:49,597 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;@447e6c62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:15:49,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-11 17:15:49,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:15:49,602 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-10-11 17:15:49,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:15:49,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:49,603 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] [2024-10-11 17:15:49,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:49,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash 487679865, now seen corresponding path program 1 times [2024-10-11 17:15:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:49,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861047144] [2024-10-11 17:15:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:49,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:49,833 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-11 17:15:49,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:49,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861047144] [2024-10-11 17:15:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861047144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:49,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:49,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877168640] [2024-10-11 17:15:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:49,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:49,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:49,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:49,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:49,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 220 [2024-10-11 17:15:49,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 201 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:49,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:49,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 220 [2024-10-11 17:15:49,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,005 INFO L124 PetriNetUnfolderBase]: 14/237 cut-off events. [2024-10-11 17:15:50,005 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:15:50,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 237 events. 14/237 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 470 event pairs, 3 based on Foata normal form. 7/202 useless extension candidates. Maximal degree in co-relation 157. Up to 26 conditions per place. [2024-10-11 17:15:50,011 INFO L140 encePairwiseOnDemand]: 206/220 looper letters, 15 selfloop transitions, 2 changer transitions 1/189 dead transitions. [2024-10-11 17:15:50,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 189 transitions, 424 flow [2024-10-11 17:15:50,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2024-10-11 17:15:50,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8984848484848484 [2024-10-11 17:15:50,030 INFO L175 Difference]: Start difference. First operand has 199 places, 201 transitions, 414 flow. Second operand 3 states and 593 transitions. [2024-10-11 17:15:50,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 189 transitions, 424 flow [2024-10-11 17:15:50,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 189 transitions, 416 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:15:50,040 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 384 flow [2024-10-11 17:15:50,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2024-10-11 17:15:50,047 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -11 predicate places. [2024-10-11 17:15:50,047 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 384 flow [2024-10-11 17:15:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,049 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:15:50,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1887846002, now seen corresponding path program 1 times [2024-10-11 17:15:50,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140402806] [2024-10-11 17:15:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,121 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-11 17:15:50,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140402806] [2024-10-11 17:15:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140402806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120871024] [2024-10-11 17:15:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 220 [2024-10-11 17:15:50,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 220 [2024-10-11 17:15:50,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,269 INFO L124 PetriNetUnfolderBase]: 24/278 cut-off events. [2024-10-11 17:15:50,269 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:15:50,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 278 events. 24/278 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 753 event pairs, 9 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 304. Up to 43 conditions per place. [2024-10-11 17:15:50,275 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 15 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2024-10-11 17:15:50,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 187 transitions, 416 flow [2024-10-11 17:15:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2024-10-11 17:15:50,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8818181818181818 [2024-10-11 17:15:50,283 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 384 flow. Second operand 3 states and 582 transitions. [2024-10-11 17:15:50,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 187 transitions, 416 flow [2024-10-11 17:15:50,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 187 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,291 INFO L231 Difference]: Finished difference. Result has 186 places, 187 transitions, 382 flow [2024-10-11 17:15:50,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=186, PETRI_TRANSITIONS=187} [2024-10-11 17:15:50,292 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -13 predicate places. [2024-10-11 17:15:50,292 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 187 transitions, 382 flow [2024-10-11 17:15:50,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:50,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:15:50,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:50,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1182175354, now seen corresponding path program 1 times [2024-10-11 17:15:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741235702] [2024-10-11 17:15:50,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,357 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-11 17:15:50,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741235702] [2024-10-11 17:15:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741235702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565375936] [2024-10-11 17:15:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 220 [2024-10-11 17:15:50,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 187 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 220 [2024-10-11 17:15:50,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,470 INFO L124 PetriNetUnfolderBase]: 24/279 cut-off events. [2024-10-11 17:15:50,471 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:15:50,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 279 events. 24/279 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 780 event pairs, 9 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 294. Up to 42 conditions per place. [2024-10-11 17:15:50,475 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 15 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2024-10-11 17:15:50,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 186 transitions, 414 flow [2024-10-11 17:15:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2024-10-11 17:15:50,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8818181818181818 [2024-10-11 17:15:50,479 INFO L175 Difference]: Start difference. First operand has 186 places, 187 transitions, 382 flow. Second operand 3 states and 582 transitions. [2024-10-11 17:15:50,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 186 transitions, 414 flow [2024-10-11 17:15:50,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 186 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,485 INFO L231 Difference]: Finished difference. Result has 185 places, 186 transitions, 380 flow [2024-10-11 17:15:50,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=185, PETRI_TRANSITIONS=186} [2024-10-11 17:15:50,488 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -14 predicate places. [2024-10-11 17:15:50,488 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 186 transitions, 380 flow [2024-10-11 17:15:50,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:50,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:15:50,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:50,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1676896061, now seen corresponding path program 1 times [2024-10-11 17:15:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938192318] [2024-10-11 17:15:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,540 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-11 17:15:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938192318] [2024-10-11 17:15:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938192318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460744047] [2024-10-11 17:15:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 220 [2024-10-11 17:15:50,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 186 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 220 [2024-10-11 17:15:50,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,614 INFO L124 PetriNetUnfolderBase]: 23/312 cut-off events. [2024-10-11 17:15:50,615 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:15:50,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 312 events. 23/312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 894 event pairs, 8 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 318. Up to 39 conditions per place. [2024-10-11 17:15:50,617 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 13 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2024-10-11 17:15:50,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 408 flow [2024-10-11 17:15:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2024-10-11 17:15:50,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8878787878787879 [2024-10-11 17:15:50,619 INFO L175 Difference]: Start difference. First operand has 185 places, 186 transitions, 380 flow. Second operand 3 states and 586 transitions. [2024-10-11 17:15:50,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 408 flow [2024-10-11 17:15:50,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 185 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,623 INFO L231 Difference]: Finished difference. Result has 184 places, 185 transitions, 378 flow [2024-10-11 17:15:50,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=184, PETRI_TRANSITIONS=185} [2024-10-11 17:15:50,625 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -15 predicate places. [2024-10-11 17:15:50,625 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 185 transitions, 378 flow [2024-10-11 17:15:50,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,626 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:50,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:15:50,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:50,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1542119025, now seen corresponding path program 1 times [2024-10-11 17:15:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713462058] [2024-10-11 17:15:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,692 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-11 17:15:50,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713462058] [2024-10-11 17:15:50,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713462058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037033536] [2024-10-11 17:15:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 220 [2024-10-11 17:15:50,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 185 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 220 [2024-10-11 17:15:50,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,765 INFO L124 PetriNetUnfolderBase]: 28/345 cut-off events. [2024-10-11 17:15:50,765 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:15:50,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 345 events. 28/345 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1077 event pairs, 9 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 351. Up to 44 conditions per place. [2024-10-11 17:15:50,768 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 14 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2024-10-11 17:15:50,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 408 flow [2024-10-11 17:15:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2024-10-11 17:15:50,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8848484848484849 [2024-10-11 17:15:50,770 INFO L175 Difference]: Start difference. First operand has 184 places, 185 transitions, 378 flow. Second operand 3 states and 584 transitions. [2024-10-11 17:15:50,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 408 flow [2024-10-11 17:15:50,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,774 INFO L231 Difference]: Finished difference. Result has 183 places, 184 transitions, 376 flow [2024-10-11 17:15:50,774 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=183, PETRI_TRANSITIONS=184} [2024-10-11 17:15:50,775 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -16 predicate places. [2024-10-11 17:15:50,775 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 184 transitions, 376 flow [2024-10-11 17:15:50,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,777 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:50,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:15:50,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:50,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash 731743632, now seen corresponding path program 1 times [2024-10-11 17:15:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158665312] [2024-10-11 17:15:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:50,841 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-11 17:15:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158665312] [2024-10-11 17:15:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158665312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:50,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:50,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060806135] [2024-10-11 17:15:50,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:50,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:50,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 220 [2024-10-11 17:15:50,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 184 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:50,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 220 [2024-10-11 17:15:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:50,914 INFO L124 PetriNetUnfolderBase]: 25/273 cut-off events. [2024-10-11 17:15:50,914 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:15:50,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 273 events. 25/273 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 670 event pairs, 9 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 266. Up to 42 conditions per place. [2024-10-11 17:15:50,917 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 14 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2024-10-11 17:15:50,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 183 transitions, 406 flow [2024-10-11 17:15:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2024-10-11 17:15:50,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8848484848484849 [2024-10-11 17:15:50,919 INFO L175 Difference]: Start difference. First operand has 183 places, 184 transitions, 376 flow. Second operand 3 states and 584 transitions. [2024-10-11 17:15:50,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 183 transitions, 406 flow [2024-10-11 17:15:50,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 183 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:50,932 INFO L231 Difference]: Finished difference. Result has 182 places, 183 transitions, 374 flow [2024-10-11 17:15:50,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=182, PETRI_TRANSITIONS=183} [2024-10-11 17:15:50,934 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -17 predicate places. [2024-10-11 17:15:50,935 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 183 transitions, 374 flow [2024-10-11 17:15:50,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:50,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:50,941 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] [2024-10-11 17:15:50,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:15:50,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:50,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1879290269, now seen corresponding path program 1 times [2024-10-11 17:15:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:50,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206765364] [2024-10-11 17:15:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,039 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-11 17:15:51,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206765364] [2024-10-11 17:15:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206765364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106990159] [2024-10-11 17:15:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 220 [2024-10-11 17:15:51,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 183 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 220 [2024-10-11 17:15:51,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,133 INFO L124 PetriNetUnfolderBase]: 28/343 cut-off events. [2024-10-11 17:15:51,133 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:15:51,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 343 events. 28/343 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 957 event pairs, 0 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 330. Up to 34 conditions per place. [2024-10-11 17:15:51,135 INFO L140 encePairwiseOnDemand]: 210/220 looper letters, 15 selfloop transitions, 5 changer transitions 4/187 dead transitions. [2024-10-11 17:15:51,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 187 transitions, 433 flow [2024-10-11 17:15:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2024-10-11 17:15:51,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8878787878787879 [2024-10-11 17:15:51,137 INFO L175 Difference]: Start difference. First operand has 182 places, 183 transitions, 374 flow. Second operand 3 states and 586 transitions. [2024-10-11 17:15:51,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 187 transitions, 433 flow [2024-10-11 17:15:51,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 187 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:51,141 INFO L231 Difference]: Finished difference. Result has 179 places, 181 transitions, 388 flow [2024-10-11 17:15:51,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=179, PETRI_TRANSITIONS=181} [2024-10-11 17:15:51,143 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -20 predicate places. [2024-10-11 17:15:51,143 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 181 transitions, 388 flow [2024-10-11 17:15:51,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,144 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:51,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:15:51,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:51,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2111697330, now seen corresponding path program 1 times [2024-10-11 17:15:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448765788] [2024-10-11 17:15:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,200 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-11 17:15:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448765788] [2024-10-11 17:15:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448765788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598296187] [2024-10-11 17:15:51,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 220 [2024-10-11 17:15:51,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 181 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 220 [2024-10-11 17:15:51,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,300 INFO L124 PetriNetUnfolderBase]: 55/399 cut-off events. [2024-10-11 17:15:51,300 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-11 17:15:51,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 399 events. 55/399 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1255 event pairs, 12 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 329. Up to 75 conditions per place. [2024-10-11 17:15:51,303 INFO L140 encePairwiseOnDemand]: 214/220 looper letters, 20 selfloop transitions, 3 changer transitions 0/182 dead transitions. [2024-10-11 17:15:51,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 182 transitions, 441 flow [2024-10-11 17:15:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2024-10-11 17:15:51,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8878787878787879 [2024-10-11 17:15:51,305 INFO L175 Difference]: Start difference. First operand has 179 places, 181 transitions, 388 flow. Second operand 3 states and 586 transitions. [2024-10-11 17:15:51,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 182 transitions, 441 flow [2024-10-11 17:15:51,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 182 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,309 INFO L231 Difference]: Finished difference. Result has 176 places, 179 transitions, 390 flow [2024-10-11 17:15:51,309 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=176, PETRI_TRANSITIONS=179} [2024-10-11 17:15:51,310 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -23 predicate places. [2024-10-11 17:15:51,312 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 179 transitions, 390 flow [2024-10-11 17:15:51,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,312 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] [2024-10-11 17:15:51,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:15:51,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:51,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -108350526, now seen corresponding path program 1 times [2024-10-11 17:15:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059705539] [2024-10-11 17:15:51,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,369 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-11 17:15:51,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059705539] [2024-10-11 17:15:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059705539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353939715] [2024-10-11 17:15:51,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 220 [2024-10-11 17:15:51,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 179 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 220 [2024-10-11 17:15:51,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,461 INFO L124 PetriNetUnfolderBase]: 71/467 cut-off events. [2024-10-11 17:15:51,461 INFO L125 PetriNetUnfolderBase]: For 73/87 co-relation queries the response was YES. [2024-10-11 17:15:51,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 467 events. 71/467 cut-off events. For 73/87 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1810 event pairs, 4 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 413. Up to 82 conditions per place. [2024-10-11 17:15:51,464 INFO L140 encePairwiseOnDemand]: 214/220 looper letters, 24 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2024-10-11 17:15:51,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 184 transitions, 465 flow [2024-10-11 17:15:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2024-10-11 17:15:51,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909090909090909 [2024-10-11 17:15:51,466 INFO L175 Difference]: Start difference. First operand has 176 places, 179 transitions, 390 flow. Second operand 3 states and 588 transitions. [2024-10-11 17:15:51,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 184 transitions, 465 flow [2024-10-11 17:15:51,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 184 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,470 INFO L231 Difference]: Finished difference. Result has 175 places, 177 transitions, 394 flow [2024-10-11 17:15:51,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=175, PETRI_TRANSITIONS=177} [2024-10-11 17:15:51,472 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -24 predicate places. [2024-10-11 17:15:51,472 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 177 transitions, 394 flow [2024-10-11 17:15:51,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,473 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] [2024-10-11 17:15:51,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:15:51,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:51,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1142776812, now seen corresponding path program 1 times [2024-10-11 17:15:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898161356] [2024-10-11 17:15:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,528 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-11 17:15:51,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898161356] [2024-10-11 17:15:51,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898161356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040157312] [2024-10-11 17:15:51,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 220 [2024-10-11 17:15:51,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 177 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 220 [2024-10-11 17:15:51,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,617 INFO L124 PetriNetUnfolderBase]: 70/630 cut-off events. [2024-10-11 17:15:51,617 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-11 17:15:51,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 630 events. 70/630 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3106 event pairs, 14 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 402. Up to 114 conditions per place. [2024-10-11 17:15:51,621 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 17 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2024-10-11 17:15:51,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 178 transitions, 435 flow [2024-10-11 17:15:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2024-10-11 17:15:51,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8984848484848484 [2024-10-11 17:15:51,623 INFO L175 Difference]: Start difference. First operand has 175 places, 177 transitions, 394 flow. Second operand 3 states and 593 transitions. [2024-10-11 17:15:51,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 178 transitions, 435 flow [2024-10-11 17:15:51,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 178 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:51,627 INFO L231 Difference]: Finished difference. Result has 175 places, 177 transitions, 401 flow [2024-10-11 17:15:51,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=175, PETRI_TRANSITIONS=177} [2024-10-11 17:15:51,630 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -24 predicate places. [2024-10-11 17:15:51,630 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 177 transitions, 401 flow [2024-10-11 17:15:51,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,631 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] [2024-10-11 17:15:51,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:15:51,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1742335004, now seen corresponding path program 1 times [2024-10-11 17:15:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745263157] [2024-10-11 17:15:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,696 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-11 17:15:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745263157] [2024-10-11 17:15:51,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745263157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474492425] [2024-10-11 17:15:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2024-10-11 17:15:51,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 177 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2024-10-11 17:15:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,776 INFO L124 PetriNetUnfolderBase]: 73/484 cut-off events. [2024-10-11 17:15:51,776 INFO L125 PetriNetUnfolderBase]: For 59/75 co-relation queries the response was YES. [2024-10-11 17:15:51,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 484 events. 73/484 cut-off events. For 59/75 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1933 event pairs, 6 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 378. Up to 80 conditions per place. [2024-10-11 17:15:51,779 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 20 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2024-10-11 17:15:51,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 180 transitions, 460 flow [2024-10-11 17:15:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2024-10-11 17:15:51,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8954545454545455 [2024-10-11 17:15:51,781 INFO L175 Difference]: Start difference. First operand has 175 places, 177 transitions, 401 flow. Second operand 3 states and 591 transitions. [2024-10-11 17:15:51,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 180 transitions, 460 flow [2024-10-11 17:15:51,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 180 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:51,785 INFO L231 Difference]: Finished difference. Result has 175 places, 175 transitions, 401 flow [2024-10-11 17:15:51,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=175, PETRI_TRANSITIONS=175} [2024-10-11 17:15:51,786 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -24 predicate places. [2024-10-11 17:15:51,786 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 175 transitions, 401 flow [2024-10-11 17:15:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,787 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] [2024-10-11 17:15:51,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:15:51,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:51,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 24780182, now seen corresponding path program 1 times [2024-10-11 17:15:51,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248574125] [2024-10-11 17:15:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,849 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-11 17:15:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248574125] [2024-10-11 17:15:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248574125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960027097] [2024-10-11 17:15:51,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:51,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2024-10-11 17:15:51,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 175 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:51,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2024-10-11 17:15:51,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:51,927 INFO L124 PetriNetUnfolderBase]: 57/409 cut-off events. [2024-10-11 17:15:51,927 INFO L125 PetriNetUnfolderBase]: For 56/58 co-relation queries the response was YES. [2024-10-11 17:15:51,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 409 events. 57/409 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1448 event pairs, 4 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 317. Up to 57 conditions per place. [2024-10-11 17:15:51,930 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 20 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2024-10-11 17:15:51,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 178 transitions, 460 flow [2024-10-11 17:15:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2024-10-11 17:15:51,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8954545454545455 [2024-10-11 17:15:51,931 INFO L175 Difference]: Start difference. First operand has 175 places, 175 transitions, 401 flow. Second operand 3 states and 591 transitions. [2024-10-11 17:15:51,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 178 transitions, 460 flow [2024-10-11 17:15:51,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 178 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:51,935 INFO L231 Difference]: Finished difference. Result has 173 places, 173 transitions, 397 flow [2024-10-11 17:15:51,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=173, PETRI_TRANSITIONS=173} [2024-10-11 17:15:51,935 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -26 predicate places. [2024-10-11 17:15:51,936 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 173 transitions, 397 flow [2024-10-11 17:15:51,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:51,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:51,936 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] [2024-10-11 17:15:51,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:15:51,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1826126969, now seen corresponding path program 1 times [2024-10-11 17:15:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945812063] [2024-10-11 17:15:51,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:51,978 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-11 17:15:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945812063] [2024-10-11 17:15:51,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945812063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:51,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233763261] [2024-10-11 17:15:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:51,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:52,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2024-10-11 17:15:52,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 173 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:52,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2024-10-11 17:15:52,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:52,075 INFO L124 PetriNetUnfolderBase]: 68/533 cut-off events. [2024-10-11 17:15:52,075 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-10-11 17:15:52,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 533 events. 68/533 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2413 event pairs, 18 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 499. Up to 91 conditions per place. [2024-10-11 17:15:52,079 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 19 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2024-10-11 17:15:52,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 175 transitions, 448 flow [2024-10-11 17:15:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2024-10-11 17:15:52,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8954545454545455 [2024-10-11 17:15:52,081 INFO L175 Difference]: Start difference. First operand has 173 places, 173 transitions, 397 flow. Second operand 3 states and 591 transitions. [2024-10-11 17:15:52,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 175 transitions, 448 flow [2024-10-11 17:15:52,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 175 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:52,085 INFO L231 Difference]: Finished difference. Result has 172 places, 172 transitions, 395 flow [2024-10-11 17:15:52,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=172, PETRI_TRANSITIONS=172} [2024-10-11 17:15:52,087 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -27 predicate places. [2024-10-11 17:15:52,087 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 172 transitions, 395 flow [2024-10-11 17:15:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:52,088 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] [2024-10-11 17:15:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:15:52,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -269180799, now seen corresponding path program 1 times [2024-10-11 17:15:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470773713] [2024-10-11 17:15:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:52,126 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-11 17:15:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470773713] [2024-10-11 17:15:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470773713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311668090] [2024-10-11 17:15:52,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:52,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:52,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:52,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:52,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2024-10-11 17:15:52,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 172 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:52,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2024-10-11 17:15:52,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:52,212 INFO L124 PetriNetUnfolderBase]: 58/422 cut-off events. [2024-10-11 17:15:52,213 INFO L125 PetriNetUnfolderBase]: For 56/58 co-relation queries the response was YES. [2024-10-11 17:15:52,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 422 events. 58/422 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1514 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 481. Up to 80 conditions per place. [2024-10-11 17:15:52,215 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 19 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2024-10-11 17:15:52,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 174 transitions, 446 flow [2024-10-11 17:15:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2024-10-11 17:15:52,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8954545454545455 [2024-10-11 17:15:52,217 INFO L175 Difference]: Start difference. First operand has 172 places, 172 transitions, 395 flow. Second operand 3 states and 591 transitions. [2024-10-11 17:15:52,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 174 transitions, 446 flow [2024-10-11 17:15:52,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 174 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:52,221 INFO L231 Difference]: Finished difference. Result has 171 places, 171 transitions, 393 flow [2024-10-11 17:15:52,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=171, PETRI_TRANSITIONS=171} [2024-10-11 17:15:52,222 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -28 predicate places. [2024-10-11 17:15:52,222 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 171 transitions, 393 flow [2024-10-11 17:15:52,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:52,223 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] [2024-10-11 17:15:52,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:15:52,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:52,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:52,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1307615764, now seen corresponding path program 1 times [2024-10-11 17:15:52,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:52,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035987196] [2024-10-11 17:15:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:52,259 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-11 17:15:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:52,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035987196] [2024-10-11 17:15:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035987196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:52,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124949745] [2024-10-11 17:15:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:52,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:52,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:52,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 220 [2024-10-11 17:15:52,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 171 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:52,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 220 [2024-10-11 17:15:52,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:52,350 INFO L124 PetriNetUnfolderBase]: 78/551 cut-off events. [2024-10-11 17:15:52,350 INFO L125 PetriNetUnfolderBase]: For 70/76 co-relation queries the response was YES. [2024-10-11 17:15:52,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 551 events. 78/551 cut-off events. For 70/76 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2174 event pairs, 18 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 627. Up to 101 conditions per place. [2024-10-11 17:15:52,353 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 21 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2024-10-11 17:15:52,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 173 transitions, 448 flow [2024-10-11 17:15:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions. [2024-10-11 17:15:52,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8924242424242425 [2024-10-11 17:15:52,356 INFO L175 Difference]: Start difference. First operand has 171 places, 171 transitions, 393 flow. Second operand 3 states and 589 transitions. [2024-10-11 17:15:52,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 173 transitions, 448 flow [2024-10-11 17:15:52,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 173 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:52,359 INFO L231 Difference]: Finished difference. Result has 170 places, 170 transitions, 391 flow [2024-10-11 17:15:52,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=170, PETRI_TRANSITIONS=170} [2024-10-11 17:15:52,360 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -29 predicate places. [2024-10-11 17:15:52,360 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 170 transitions, 391 flow [2024-10-11 17:15:52,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:52,361 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] [2024-10-11 17:15:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:15:52,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:15:52,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash -635050394, now seen corresponding path program 1 times [2024-10-11 17:15:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50340795] [2024-10-11 17:15:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:52,412 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-11 17:15:52,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:52,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50340795] [2024-10-11 17:15:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50340795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:52,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033430155] [2024-10-11 17:15:52,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:52,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:52,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:52,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:52,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 220 [2024-10-11 17:15:52,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 170 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:52,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 220 [2024-10-11 17:15:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:52,486 INFO L124 PetriNetUnfolderBase]: 63/432 cut-off events. [2024-10-11 17:15:52,487 INFO L125 PetriNetUnfolderBase]: For 70/72 co-relation queries the response was YES. [2024-10-11 17:15:52,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 432 events. 63/432 cut-off events. For 70/72 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1561 event pairs, 10 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 511. Up to 87 conditions per place. [2024-10-11 17:15:52,489 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 0 selfloop transitions, 0 changer transitions 172/172 dead transitions. [2024-10-11 17:15:52,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 172 transitions, 446 flow [2024-10-11 17:15:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions. [2024-10-11 17:15:52,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8924242424242425 [2024-10-11 17:15:52,491 INFO L175 Difference]: Start difference. First operand has 170 places, 170 transitions, 391 flow. Second operand 3 states and 589 transitions. [2024-10-11 17:15:52,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 172 transitions, 446 flow [2024-10-11 17:15:52,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 172 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:52,493 INFO L231 Difference]: Finished difference. Result has 169 places, 0 transitions, 0 flow [2024-10-11 17:15:52,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=169, PETRI_TRANSITIONS=0} [2024-10-11 17:15:52,494 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -30 predicate places. [2024-10-11 17:15:52,494 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 0 transitions, 0 flow [2024-10-11 17:15:52,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:52,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 58 remaining) [2024-10-11 17:15:52,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2024-10-11 17:15:52,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2024-10-11 17:15:52,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2024-10-11 17:15:52,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2024-10-11 17:15:52,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2024-10-11 17:15:52,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2024-10-11 17:15:52,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2024-10-11 17:15:52,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2024-10-11 17:15:52,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2024-10-11 17:15:52,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2024-10-11 17:15:52,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 58 remaining) [2024-10-11 17:15:52,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 58 remaining) [2024-10-11 17:15:52,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2024-10-11 17:15:52,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2024-10-11 17:15:52,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2024-10-11 17:15:52,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2024-10-11 17:15:52,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2024-10-11 17:15:52,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2024-10-11 17:15:52,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2024-10-11 17:15:52,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2024-10-11 17:15:52,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2024-10-11 17:15:52,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2024-10-11 17:15:52,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2024-10-11 17:15:52,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2024-10-11 17:15:52,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2024-10-11 17:15:52,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2024-10-11 17:15:52,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2024-10-11 17:15:52,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2024-10-11 17:15:52,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2024-10-11 17:15:52,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:15:52,509 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:52,516 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:15:52,516 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:15:52,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:15:52 BasicIcfg [2024-10-11 17:15:52,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:15:52,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:15:52,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:15:52,522 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:15:52,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:49" (3/4) ... [2024-10-11 17:15:52,524 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:15:52,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:15:52,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:15:52,533 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 17:15:52,533 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:15:52,533 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:15:52,534 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:15:52,614 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:15:52,615 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:15:52,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:15:52,616 INFO L158 Benchmark]: Toolchain (without parser) took 4349.87ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 104.0MB in the beginning and 90.5MB in the end (delta: 13.5MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,616 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:15:52,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.30ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 125.4MB in the end (delta: -21.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.14ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 123.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,617 INFO L158 Benchmark]: Boogie Preprocessor took 46.88ms. Allocated memory is still 161.5MB. Free memory was 123.4MB in the beginning and 122.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:15:52,617 INFO L158 Benchmark]: RCFGBuilder took 621.59ms. Allocated memory is still 161.5MB. Free memory was 122.0MB in the beginning and 96.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,617 INFO L158 Benchmark]: TraceAbstraction took 3180.47ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 96.1MB in the beginning and 95.7MB in the end (delta: 360.3kB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,617 INFO L158 Benchmark]: Witness Printer took 93.21ms. Allocated memory is still 220.2MB. Free memory was 95.7MB in the beginning and 90.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:15:52,619 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.12ms. Allocated memory is still 96.5MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.30ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 125.4MB in the end (delta: -21.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.14ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 123.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.88ms. Allocated memory is still 161.5MB. Free memory was 123.4MB in the beginning and 122.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 621.59ms. Allocated memory is still 161.5MB. Free memory was 122.0MB in the beginning and 96.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3180.47ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 96.1MB in the beginning and 95.7MB in the end (delta: 360.3kB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 93.21ms. Allocated memory is still 220.2MB. Free memory was 95.7MB in the beginning and 90.5MB 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: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: 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: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 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: 64]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: 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, 295 locations, 58 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 105 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1109 NumberOfCodeBlocks, 1109 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 1125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:15:52,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE