/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:19:22,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:19:22,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:19:22,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:19:22,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:19:22,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:19:22,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:19:22,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:19:22,589 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:19:22,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:19:22,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:19:22,592 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:19:22,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:19:22,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:19:22,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:19:22,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:19:22,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:19:22,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:19:22,594 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:19:22,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:19:22,594 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:19:22,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:19:22,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:19:22,595 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:19:22,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:19:22,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:19:22,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:19:22,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:19:22,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:19:22,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:19:22,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:19:22,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:19:22,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:19:22,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:19:22,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:19:22,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:19:22,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:19:22,801 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:19:22,801 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:19:22,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2023-11-30 03:19:23,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:19:24,018 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:19:24,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2023-11-30 03:19:24,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf5bb801/b0b114e17c344777b4624c7ecf0a6ba3/FLAGdf4607a8b [2023-11-30 03:19:24,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bf5bb801/b0b114e17c344777b4624c7ecf0a6ba3 [2023-11-30 03:19:24,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:19:24,034 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:19:24,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:19:24,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:19:24,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:19:24,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754b266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24, skipping insertion in model container [2023-11-30 03:19:24,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:19:24,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:19:24,253 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:19:24,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:19:24,305 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:19:24,305 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:19:24,310 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:19:24,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24 WrapperNode [2023-11-30 03:19:24,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:19:24,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:19:24,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:19:24,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:19:24,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,371 INFO L138 Inliner]: procedures = 27, calls = 77, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 618 [2023-11-30 03:19:24,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:19:24,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:19:24,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:19:24,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:19:24,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,393 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:19:24,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:19:24,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:19:24,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:19:24,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (1/1) ... [2023-11-30 03:19:24,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:19:24,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:19:24,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:19:24,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:19:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:19:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:19:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:19:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:19:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:19:24,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:19:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:19:24,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:19:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:19:24,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:19:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:19:24,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:19:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:19:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:19:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:19:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:19:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:19:24,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:19:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:19:24,470 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:19:24,567 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:19:24,568 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:19:25,212 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:19:25,508 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:19:25,509 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-30 03:19:25,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:19:25 BoogieIcfgContainer [2023-11-30 03:19:25,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:19:25,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:19:25,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:19:25,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:19:25,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:19:24" (1/3) ... [2023-11-30 03:19:25,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fca000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:19:25, skipping insertion in model container [2023-11-30 03:19:25,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:19:24" (2/3) ... [2023-11-30 03:19:25,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fca000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:19:25, skipping insertion in model container [2023-11-30 03:19:25,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:19:25" (3/3) ... [2023-11-30 03:19:25,515 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2023-11-30 03:19:25,526 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:19:25,527 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 93 error locations. [2023-11-30 03:19:25,527 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:19:25,605 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 03:19:25,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 421 places, 427 transitions, 882 flow [2023-11-30 03:19:25,703 INFO L124 PetriNetUnfolderBase]: 19/423 cut-off events. [2023-11-30 03:19:25,703 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:19:25,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 423 events. 19/423 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 584 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 334. Up to 2 conditions per place. [2023-11-30 03:19:25,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 421 places, 427 transitions, 882 flow [2023-11-30 03:19:25,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 393 places, 398 transitions, 820 flow [2023-11-30 03:19:25,720 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:19:25,724 INFO L362 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, mHoare=true, 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;@35fb169, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:19:25,724 INFO L363 AbstractCegarLoop]: Starting to check reachability of 167 error locations. [2023-11-30 03:19:25,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:19:25,727 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2023-11-30 03:19:25,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:19:25,727 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:25,727 INFO L232 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] [2023-11-30 03:19:25,728 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:25,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1525840011, now seen corresponding path program 1 times [2023-11-30 03:19:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488450503] [2023-11-30 03:19:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:25,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:25,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:25,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488450503] [2023-11-30 03:19:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488450503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:25,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356651192] [2023-11-30 03:19:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:25,934 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:25,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:25,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:25,961 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 427 [2023-11-30 03:19:25,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 398 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:25,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:25,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 427 [2023-11-30 03:19:25,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:26,331 INFO L124 PetriNetUnfolderBase]: 451/1228 cut-off events. [2023-11-30 03:19:26,331 INFO L125 PetriNetUnfolderBase]: For 160/267 co-relation queries the response was YES. [2023-11-30 03:19:26,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1970 conditions, 1228 events. 451/1228 cut-off events. For 160/267 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5478 event pairs, 272 based on Foata normal form. 183/1266 useless extension candidates. Maximal degree in co-relation 1562. Up to 615 conditions per place. [2023-11-30 03:19:26,340 INFO L140 encePairwiseOnDemand]: 343/427 looper letters, 26 selfloop transitions, 2 changer transitions 5/316 dead transitions. [2023-11-30 03:19:26,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 316 transitions, 712 flow [2023-11-30 03:19:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1052 transitions. [2023-11-30 03:19:26,354 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8212334113973458 [2023-11-30 03:19:26,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1052 transitions. [2023-11-30 03:19:26,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1052 transitions. [2023-11-30 03:19:26,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:26,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1052 transitions. [2023-11-30 03:19:26,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,372 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -69 predicate places. [2023-11-30 03:19:26,372 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 316 transitions, 712 flow [2023-11-30 03:19:26,373 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,374 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:26,374 INFO L232 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] [2023-11-30 03:19:26,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:19:26,374 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:26,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 663790813, now seen corresponding path program 1 times [2023-11-30 03:19:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340401181] [2023-11-30 03:19:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:26,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340401181] [2023-11-30 03:19:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340401181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:26,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740563352] [2023-11-30 03:19:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:26,462 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:26,463 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 427 [2023-11-30 03:19:26,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 316 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:26,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 427 [2023-11-30 03:19:26,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:26,658 INFO L124 PetriNetUnfolderBase]: 451/1227 cut-off events. [2023-11-30 03:19:26,658 INFO L125 PetriNetUnfolderBase]: For 425/3300 co-relation queries the response was YES. [2023-11-30 03:19:26,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 1227 events. 451/1227 cut-off events. For 425/3300 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5484 event pairs, 272 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 2129. Up to 615 conditions per place. [2023-11-30 03:19:26,667 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 26 selfloop transitions, 2 changer transitions 5/315 dead transitions. [2023-11-30 03:19:26,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 315 transitions, 766 flow [2023-11-30 03:19:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2023-11-30 03:19:26,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7580015612802498 [2023-11-30 03:19:26,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2023-11-30 03:19:26,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2023-11-30 03:19:26,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:26,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2023-11-30 03:19:26,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,675 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -68 predicate places. [2023-11-30 03:19:26,675 INFO L500 AbstractCegarLoop]: Abstraction has has 325 places, 315 transitions, 766 flow [2023-11-30 03:19:26,675 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,675 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:26,676 INFO L232 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] [2023-11-30 03:19:26,676 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:19:26,676 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:26,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:26,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1509645190, now seen corresponding path program 1 times [2023-11-30 03:19:26,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:26,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526719586] [2023-11-30 03:19:26,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526719586] [2023-11-30 03:19:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526719586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:26,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662579065] [2023-11-30 03:19:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:26,727 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:26,728 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 427 [2023-11-30 03:19:26,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 315 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:26,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 427 [2023-11-30 03:19:26,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:26,963 INFO L124 PetriNetUnfolderBase]: 451/1226 cut-off events. [2023-11-30 03:19:26,963 INFO L125 PetriNetUnfolderBase]: For 875/6518 co-relation queries the response was YES. [2023-11-30 03:19:26,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1226 events. 451/1226 cut-off events. For 875/6518 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5523 event pairs, 272 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 2696. Up to 615 conditions per place. [2023-11-30 03:19:26,972 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 26 selfloop transitions, 2 changer transitions 5/314 dead transitions. [2023-11-30 03:19:26,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 314 transitions, 820 flow [2023-11-30 03:19:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2023-11-30 03:19:26,974 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7580015612802498 [2023-11-30 03:19:26,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2023-11-30 03:19:26,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2023-11-30 03:19:26,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:26,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2023-11-30 03:19:26,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,980 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -67 predicate places. [2023-11-30 03:19:26,980 INFO L500 AbstractCegarLoop]: Abstraction has has 326 places, 314 transitions, 820 flow [2023-11-30 03:19:26,981 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:26,981 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:26,981 INFO L232 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] [2023-11-30 03:19:26,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:19:26,981 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:26,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 353139958, now seen corresponding path program 1 times [2023-11-30 03:19:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:26,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195092500] [2023-11-30 03:19:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:26,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195092500] [2023-11-30 03:19:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195092500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60490478] [2023-11-30 03:19:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:27,028 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:27,031 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 427 [2023-11-30 03:19:27,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 314 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:27,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 427 [2023-11-30 03:19:27,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:27,238 INFO L124 PetriNetUnfolderBase]: 451/1225 cut-off events. [2023-11-30 03:19:27,238 INFO L125 PetriNetUnfolderBase]: For 1510/9921 co-relation queries the response was YES. [2023-11-30 03:19:27,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1225 events. 451/1225 cut-off events. For 1510/9921 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5483 event pairs, 272 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 3263. Up to 615 conditions per place. [2023-11-30 03:19:27,249 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 26 selfloop transitions, 2 changer transitions 5/313 dead transitions. [2023-11-30 03:19:27,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 313 transitions, 874 flow [2023-11-30 03:19:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2023-11-30 03:19:27,251 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7580015612802498 [2023-11-30 03:19:27,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2023-11-30 03:19:27,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2023-11-30 03:19:27,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:27,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2023-11-30 03:19:27,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,256 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -66 predicate places. [2023-11-30 03:19:27,256 INFO L500 AbstractCegarLoop]: Abstraction has has 327 places, 313 transitions, 874 flow [2023-11-30 03:19:27,257 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,257 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:27,257 INFO L232 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] [2023-11-30 03:19:27,257 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:19:27,257 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:27,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -62178354, now seen corresponding path program 1 times [2023-11-30 03:19:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502910755] [2023-11-30 03:19:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:27,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:27,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502910755] [2023-11-30 03:19:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502910755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:27,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:27,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409770027] [2023-11-30 03:19:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:27,318 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:27,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:27,320 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 427 [2023-11-30 03:19:27,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 313 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:27,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 427 [2023-11-30 03:19:27,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:27,568 INFO L124 PetriNetUnfolderBase]: 451/1224 cut-off events. [2023-11-30 03:19:27,569 INFO L125 PetriNetUnfolderBase]: For 2330/13509 co-relation queries the response was YES. [2023-11-30 03:19:27,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 1224 events. 451/1224 cut-off events. For 2330/13509 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5454 event pairs, 272 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 3830. Up to 615 conditions per place. [2023-11-30 03:19:27,581 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 26 selfloop transitions, 2 changer transitions 5/312 dead transitions. [2023-11-30 03:19:27,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 312 transitions, 928 flow [2023-11-30 03:19:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2023-11-30 03:19:27,583 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7580015612802498 [2023-11-30 03:19:27,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2023-11-30 03:19:27,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2023-11-30 03:19:27,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:27,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2023-11-30 03:19:27,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,588 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -65 predicate places. [2023-11-30 03:19:27,589 INFO L500 AbstractCegarLoop]: Abstraction has has 328 places, 312 transitions, 928 flow [2023-11-30 03:19:27,589 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,589 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:27,590 INFO L232 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] [2023-11-30 03:19:27,590 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:19:27,590 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:27,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash 752651453, now seen corresponding path program 1 times [2023-11-30 03:19:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072857261] [2023-11-30 03:19:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072857261] [2023-11-30 03:19:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072857261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:27,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:27,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:27,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395880024] [2023-11-30 03:19:27,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:27,628 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:27,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:27,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:27,629 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 427 [2023-11-30 03:19:27,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 312 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:27,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 427 [2023-11-30 03:19:27,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:27,954 INFO L124 PetriNetUnfolderBase]: 595/1792 cut-off events. [2023-11-30 03:19:27,954 INFO L125 PetriNetUnfolderBase]: For 4704/14280 co-relation queries the response was YES. [2023-11-30 03:19:27,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6824 conditions, 1792 events. 595/1792 cut-off events. For 4704/14280 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10240 event pairs, 228 based on Foata normal form. 0/1571 useless extension candidates. Maximal degree in co-relation 6108. Up to 811 conditions per place. [2023-11-30 03:19:27,973 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 37 selfloop transitions, 2 changer transitions 5/326 dead transitions. [2023-11-30 03:19:27,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 326 transitions, 1197 flow [2023-11-30 03:19:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2023-11-30 03:19:27,977 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7759562841530054 [2023-11-30 03:19:27,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2023-11-30 03:19:27,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2023-11-30 03:19:27,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:27,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2023-11-30 03:19:27,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,987 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -64 predicate places. [2023-11-30 03:19:27,987 INFO L500 AbstractCegarLoop]: Abstraction has has 329 places, 326 transitions, 1197 flow [2023-11-30 03:19:27,988 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:27,988 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:27,988 INFO L232 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] [2023-11-30 03:19:27,988 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:19:27,989 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:27,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash 560849832, now seen corresponding path program 1 times [2023-11-30 03:19:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:27,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781366663] [2023-11-30 03:19:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:27,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781366663] [2023-11-30 03:19:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781366663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:28,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157414267] [2023-11-30 03:19:28,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:28,057 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:28,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:28,059 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 427 [2023-11-30 03:19:28,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 326 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:28,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 427 [2023-11-30 03:19:28,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:28,307 INFO L124 PetriNetUnfolderBase]: 595/1621 cut-off events. [2023-11-30 03:19:28,308 INFO L125 PetriNetUnfolderBase]: For 5980/26020 co-relation queries the response was YES. [2023-11-30 03:19:28,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7463 conditions, 1621 events. 595/1621 cut-off events. For 5980/26020 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8419 event pairs, 171 based on Foata normal form. 3/1438 useless extension candidates. Maximal degree in co-relation 6682. Up to 811 conditions per place. [2023-11-30 03:19:28,325 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 38 selfloop transitions, 2 changer transitions 5/325 dead transitions. [2023-11-30 03:19:28,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 325 transitions, 1275 flow [2023-11-30 03:19:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2023-11-30 03:19:28,327 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7626854020296643 [2023-11-30 03:19:28,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2023-11-30 03:19:28,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2023-11-30 03:19:28,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:28,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2023-11-30 03:19:28,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,332 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -63 predicate places. [2023-11-30 03:19:28,332 INFO L500 AbstractCegarLoop]: Abstraction has has 330 places, 325 transitions, 1275 flow [2023-11-30 03:19:28,332 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,332 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:28,332 INFO L232 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] [2023-11-30 03:19:28,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:19:28,333 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:28,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1199652229, now seen corresponding path program 1 times [2023-11-30 03:19:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341923866] [2023-11-30 03:19:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:28,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:28,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341923866] [2023-11-30 03:19:28,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341923866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:28,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:28,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:28,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463538296] [2023-11-30 03:19:28,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:28,357 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:28,358 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 427 [2023-11-30 03:19:28,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 325 transitions, 1275 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:28,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 427 [2023-11-30 03:19:28,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:28,603 INFO L124 PetriNetUnfolderBase]: 595/1736 cut-off events. [2023-11-30 03:19:28,603 INFO L125 PetriNetUnfolderBase]: For 7450/32358 co-relation queries the response was YES. [2023-11-30 03:19:28,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8391 conditions, 1736 events. 595/1736 cut-off events. For 7450/32358 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9326 event pairs, 183 based on Foata normal form. 0/1540 useless extension candidates. Maximal degree in co-relation 7554. Up to 811 conditions per place. [2023-11-30 03:19:28,621 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 41 selfloop transitions, 2 changer transitions 5/324 dead transitions. [2023-11-30 03:19:28,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 324 transitions, 1359 flow [2023-11-30 03:19:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2023-11-30 03:19:28,624 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7580015612802498 [2023-11-30 03:19:28,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2023-11-30 03:19:28,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2023-11-30 03:19:28,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:28,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2023-11-30 03:19:28,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,628 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -62 predicate places. [2023-11-30 03:19:28,628 INFO L500 AbstractCegarLoop]: Abstraction has has 331 places, 324 transitions, 1359 flow [2023-11-30 03:19:28,628 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,629 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:28,629 INFO L232 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] [2023-11-30 03:19:28,629 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:19:28,629 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:28,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash 22964261, now seen corresponding path program 1 times [2023-11-30 03:19:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585131254] [2023-11-30 03:19:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585131254] [2023-11-30 03:19:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585131254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719917494] [2023-11-30 03:19:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:28,652 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:28,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:28,653 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 427 [2023-11-30 03:19:28,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 324 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:28,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:28,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 427 [2023-11-30 03:19:28,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:28,994 INFO L124 PetriNetUnfolderBase]: 749/1963 cut-off events. [2023-11-30 03:19:28,994 INFO L125 PetriNetUnfolderBase]: For 11307/48906 co-relation queries the response was YES. [2023-11-30 03:19:29,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11336 conditions, 1963 events. 749/1963 cut-off events. For 11307/48906 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10922 event pairs, 129 based on Foata normal form. 1/1746 useless extension candidates. Maximal degree in co-relation 10386. Up to 1021 conditions per place. [2023-11-30 03:19:29,017 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 62 selfloop transitions, 3 changer transitions 5/349 dead transitions. [2023-11-30 03:19:29,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 349 transitions, 1977 flow [2023-11-30 03:19:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2023-11-30 03:19:29,019 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.775175644028103 [2023-11-30 03:19:29,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 993 transitions. [2023-11-30 03:19:29,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 993 transitions. [2023-11-30 03:19:29,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:29,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 993 transitions. [2023-11-30 03:19:29,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,023 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -61 predicate places. [2023-11-30 03:19:29,023 INFO L500 AbstractCegarLoop]: Abstraction has has 332 places, 349 transitions, 1977 flow [2023-11-30 03:19:29,024 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,024 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:29,024 INFO L232 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] [2023-11-30 03:19:29,024 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:19:29,024 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:29,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash -513723001, now seen corresponding path program 1 times [2023-11-30 03:19:29,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:29,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100715164] [2023-11-30 03:19:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100715164] [2023-11-30 03:19:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100715164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:29,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32897462] [2023-11-30 03:19:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:29,044 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:29,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:29,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:29,046 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 427 [2023-11-30 03:19:29,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 349 transitions, 1977 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:29,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 427 [2023-11-30 03:19:29,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:29,402 INFO L124 PetriNetUnfolderBase]: 749/2184 cut-off events. [2023-11-30 03:19:29,402 INFO L125 PetriNetUnfolderBase]: For 15656/38385 co-relation queries the response was YES. [2023-11-30 03:19:29,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12577 conditions, 2184 events. 749/2184 cut-off events. For 15656/38385 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13387 event pairs, 165 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 11564. Up to 1021 conditions per place. [2023-11-30 03:19:29,426 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 64 selfloop transitions, 2 changer transitions 5/348 dead transitions. [2023-11-30 03:19:29,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 348 transitions, 2107 flow [2023-11-30 03:19:29,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2023-11-30 03:19:29,428 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7626854020296643 [2023-11-30 03:19:29,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2023-11-30 03:19:29,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2023-11-30 03:19:29,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:29,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2023-11-30 03:19:29,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,432 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -60 predicate places. [2023-11-30 03:19:29,432 INFO L500 AbstractCegarLoop]: Abstraction has has 333 places, 348 transitions, 2107 flow [2023-11-30 03:19:29,433 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,433 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:29,433 INFO L232 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] [2023-11-30 03:19:29,433 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:19:29,433 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:29,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1351797839, now seen corresponding path program 1 times [2023-11-30 03:19:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012352055] [2023-11-30 03:19:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012352055] [2023-11-30 03:19:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012352055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:29,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954507355] [2023-11-30 03:19:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:29,463 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:29,465 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 427 [2023-11-30 03:19:29,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 348 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:29,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 427 [2023-11-30 03:19:29,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:29,791 INFO L124 PetriNetUnfolderBase]: 749/2135 cut-off events. [2023-11-30 03:19:29,792 INFO L125 PetriNetUnfolderBase]: For 19040/46813 co-relation queries the response was YES. [2023-11-30 03:19:29,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13546 conditions, 2135 events. 749/2135 cut-off events. For 19040/46813 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12904 event pairs, 159 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 12476. Up to 1021 conditions per place. [2023-11-30 03:19:29,819 INFO L140 encePairwiseOnDemand]: 425/427 looper letters, 64 selfloop transitions, 1 changer transitions 5/347 dead transitions. [2023-11-30 03:19:29,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 347 transitions, 2233 flow [2023-11-30 03:19:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2023-11-30 03:19:29,881 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7642466822794691 [2023-11-30 03:19:29,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 979 transitions. [2023-11-30 03:19:29,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 979 transitions. [2023-11-30 03:19:29,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:29,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 979 transitions. [2023-11-30 03:19:29,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,886 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -59 predicate places. [2023-11-30 03:19:29,886 INFO L500 AbstractCegarLoop]: Abstraction has has 334 places, 347 transitions, 2233 flow [2023-11-30 03:19:29,887 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:29,887 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:29,887 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:29,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:19:29,887 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:29,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1000715176, now seen corresponding path program 1 times [2023-11-30 03:19:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:29,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553270686] [2023-11-30 03:19:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553270686] [2023-11-30 03:19:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553270686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:30,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:19:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659409065] [2023-11-30 03:19:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:30,279 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:19:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:19:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:19:30,281 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 427 [2023-11-30 03:19:30,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 347 transitions, 2233 flow. Second operand has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:30,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:30,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 427 [2023-11-30 03:19:30,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:32,286 INFO L124 PetriNetUnfolderBase]: 5309/8481 cut-off events. [2023-11-30 03:19:32,286 INFO L125 PetriNetUnfolderBase]: For 250416/252572 co-relation queries the response was YES. [2023-11-30 03:19:32,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76959 conditions, 8481 events. 5309/8481 cut-off events. For 250416/252572 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 47911 event pairs, 1735 based on Foata normal form. 0/7883 useless extension candidates. Maximal degree in co-relation 75100. Up to 6897 conditions per place. [2023-11-30 03:19:32,412 INFO L140 encePairwiseOnDemand]: 415/427 looper letters, 111 selfloop transitions, 10 changer transitions 5/345 dead transitions. [2023-11-30 03:19:32,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 345 transitions, 2471 flow [2023-11-30 03:19:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:19:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:19:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1654 transitions. [2023-11-30 03:19:32,415 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6455893832943014 [2023-11-30 03:19:32,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1654 transitions. [2023-11-30 03:19:32,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1654 transitions. [2023-11-30 03:19:32,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:32,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1654 transitions. [2023-11-30 03:19:32,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 275.6666666666667) internal successors, (1654), 6 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:32,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:32,421 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:32,422 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -56 predicate places. [2023-11-30 03:19:32,422 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 345 transitions, 2471 flow [2023-11-30 03:19:32,422 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:32,422 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:32,422 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:32,423 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:19:32,423 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:32,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2135956343, now seen corresponding path program 1 times [2023-11-30 03:19:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927368510] [2023-11-30 03:19:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:32,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:32,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927368510] [2023-11-30 03:19:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927368510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:32,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:32,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477959588] [2023-11-30 03:19:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:32,455 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:32,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:32,456 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 427 [2023-11-30 03:19:32,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 345 transitions, 2471 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:32,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:32,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 427 [2023-11-30 03:19:32,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:34,359 INFO L124 PetriNetUnfolderBase]: 5309/8604 cut-off events. [2023-11-30 03:19:34,359 INFO L125 PetriNetUnfolderBase]: For 306243/308799 co-relation queries the response was YES. [2023-11-30 03:19:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82662 conditions, 8604 events. 5309/8604 cut-off events. For 306243/308799 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 49553 event pairs, 1776 based on Foata normal form. 0/7972 useless extension candidates. Maximal degree in co-relation 80696. Up to 6897 conditions per place. [2023-11-30 03:19:34,476 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 64 selfloop transitions, 2 changer transitions 5/344 dead transitions. [2023-11-30 03:19:34,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 344 transitions, 2601 flow [2023-11-30 03:19:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2023-11-30 03:19:34,478 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7626854020296643 [2023-11-30 03:19:34,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2023-11-30 03:19:34,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2023-11-30 03:19:34,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:34,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2023-11-30 03:19:34,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:34,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:34,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:34,483 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -55 predicate places. [2023-11-30 03:19:34,483 INFO L500 AbstractCegarLoop]: Abstraction has has 338 places, 344 transitions, 2601 flow [2023-11-30 03:19:34,483 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:34,483 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:34,483 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:34,483 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:19:34,484 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:34,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash -576897263, now seen corresponding path program 1 times [2023-11-30 03:19:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:34,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032348440] [2023-11-30 03:19:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032348440] [2023-11-30 03:19:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032348440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580413145] [2023-11-30 03:19:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:34,517 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:34,518 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 427 [2023-11-30 03:19:34,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 344 transitions, 2601 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:34,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:34,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 427 [2023-11-30 03:19:34,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:36,311 INFO L124 PetriNetUnfolderBase]: 5309/8479 cut-off events. [2023-11-30 03:19:36,311 INFO L125 PetriNetUnfolderBase]: For 345100/347768 co-relation queries the response was YES. [2023-11-30 03:19:36,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88115 conditions, 8479 events. 5309/8479 cut-off events. For 345100/347768 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 47730 event pairs, 1735 based on Foata normal form. 0/7883 useless extension candidates. Maximal degree in co-relation 86044. Up to 6897 conditions per place. [2023-11-30 03:19:36,446 INFO L140 encePairwiseOnDemand]: 425/427 looper letters, 64 selfloop transitions, 1 changer transitions 5/343 dead transitions. [2023-11-30 03:19:36,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 343 transitions, 2727 flow [2023-11-30 03:19:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2023-11-30 03:19:36,451 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7642466822794691 [2023-11-30 03:19:36,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 979 transitions. [2023-11-30 03:19:36,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 979 transitions. [2023-11-30 03:19:36,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:36,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 979 transitions. [2023-11-30 03:19:36,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:36,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:36,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:36,455 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -54 predicate places. [2023-11-30 03:19:36,455 INFO L500 AbstractCegarLoop]: Abstraction has has 339 places, 343 transitions, 2727 flow [2023-11-30 03:19:36,455 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:36,455 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:36,456 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:36,456 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:19:36,456 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:36,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash -597262655, now seen corresponding path program 1 times [2023-11-30 03:19:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081467017] [2023-11-30 03:19:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:36,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081467017] [2023-11-30 03:19:36,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081467017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:36,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:36,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:36,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296557692] [2023-11-30 03:19:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:36,493 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:36,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:36,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:36,494 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 427 [2023-11-30 03:19:36,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 343 transitions, 2727 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:36,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:36,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 427 [2023-11-30 03:19:36,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:38,195 INFO L124 PetriNetUnfolderBase]: 5309/8602 cut-off events. [2023-11-30 03:19:38,195 INFO L125 PetriNetUnfolderBase]: For 412089/415181 co-relation queries the response was YES. [2023-11-30 03:19:38,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93818 conditions, 8602 events. 5309/8602 cut-off events. For 412089/415181 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 49461 event pairs, 1776 based on Foata normal form. 0/7972 useless extension candidates. Maximal degree in co-relation 91640. Up to 6897 conditions per place. [2023-11-30 03:19:38,324 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 64 selfloop transitions, 2 changer transitions 5/342 dead transitions. [2023-11-30 03:19:38,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 342 transitions, 2857 flow [2023-11-30 03:19:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2023-11-30 03:19:38,326 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7626854020296643 [2023-11-30 03:19:38,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2023-11-30 03:19:38,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2023-11-30 03:19:38,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:38,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2023-11-30 03:19:38,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:38,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:38,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:38,330 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -53 predicate places. [2023-11-30 03:19:38,330 INFO L500 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 2857 flow [2023-11-30 03:19:38,330 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:38,330 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:38,330 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:38,330 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:19:38,330 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:38,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash 923181445, now seen corresponding path program 1 times [2023-11-30 03:19:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074287634] [2023-11-30 03:19:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:38,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074287634] [2023-11-30 03:19:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074287634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:38,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:38,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902520985] [2023-11-30 03:19:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:38,359 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:38,360 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 427 [2023-11-30 03:19:38,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 342 transitions, 2857 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:38,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:38,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 427 [2023-11-30 03:19:38,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:40,211 INFO L124 PetriNetUnfolderBase]: 5309/8477 cut-off events. [2023-11-30 03:19:40,211 INFO L125 PetriNetUnfolderBase]: For 454925/458105 co-relation queries the response was YES. [2023-11-30 03:19:40,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99271 conditions, 8477 events. 5309/8477 cut-off events. For 454925/458105 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 47710 event pairs, 1735 based on Foata normal form. 0/7883 useless extension candidates. Maximal degree in co-relation 96988. Up to 6897 conditions per place. [2023-11-30 03:19:40,356 INFO L140 encePairwiseOnDemand]: 425/427 looper letters, 64 selfloop transitions, 1 changer transitions 5/341 dead transitions. [2023-11-30 03:19:40,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 341 transitions, 2983 flow [2023-11-30 03:19:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2023-11-30 03:19:40,358 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7642466822794691 [2023-11-30 03:19:40,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 979 transitions. [2023-11-30 03:19:40,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 979 transitions. [2023-11-30 03:19:40,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:40,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 979 transitions. [2023-11-30 03:19:40,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:40,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:40,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:40,362 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -52 predicate places. [2023-11-30 03:19:40,362 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 341 transitions, 2983 flow [2023-11-30 03:19:40,362 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:40,362 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:40,362 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:40,362 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:19:40,362 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:40,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash 729433946, now seen corresponding path program 1 times [2023-11-30 03:19:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439507689] [2023-11-30 03:19:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439507689] [2023-11-30 03:19:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439507689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:40,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:40,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506594144] [2023-11-30 03:19:40,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:40,412 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:40,413 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 427 [2023-11-30 03:19:40,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 341 transitions, 2983 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:40,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:40,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 427 [2023-11-30 03:19:40,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:42,211 INFO L124 PetriNetUnfolderBase]: 5342/8543 cut-off events. [2023-11-30 03:19:42,211 INFO L125 PetriNetUnfolderBase]: For 523186/527130 co-relation queries the response was YES. [2023-11-30 03:19:42,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105575 conditions, 8543 events. 5342/8543 cut-off events. For 523186/527130 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 47704 event pairs, 1598 based on Foata normal form. 1/7949 useless extension candidates. Maximal degree in co-relation 78714. Up to 6941 conditions per place. [2023-11-30 03:19:42,599 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 68 selfloop transitions, 5 changer transitions 5/348 dead transitions. [2023-11-30 03:19:42,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 348 transitions, 3409 flow [2023-11-30 03:19:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2023-11-30 03:19:42,601 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7704918032786885 [2023-11-30 03:19:42,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 987 transitions. [2023-11-30 03:19:42,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 987 transitions. [2023-11-30 03:19:42,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:42,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 987 transitions. [2023-11-30 03:19:42,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:42,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:42,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:42,604 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -51 predicate places. [2023-11-30 03:19:42,605 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 348 transitions, 3409 flow [2023-11-30 03:19:42,605 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:42,605 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:42,605 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:42,605 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:19:42,605 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:42,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1875458957, now seen corresponding path program 1 times [2023-11-30 03:19:42,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:42,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908668699] [2023-11-30 03:19:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:43,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:43,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908668699] [2023-11-30 03:19:43,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908668699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:43,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:43,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:19:43,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005161640] [2023-11-30 03:19:43,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:43,297 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:19:43,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:43,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:19:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:19:43,299 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 427 [2023-11-30 03:19:43,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 348 transitions, 3409 flow. Second operand has 6 states, 6 states have (on average 283.1666666666667) internal successors, (1699), 6 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:43,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:43,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 427 [2023-11-30 03:19:43,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:45,404 INFO L124 PetriNetUnfolderBase]: 5342/8119 cut-off events. [2023-11-30 03:19:45,404 INFO L125 PetriNetUnfolderBase]: For 593819/597399 co-relation queries the response was YES. [2023-11-30 03:19:45,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111935 conditions, 8119 events. 5342/8119 cut-off events. For 593819/597399 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 41535 event pairs, 223 based on Foata normal form. 0/7824 useless extension candidates. Maximal degree in co-relation 108611. Up to 6796 conditions per place. [2023-11-30 03:19:45,558 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 278 selfloop transitions, 4 changer transitions 5/523 dead transitions. [2023-11-30 03:19:45,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 523 transitions, 10305 flow [2023-11-30 03:19:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:19:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:19:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1792 transitions. [2023-11-30 03:19:45,574 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6994535519125683 [2023-11-30 03:19:45,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1792 transitions. [2023-11-30 03:19:45,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1792 transitions. [2023-11-30 03:19:45,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:45,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1792 transitions. [2023-11-30 03:19:45,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 298.6666666666667) internal successors, (1792), 6 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:45,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:45,592 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:45,593 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -47 predicate places. [2023-11-30 03:19:45,593 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 523 transitions, 10305 flow [2023-11-30 03:19:45,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 283.1666666666667) internal successors, (1699), 6 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:45,594 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:45,594 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:45,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:19:45,594 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:45,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 527907261, now seen corresponding path program 1 times [2023-11-30 03:19:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328746315] [2023-11-30 03:19:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:46,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:46,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328746315] [2023-11-30 03:19:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328746315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:46,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:46,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:19:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821771066] [2023-11-30 03:19:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:46,118 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:19:46,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:46,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:19:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:19:46,119 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 427 [2023-11-30 03:19:46,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 523 transitions, 10305 flow. Second operand has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:46,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:46,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 427 [2023-11-30 03:19:46,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:48,338 INFO L124 PetriNetUnfolderBase]: 5346/8127 cut-off events. [2023-11-30 03:19:48,339 INFO L125 PetriNetUnfolderBase]: For 619896/624835 co-relation queries the response was YES. [2023-11-30 03:19:48,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118709 conditions, 8127 events. 5346/8127 cut-off events. For 619896/624835 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 41748 event pairs, 261 based on Foata normal form. 0/7841 useless extension candidates. Maximal degree in co-relation 110436. Up to 6752 conditions per place. [2023-11-30 03:19:48,520 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 389 selfloop transitions, 4 changer transitions 5/634 dead transitions. [2023-11-30 03:19:48,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 634 transitions, 15341 flow [2023-11-30 03:19:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:19:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:19:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1779 transitions. [2023-11-30 03:19:48,528 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6943793911007026 [2023-11-30 03:19:48,528 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1779 transitions. [2023-11-30 03:19:48,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1779 transitions. [2023-11-30 03:19:48,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:48,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1779 transitions. [2023-11-30 03:19:48,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 296.5) internal successors, (1779), 6 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:48,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:48,533 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:48,533 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -43 predicate places. [2023-11-30 03:19:48,533 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 634 transitions, 15341 flow [2023-11-30 03:19:48,534 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:48,534 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:48,534 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:48,534 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:19:48,534 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:48,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1814559427, now seen corresponding path program 1 times [2023-11-30 03:19:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517852783] [2023-11-30 03:19:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517852783] [2023-11-30 03:19:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517852783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:49,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:49,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:19:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184164786] [2023-11-30 03:19:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:49,106 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:19:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:19:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:19:49,108 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 427 [2023-11-30 03:19:49,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 634 transitions, 15341 flow. Second operand has 6 states, 6 states have (on average 285.5) internal successors, (1713), 6 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:49,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:49,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 427 [2023-11-30 03:19:49,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:51,445 INFO L124 PetriNetUnfolderBase]: 5366/8147 cut-off events. [2023-11-30 03:19:51,445 INFO L125 PetriNetUnfolderBase]: For 630745/634601 co-relation queries the response was YES. [2023-11-30 03:19:51,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125829 conditions, 8147 events. 5366/8147 cut-off events. For 630745/634601 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 41592 event pairs, 264 based on Foata normal form. 0/7885 useless extension candidates. Maximal degree in co-relation 121545. Up to 6756 conditions per place. [2023-11-30 03:19:51,611 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 452 selfloop transitions, 4 changer transitions 5/697 dead transitions. [2023-11-30 03:19:51,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 697 transitions, 18805 flow [2023-11-30 03:19:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:19:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:19:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1766 transitions. [2023-11-30 03:19:51,614 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6893052302888368 [2023-11-30 03:19:51,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1766 transitions. [2023-11-30 03:19:51,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1766 transitions. [2023-11-30 03:19:51,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:51,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1766 transitions. [2023-11-30 03:19:51,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 294.3333333333333) internal successors, (1766), 6 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:51,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:51,619 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:51,620 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -39 predicate places. [2023-11-30 03:19:51,620 INFO L500 AbstractCegarLoop]: Abstraction has has 354 places, 697 transitions, 18805 flow [2023-11-30 03:19:51,620 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 285.5) internal successors, (1713), 6 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:51,620 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:51,620 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:51,620 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 03:19:51,620 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:51,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1297544426, now seen corresponding path program 1 times [2023-11-30 03:19:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:51,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34757425] [2023-11-30 03:19:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34757425] [2023-11-30 03:19:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34757425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:52,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:19:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846490976] [2023-11-30 03:19:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:52,255 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:19:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:19:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:19:52,257 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 427 [2023-11-30 03:19:52,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 697 transitions, 18805 flow. Second operand has 6 states, 6 states have (on average 286.6666666666667) internal successors, (1720), 6 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:52,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:52,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 427 [2023-11-30 03:19:52,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:54,651 INFO L124 PetriNetUnfolderBase]: 5477/8335 cut-off events. [2023-11-30 03:19:54,651 INFO L125 PetriNetUnfolderBase]: For 624984/624984 co-relation queries the response was YES. [2023-11-30 03:19:54,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135095 conditions, 8335 events. 5477/8335 cut-off events. For 624984/624984 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 43028 event pairs, 280 based on Foata normal form. 0/8083 useless extension candidates. Maximal degree in co-relation 130554. Up to 6859 conditions per place. [2023-11-30 03:19:54,827 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 483 selfloop transitions, 4 changer transitions 5/728 dead transitions. [2023-11-30 03:19:54,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 728 transitions, 21113 flow [2023-11-30 03:19:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:19:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:19:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2023-11-30 03:19:54,830 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6842310694769711 [2023-11-30 03:19:54,830 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1753 transitions. [2023-11-30 03:19:54,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1753 transitions. [2023-11-30 03:19:54,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:54,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1753 transitions. [2023-11-30 03:19:54,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 292.1666666666667) internal successors, (1753), 6 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:54,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:54,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:54,835 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -35 predicate places. [2023-11-30 03:19:54,835 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 728 transitions, 21113 flow [2023-11-30 03:19:54,835 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 286.6666666666667) internal successors, (1720), 6 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:54,835 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:19:54,835 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:54,835 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 03:19:54,835 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2023-11-30 03:19:54,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:19:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1662443824, now seen corresponding path program 1 times [2023-11-30 03:19:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:19:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486041605] [2023-11-30 03:19:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:19:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:19:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:19:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:19:54,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:19:54,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486041605] [2023-11-30 03:19:54,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486041605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:19:54,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:19:54,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:19:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493208210] [2023-11-30 03:19:54,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:19:54,888 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:19:54,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:19:54,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:19:54,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:19:54,889 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 427 [2023-11-30 03:19:54,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 728 transitions, 21113 flow. Second operand has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:54,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:19:54,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 427 [2023-11-30 03:19:54,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:19:57,266 INFO L124 PetriNetUnfolderBase]: 5477/8331 cut-off events. [2023-11-30 03:19:57,267 INFO L125 PetriNetUnfolderBase]: For 700616/700616 co-relation queries the response was YES. [2023-11-30 03:19:57,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140843 conditions, 8331 events. 5477/8331 cut-off events. For 700616/700616 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 42919 event pairs, 280 based on Foata normal form. 4/8083 useless extension candidates. Maximal degree in co-relation 136134. Up to 6859 conditions per place. [2023-11-30 03:19:57,319 INFO L140 encePairwiseOnDemand]: 425/427 looper letters, 0 selfloop transitions, 0 changer transitions 727/727 dead transitions. [2023-11-30 03:19:57,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 727 transitions, 22019 flow [2023-11-30 03:19:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:19:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:19:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2023-11-30 03:19:57,322 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7689305230288837 [2023-11-30 03:19:57,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 985 transitions. [2023-11-30 03:19:57,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 985 transitions. [2023-11-30 03:19:57,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:19:57,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 985 transitions. [2023-11-30 03:19:57,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:57,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:57,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:57,326 INFO L307 CegarLoopForPetriNet]: 393 programPoint places, -34 predicate places. [2023-11-30 03:19:57,326 INFO L500 AbstractCegarLoop]: Abstraction has has 359 places, 727 transitions, 22019 flow [2023-11-30 03:19:57,326 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:19:57,336 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-buffer-mult2.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:19:57,389 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (166 of 167 remaining) [2023-11-30 03:19:57,390 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (165 of 167 remaining) [2023-11-30 03:19:57,390 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (164 of 167 remaining) [2023-11-30 03:19:57,390 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (163 of 167 remaining) [2023-11-30 03:19:57,390 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (162 of 167 remaining) [2023-11-30 03:19:57,390 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (161 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (160 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (159 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (158 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (157 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (156 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (155 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (154 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (153 of 167 remaining) [2023-11-30 03:19:57,391 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (152 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (151 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (150 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (149 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (148 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (147 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (146 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (145 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (144 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (143 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (142 of 167 remaining) [2023-11-30 03:19:57,392 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (141 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (140 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (139 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (138 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (137 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (136 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (135 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (134 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (133 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (132 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (131 of 167 remaining) [2023-11-30 03:19:57,393 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (130 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (129 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (128 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (127 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (126 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (125 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (124 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (123 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (122 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (121 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (120 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (119 of 167 remaining) [2023-11-30 03:19:57,394 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (118 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (117 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (116 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (115 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (114 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (113 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (112 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (111 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (110 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (109 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (108 of 167 remaining) [2023-11-30 03:19:57,395 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (107 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (106 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (105 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (104 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (103 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (101 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (100 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (99 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (98 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (97 of 167 remaining) [2023-11-30 03:19:57,396 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (96 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (95 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (94 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 167 remaining) [2023-11-30 03:19:57,397 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 167 remaining) [2023-11-30 03:19:57,398 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 167 remaining) [2023-11-30 03:19:57,399 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 167 remaining) [2023-11-30 03:19:57,400 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 167 remaining) [2023-11-30 03:19:57,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 167 remaining) [2023-11-30 03:19:57,402 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 167 remaining) [2023-11-30 03:19:57,403 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 167 remaining) [2023-11-30 03:19:57,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 167 remaining) [2023-11-30 03:19:57,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 167 remaining) [2023-11-30 03:19:57,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 167 remaining) [2023-11-30 03:19:57,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 167 remaining) [2023-11-30 03:19:57,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 167 remaining) [2023-11-30 03:19:57,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 167 remaining) [2023-11-30 03:19:57,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 167 remaining) [2023-11-30 03:19:57,405 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 03:19:57,406 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:19:57,410 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:19:57,411 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:19:57,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:19:57 BasicIcfg [2023-11-30 03:19:57,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:19:57,416 INFO L158 Benchmark]: Toolchain (without parser) took 33381.83ms. Allocated memory was 432.0MB in the beginning and 12.6GB in the end (delta: 12.1GB). Free memory was 391.5MB in the beginning and 10.5GB in the end (delta: -10.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-11-30 03:19:57,416 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 348.1MB. Free memory is still 304.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:19:57,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.36ms. Allocated memory is still 432.0MB. Free memory was 390.7MB in the beginning and 376.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 03:19:57,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.90ms. Allocated memory is still 432.0MB. Free memory was 376.8MB in the beginning and 372.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:19:57,417 INFO L158 Benchmark]: Boogie Preprocessor took 31.26ms. Allocated memory is still 432.0MB. Free memory was 372.7MB in the beginning and 368.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:19:57,417 INFO L158 Benchmark]: RCFGBuilder took 1106.74ms. Allocated memory is still 432.0MB. Free memory was 368.4MB in the beginning and 331.0MB in the end (delta: 37.4MB). Peak memory consumption was 106.4MB. Max. memory is 16.0GB. [2023-11-30 03:19:57,417 INFO L158 Benchmark]: TraceAbstraction took 31904.55ms. Allocated memory was 432.0MB in the beginning and 12.6GB in the end (delta: 12.1GB). Free memory was 330.0MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-11-30 03:19:57,418 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.10ms. Allocated memory is still 348.1MB. Free memory is still 304.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 275.36ms. Allocated memory is still 432.0MB. Free memory was 390.7MB in the beginning and 376.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.90ms. Allocated memory is still 432.0MB. Free memory was 376.8MB in the beginning and 372.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.26ms. Allocated memory is still 432.0MB. Free memory was 372.7MB in the beginning and 368.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1106.74ms. Allocated memory is still 432.0MB. Free memory was 368.4MB in the beginning and 331.0MB in the end (delta: 37.4MB). Peak memory consumption was 106.4MB. Max. memory is 16.0GB. * TraceAbstraction took 31904.55ms. Allocated memory was 432.0MB in the beginning and 12.6GB in the end (delta: 12.1GB). Free memory was 330.0MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 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: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 87]: 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: 87]: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: 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 9 procedures, 515 locations, 167 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: 31.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1386 IncrementalHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 219 mSDtfsCounter, 1386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22019occurred in iteration=22, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2646 NumberOfCodeBlocks, 2646 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2624 ConstructedInterpolants, 0 QuantifiedInterpolants, 3097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 93 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:19:57,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...