/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/chl-time-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 02:58:31,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 02:58:31,693 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 02:58:31,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 02:58:31,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 02:58:31,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 02:58:31,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 02:58:31,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 02:58:31,718 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 02:58:31,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 02:58:31,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 02:58:31,722 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 02:58:31,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 02:58:31,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 02:58:31,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 02:58:31,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 02:58:31,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 02:58:31,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 02:58:31,723 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 02:58:31,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 02:58:31,724 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 02:58:31,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 02:58:31,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 02:58:31,725 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 02:58:31,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 02:58:31,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:58:31,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 02:58:31,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 02:58:31,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 02:58:31,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 02:58:31,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 02:58:31,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 02:58:31,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 02:58:31,727 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 02:58:31,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 02:58:31,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 02:58:31,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 02:58:31,935 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 02:58:31,936 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 02:58:31,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2023-11-30 02:58:32,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 02:58:32,978 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 02:58:32,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2023-11-30 02:58:32,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a64df51d3/3f14e685375741939da6135f3a77186b/FLAGcd01449c7 [2023-11-30 02:58:32,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a64df51d3/3f14e685375741939da6135f3a77186b [2023-11-30 02:58:32,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 02:58:32,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 02:58:32,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 02:58:32,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 02:58:33,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 02:58:33,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:58:32" (1/1) ... [2023-11-30 02:58:33,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea7cb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33, skipping insertion in model container [2023-11-30 02:58:33,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:58:32" (1/1) ... [2023-11-30 02:58:33,017 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 02:58:33,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:58:33,132 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 02:58:33,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:58:33,160 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 02:58:33,160 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 02:58:33,164 INFO L206 MainTranslator]: Completed translation [2023-11-30 02:58:33,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33 WrapperNode [2023-11-30 02:58:33,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 02:58:33,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 02:58:33,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 02:58:33,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 02:58:33,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,200 INFO L138 Inliner]: procedures = 23, calls = 40, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 356 [2023-11-30 02:58:33,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 02:58:33,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 02:58:33,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 02:58:33,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 02:58:33,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 02:58:33,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 02:58:33,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 02:58:33,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 02:58:33,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (1/1) ... [2023-11-30 02:58:33,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:58:33,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:58:33,272 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 02:58:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 02:58:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 02:58:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 02:58:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 02:58:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 02:58:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 02:58:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 02:58:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 02:58:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 02:58:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 02:58:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 02:58:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 02:58:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 02:58:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 02:58:33,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 02:58:33,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 02:58:33,300 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 02:58:33,296 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 02:58:33,407 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 02:58:33,408 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 02:58:33,780 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 02:58:34,021 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 02:58:34,021 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 02:58:34,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:58:34 BoogieIcfgContainer [2023-11-30 02:58:34,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 02:58:34,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 02:58:34,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 02:58:34,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 02:58:34,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:58:32" (1/3) ... [2023-11-30 02:58:34,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bb8f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:58:34, skipping insertion in model container [2023-11-30 02:58:34,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:33" (2/3) ... [2023-11-30 02:58:34,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bb8f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:58:34, skipping insertion in model container [2023-11-30 02:58:34,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:58:34" (3/3) ... [2023-11-30 02:58:34,030 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-time-subst.wvr.c [2023-11-30 02:58:34,042 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 02:58:34,043 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-30 02:58:34,043 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 02:58:34,107 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 02:58:34,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 232 transitions, 485 flow [2023-11-30 02:58:34,221 INFO L124 PetriNetUnfolderBase]: 3/229 cut-off events. [2023-11-30 02:58:34,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 02:58:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 229 events. 3/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-30 02:58:34,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 232 transitions, 485 flow [2023-11-30 02:58:34,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 200 transitions, 418 flow [2023-11-30 02:58:34,242 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 02:58:34,246 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;@553458d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 02:58:34,246 INFO L363 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2023-11-30 02:58:34,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 02:58:34,252 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-30 02:58:34,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 02:58:34,252 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:34,252 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] [2023-11-30 02:58:34,253 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:34,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1609268145, now seen corresponding path program 1 times [2023-11-30 02:58:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:34,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578598798] [2023-11-30 02:58:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:34,428 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 02:58:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578598798] [2023-11-30 02:58:34,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578598798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:34,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242082522] [2023-11-30 02:58:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:34,438 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:34,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:34,464 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 232 [2023-11-30 02:58:34,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 200 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:34,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 232 [2023-11-30 02:58:34,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:34,571 INFO L124 PetriNetUnfolderBase]: 15/238 cut-off events. [2023-11-30 02:58:34,572 INFO L125 PetriNetUnfolderBase]: For 34/48 co-relation queries the response was YES. [2023-11-30 02:58:34,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 238 events. 15/238 cut-off events. For 34/48 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 268 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 150. Up to 40 conditions per place. [2023-11-30 02:58:34,575 INFO L140 encePairwiseOnDemand]: 205/232 looper letters, 12 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-11-30 02:58:34,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 175 transitions, 396 flow [2023-11-30 02:58:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-11-30 02:58:34,590 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.875 [2023-11-30 02:58:34,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-11-30 02:58:34,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-11-30 02:58:34,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:34,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-11-30 02:58:34,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 02:58:34,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,607 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -23 predicate places. [2023-11-30 02:58:34,607 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 175 transitions, 396 flow [2023-11-30 02:58:34,608 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,608 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:34,608 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] [2023-11-30 02:58:34,608 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 02:58:34,609 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:34,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1633941109, now seen corresponding path program 1 times [2023-11-30 02:58:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273126561] [2023-11-30 02:58:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:34,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:34,666 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 02:58:34,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:34,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273126561] [2023-11-30 02:58:34,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273126561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:34,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:34,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:34,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317515129] [2023-11-30 02:58:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:34,668 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:34,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:34,669 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 232 [2023-11-30 02:58:34,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 175 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:34,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 232 [2023-11-30 02:58:34,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:34,718 INFO L124 PetriNetUnfolderBase]: 15/237 cut-off events. [2023-11-30 02:58:34,718 INFO L125 PetriNetUnfolderBase]: For 85/173 co-relation queries the response was YES. [2023-11-30 02:58:34,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 237 events. 15/237 cut-off events. For 85/173 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 276 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 162. Up to 40 conditions per place. [2023-11-30 02:58:34,720 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 12 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2023-11-30 02:58:34,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 422 flow [2023-11-30 02:58:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-11-30 02:58:34,722 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8405172413793104 [2023-11-30 02:58:34,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:34,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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 02:58:34,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,726 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -22 predicate places. [2023-11-30 02:58:34,726 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 174 transitions, 422 flow [2023-11-30 02:58:34,726 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,726 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:34,726 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] [2023-11-30 02:58:34,727 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 02:58:34,727 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:34,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash -604503168, now seen corresponding path program 1 times [2023-11-30 02:58:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:34,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766026818] [2023-11-30 02:58:34,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:34,794 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 02:58:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766026818] [2023-11-30 02:58:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766026818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068476234] [2023-11-30 02:58:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:34,797 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:34,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:34,802 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 232 [2023-11-30 02:58:34,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 174 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:34,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 232 [2023-11-30 02:58:34,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:34,850 INFO L124 PetriNetUnfolderBase]: 15/236 cut-off events. [2023-11-30 02:58:34,850 INFO L125 PetriNetUnfolderBase]: For 160/322 co-relation queries the response was YES. [2023-11-30 02:58:34,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 236 events. 15/236 cut-off events. For 160/322 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 277 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 181. Up to 40 conditions per place. [2023-11-30 02:58:34,851 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 12 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2023-11-30 02:58:34,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 173 transitions, 448 flow [2023-11-30 02:58:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-11-30 02:58:34,853 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8405172413793104 [2023-11-30 02:58:34,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:34,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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 02:58:34,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,856 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -21 predicate places. [2023-11-30 02:58:34,857 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 173 transitions, 448 flow [2023-11-30 02:58:34,857 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,857 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:34,857 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] [2023-11-30 02:58:34,857 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 02:58:34,858 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:34,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -717114016, now seen corresponding path program 1 times [2023-11-30 02:58:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244799154] [2023-11-30 02:58:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:34,916 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 02:58:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244799154] [2023-11-30 02:58:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244799154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:34,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:34,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43012033] [2023-11-30 02:58:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:34,917 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:34,921 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 232 [2023-11-30 02:58:34,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 173 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:34,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 232 [2023-11-30 02:58:34,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:34,967 INFO L124 PetriNetUnfolderBase]: 15/235 cut-off events. [2023-11-30 02:58:34,967 INFO L125 PetriNetUnfolderBase]: For 259/495 co-relation queries the response was YES. [2023-11-30 02:58:34,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 235 events. 15/235 cut-off events. For 259/495 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 279 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 209. Up to 40 conditions per place. [2023-11-30 02:58:34,970 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 12 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2023-11-30 02:58:34,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 172 transitions, 474 flow [2023-11-30 02:58:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-11-30 02:58:34,972 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8405172413793104 [2023-11-30 02:58:34,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:34,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-11-30 02:58:34,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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 02:58:34,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:34,975 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -20 predicate places. [2023-11-30 02:58:34,976 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 172 transitions, 474 flow [2023-11-30 02:58:34,976 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:34,976 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:34,976 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] [2023-11-30 02:58:34,976 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 02:58:34,976 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:34,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1215202759, now seen corresponding path program 1 times [2023-11-30 02:58:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796878241] [2023-11-30 02:58:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:34,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:35,029 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 02:58:35,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:35,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796878241] [2023-11-30 02:58:35,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796878241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969877315] [2023-11-30 02:58:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:35,030 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:35,031 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 232 [2023-11-30 02:58:35,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 172 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:35,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:35,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 232 [2023-11-30 02:58:35,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:35,077 INFO L124 PetriNetUnfolderBase]: 15/234 cut-off events. [2023-11-30 02:58:35,077 INFO L125 PetriNetUnfolderBase]: For 382/692 co-relation queries the response was YES. [2023-11-30 02:58:35,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 234 events. 15/234 cut-off events. For 382/692 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 276 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 237. Up to 40 conditions per place. [2023-11-30 02:58:35,078 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 12 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2023-11-30 02:58:35,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 171 transitions, 500 flow [2023-11-30 02:58:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-11-30 02:58:35,079 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8405172413793104 [2023-11-30 02:58:35,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-11-30 02:58:35,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-11-30 02:58:35,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:35,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-11-30 02:58:35,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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 02:58:35,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,084 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -19 predicate places. [2023-11-30 02:58:35,084 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 171 transitions, 500 flow [2023-11-30 02:58:35,085 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:35,085 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:35,085 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] [2023-11-30 02:58:35,085 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 02:58:35,086 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:35,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1852825464, now seen corresponding path program 1 times [2023-11-30 02:58:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805392051] [2023-11-30 02:58:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:35,146 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 02:58:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:35,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805392051] [2023-11-30 02:58:35,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805392051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:35,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:35,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743192698] [2023-11-30 02:58:35,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:35,150 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:35,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:35,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:35,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:35,152 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 232 [2023-11-30 02:58:35,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 171 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:35,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:35,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 232 [2023-11-30 02:58:35,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:35,201 INFO L124 PetriNetUnfolderBase]: 15/233 cut-off events. [2023-11-30 02:58:35,201 INFO L125 PetriNetUnfolderBase]: For 529/913 co-relation queries the response was YES. [2023-11-30 02:58:35,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 233 events. 15/233 cut-off events. For 529/913 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 275 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 265. Up to 40 conditions per place. [2023-11-30 02:58:35,203 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2023-11-30 02:58:35,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 170 transitions, 526 flow [2023-11-30 02:58:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-11-30 02:58:35,204 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8405172413793104 [2023-11-30 02:58:35,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-11-30 02:58:35,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-11-30 02:58:35,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:35,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-11-30 02:58:35,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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 02:58:35,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,209 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -18 predicate places. [2023-11-30 02:58:35,209 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 170 transitions, 526 flow [2023-11-30 02:58:35,210 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:35,210 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:35,210 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] [2023-11-30 02:58:35,210 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 02:58:35,210 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:35,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1223087015, now seen corresponding path program 1 times [2023-11-30 02:58:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469415176] [2023-11-30 02:58:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:35,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:35,252 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 02:58:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:35,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469415176] [2023-11-30 02:58:35,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469415176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:35,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287420851] [2023-11-30 02:58:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:35,253 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:35,254 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 232 [2023-11-30 02:58:35,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 170 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 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 02:58:35,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:35,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 232 [2023-11-30 02:58:35,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:35,305 INFO L124 PetriNetUnfolderBase]: 15/232 cut-off events. [2023-11-30 02:58:35,305 INFO L125 PetriNetUnfolderBase]: For 700/1158 co-relation queries the response was YES. [2023-11-30 02:58:35,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 232 events. 15/232 cut-off events. For 700/1158 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 270 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 293. Up to 43 conditions per place. [2023-11-30 02:58:35,307 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 15 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2023-11-30 02:58:35,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 169 transitions, 558 flow [2023-11-30 02:58:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-11-30 02:58:35,308 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8318965517241379 [2023-11-30 02:58:35,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-11-30 02:58:35,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-11-30 02:58:35,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:35,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-11-30 02:58:35,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:35,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,312 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -17 predicate places. [2023-11-30 02:58:35,312 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 169 transitions, 558 flow [2023-11-30 02:58:35,312 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 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 02:58:35,312 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:35,312 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 02:58:35,312 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 02:58:35,312 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:35,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:35,313 INFO L85 PathProgramCache]: Analyzing trace with hash 573455545, now seen corresponding path program 1 times [2023-11-30 02:58:35,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:35,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252038057] [2023-11-30 02:58:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:35,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 02:58:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:35,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252038057] [2023-11-30 02:58:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252038057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:35,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:35,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266604065] [2023-11-30 02:58:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:35,357 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:35,358 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 232 [2023-11-30 02:58:35,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 169 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 02:58:35,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:35,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 232 [2023-11-30 02:58:35,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:35,405 INFO L124 PetriNetUnfolderBase]: 15/231 cut-off events. [2023-11-30 02:58:35,405 INFO L125 PetriNetUnfolderBase]: For 895/1427 co-relation queries the response was YES. [2023-11-30 02:58:35,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 231 events. 15/231 cut-off events. For 895/1427 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 271 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 321. Up to 46 conditions per place. [2023-11-30 02:58:35,406 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 18 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-11-30 02:58:35,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 168 transitions, 596 flow [2023-11-30 02:58:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-11-30 02:58:35,408 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8232758620689655 [2023-11-30 02:58:35,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-11-30 02:58:35,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-11-30 02:58:35,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:35,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-11-30 02:58:35,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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 02:58:35,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,410 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -16 predicate places. [2023-11-30 02:58:35,411 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 168 transitions, 596 flow [2023-11-30 02:58:35,411 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 02:58:35,411 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:35,411 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] [2023-11-30 02:58:35,411 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 02:58:35,411 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:35,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 669351966, now seen corresponding path program 1 times [2023-11-30 02:58:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042849815] [2023-11-30 02:58:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:35,435 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 02:58:35,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:35,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042849815] [2023-11-30 02:58:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042849815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:35,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:35,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376003179] [2023-11-30 02:58:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:35,436 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:35,437 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 232 [2023-11-30 02:58:35,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 168 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 02:58:35,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:35,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 232 [2023-11-30 02:58:35,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:35,478 INFO L124 PetriNetUnfolderBase]: 15/230 cut-off events. [2023-11-30 02:58:35,479 INFO L125 PetriNetUnfolderBase]: For 1114/1720 co-relation queries the response was YES. [2023-11-30 02:58:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 230 events. 15/230 cut-off events. For 1114/1720 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 266 event pairs, 15 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 349. Up to 46 conditions per place. [2023-11-30 02:58:35,480 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 17 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2023-11-30 02:58:35,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 167 transitions, 632 flow [2023-11-30 02:58:35,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-11-30 02:58:35,481 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8218390804597702 [2023-11-30 02:58:35,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-11-30 02:58:35,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-11-30 02:58:35,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:35,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-11-30 02:58:35,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 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 02:58:35,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:35,484 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -15 predicate places. [2023-11-30 02:58:35,484 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 167 transitions, 632 flow [2023-11-30 02:58:35,485 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 02:58:35,485 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:35,485 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] [2023-11-30 02:58:35,485 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 02:58:35,485 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:35,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash 235767579, now seen corresponding path program 1 times [2023-11-30 02:58:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373725363] [2023-11-30 02:58:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:35,893 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 02:58:35,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:35,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373725363] [2023-11-30 02:58:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373725363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:35,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:35,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:58:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613432136] [2023-11-30 02:58:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:35,896 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:58:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:58:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:58:35,898 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 232 [2023-11-30 02:58:35,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 167 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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 02:58:35,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:35,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 232 [2023-11-30 02:58:35,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:36,029 INFO L124 PetriNetUnfolderBase]: 117/399 cut-off events. [2023-11-30 02:58:36,029 INFO L125 PetriNetUnfolderBase]: For 5125/5251 co-relation queries the response was YES. [2023-11-30 02:58:36,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 399 events. 117/399 cut-off events. For 5125/5251 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1036 event pairs, 22 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 1594. Up to 148 conditions per place. [2023-11-30 02:58:36,033 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 38 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2023-11-30 02:58:36,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 178 transitions, 954 flow [2023-11-30 02:58:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:58:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:58:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1075 transitions. [2023-11-30 02:58:36,035 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7722701149425287 [2023-11-30 02:58:36,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1075 transitions. [2023-11-30 02:58:36,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1075 transitions. [2023-11-30 02:58:36,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:36,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1075 transitions. [2023-11-30 02:58:36,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.16666666666666) internal successors, (1075), 6 states have internal predecessors, (1075), 0 states have call successors, (0), 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 02:58:36,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 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 02:58:36,039 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 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 02:58:36,039 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -11 predicate places. [2023-11-30 02:58:36,040 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 178 transitions, 954 flow [2023-11-30 02:58:36,040 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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 02:58:36,040 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:36,040 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] [2023-11-30 02:58:36,040 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 02:58:36,041 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:36,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1132334410, now seen corresponding path program 1 times [2023-11-30 02:58:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406192555] [2023-11-30 02:58:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:36,463 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 02:58:36,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:36,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406192555] [2023-11-30 02:58:36,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406192555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:36,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:36,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:58:36,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620999312] [2023-11-30 02:58:36,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:36,464 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:58:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:58:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:58:36,465 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 232 [2023-11-30 02:58:36,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 178 transitions, 954 flow. Second operand has 6 states, 6 states have (on average 175.16666666666666) internal successors, (1051), 6 states have internal predecessors, (1051), 0 states have call successors, (0), 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 02:58:36,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:36,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 232 [2023-11-30 02:58:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:36,626 INFO L124 PetriNetUnfolderBase]: 118/402 cut-off events. [2023-11-30 02:58:36,626 INFO L125 PetriNetUnfolderBase]: For 5512/5552 co-relation queries the response was YES. [2023-11-30 02:58:36,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 402 events. 118/402 cut-off events. For 5512/5552 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1038 event pairs, 23 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 1359. Up to 158 conditions per place. [2023-11-30 02:58:36,630 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 45 selfloop transitions, 4 changer transitions 0/185 dead transitions. [2023-11-30 02:58:36,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 185 transitions, 1224 flow [2023-11-30 02:58:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:58:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:58:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2023-11-30 02:58:36,633 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7686781609195402 [2023-11-30 02:58:36,633 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1070 transitions. [2023-11-30 02:58:36,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1070 transitions. [2023-11-30 02:58:36,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:36,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1070 transitions. [2023-11-30 02:58:36,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 0 states have call successors, (0), 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 02:58:36,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 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 02:58:36,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 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 02:58:36,638 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -7 predicate places. [2023-11-30 02:58:36,638 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 185 transitions, 1224 flow [2023-11-30 02:58:36,639 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.16666666666666) internal successors, (1051), 6 states have internal predecessors, (1051), 0 states have call successors, (0), 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 02:58:36,639 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:36,639 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] [2023-11-30 02:58:36,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 02:58:36,639 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:36,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 894090493, now seen corresponding path program 1 times [2023-11-30 02:58:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:36,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408462803] [2023-11-30 02:58:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:37,120 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 02:58:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408462803] [2023-11-30 02:58:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408462803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:37,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:37,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:58:37,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997484518] [2023-11-30 02:58:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:37,121 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:58:37,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:37,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:58:37,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:58:37,122 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 232 [2023-11-30 02:58:37,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 185 transitions, 1224 flow. Second operand has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 0 states have call successors, (0), 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 02:58:37,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:37,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 232 [2023-11-30 02:58:37,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:37,232 INFO L124 PetriNetUnfolderBase]: 122/408 cut-off events. [2023-11-30 02:58:37,233 INFO L125 PetriNetUnfolderBase]: For 6137/6137 co-relation queries the response was YES. [2023-11-30 02:58:37,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2457 conditions, 408 events. 122/408 cut-off events. For 6137/6137 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1061 event pairs, 27 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 1555. Up to 206 conditions per place. [2023-11-30 02:58:37,236 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 48 selfloop transitions, 4 changer transitions 0/188 dead transitions. [2023-11-30 02:58:37,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 188 transitions, 1418 flow [2023-11-30 02:58:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:58:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:58:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1065 transitions. [2023-11-30 02:58:37,239 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7650862068965517 [2023-11-30 02:58:37,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1065 transitions. [2023-11-30 02:58:37,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1065 transitions. [2023-11-30 02:58:37,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:37,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1065 transitions. [2023-11-30 02:58:37,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.5) internal successors, (1065), 6 states have internal predecessors, (1065), 0 states have call successors, (0), 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 02:58:37,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 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 02:58:37,243 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 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 02:58:37,243 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -3 predicate places. [2023-11-30 02:58:37,243 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 188 transitions, 1418 flow [2023-11-30 02:58:37,244 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 0 states have call successors, (0), 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 02:58:37,244 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:37,244 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] [2023-11-30 02:58:37,244 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 02:58:37,244 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:37,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2066766874, now seen corresponding path program 1 times [2023-11-30 02:58:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:37,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54037218] [2023-11-30 02:58:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:37,291 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 02:58:37,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54037218] [2023-11-30 02:58:37,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54037218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:37,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:37,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:37,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53586000] [2023-11-30 02:58:37,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:37,292 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:37,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:37,293 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 232 [2023-11-30 02:58:37,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 188 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 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 02:58:37,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:37,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 232 [2023-11-30 02:58:37,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:37,409 INFO L124 PetriNetUnfolderBase]: 122/407 cut-off events. [2023-11-30 02:58:37,409 INFO L125 PetriNetUnfolderBase]: For 7401/7401 co-relation queries the response was YES. [2023-11-30 02:58:37,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 407 events. 122/407 cut-off events. For 7401/7401 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1077 event pairs, 27 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 1655. Up to 206 conditions per place. [2023-11-30 02:58:37,412 INFO L140 encePairwiseOnDemand]: 230/232 looper letters, 36 selfloop transitions, 1 changer transitions 0/187 dead transitions. [2023-11-30 02:58:37,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 187 transitions, 1488 flow [2023-11-30 02:58:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2023-11-30 02:58:37,414 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8433908045977011 [2023-11-30 02:58:37,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2023-11-30 02:58:37,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2023-11-30 02:58:37,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:37,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2023-11-30 02:58:37,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 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 02:58:37,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:37,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:37,417 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -2 predicate places. [2023-11-30 02:58:37,417 INFO L500 AbstractCegarLoop]: Abstraction has has 208 places, 187 transitions, 1488 flow [2023-11-30 02:58:37,418 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 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 02:58:37,418 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:37,418 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] [2023-11-30 02:58:37,418 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 02:58:37,418 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:37,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash -185462526, now seen corresponding path program 1 times [2023-11-30 02:58:37,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994357866] [2023-11-30 02:58:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:37,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:37,473 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 02:58:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994357866] [2023-11-30 02:58:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994357866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:37,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440745103] [2023-11-30 02:58:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:37,474 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:37,475 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 232 [2023-11-30 02:58:37,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 187 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:37,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:37,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 232 [2023-11-30 02:58:37,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:37,557 INFO L124 PetriNetUnfolderBase]: 122/405 cut-off events. [2023-11-30 02:58:37,557 INFO L125 PetriNetUnfolderBase]: For 8786/8786 co-relation queries the response was YES. [2023-11-30 02:58:37,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 405 events. 122/405 cut-off events. For 8786/8786 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1056 event pairs, 27 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 1755. Up to 206 conditions per place. [2023-11-30 02:58:37,561 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 38 selfloop transitions, 1 changer transitions 0/185 dead transitions. [2023-11-30 02:58:37,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 185 transitions, 1558 flow [2023-11-30 02:58:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 581 transitions. [2023-11-30 02:58:37,563 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8347701149425287 [2023-11-30 02:58:37,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 581 transitions. [2023-11-30 02:58:37,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 581 transitions. [2023-11-30 02:58:37,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:37,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 581 transitions. [2023-11-30 02:58:37,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:37,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:37,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:37,566 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -2 predicate places. [2023-11-30 02:58:37,566 INFO L500 AbstractCegarLoop]: Abstraction has has 208 places, 185 transitions, 1558 flow [2023-11-30 02:58:37,566 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:37,566 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:37,566 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] [2023-11-30 02:58:37,566 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 02:58:37,566 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2023-11-30 02:58:37,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1645106932, now seen corresponding path program 1 times [2023-11-30 02:58:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:37,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586897652] [2023-11-30 02:58:37,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:37,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:37,616 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 02:58:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586897652] [2023-11-30 02:58:37,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586897652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:37,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:37,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623714573] [2023-11-30 02:58:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:37,617 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:37,618 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 232 [2023-11-30 02:58:37,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 185 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:37,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:37,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 232 [2023-11-30 02:58:37,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:37,690 INFO L124 PetriNetUnfolderBase]: 122/403 cut-off events. [2023-11-30 02:58:37,691 INFO L125 PetriNetUnfolderBase]: For 10291/10291 co-relation queries the response was YES. [2023-11-30 02:58:37,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 403 events. 122/403 cut-off events. For 10291/10291 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1043 event pairs, 27 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 1855. Up to 206 conditions per place. [2023-11-30 02:58:37,692 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 0 selfloop transitions, 0 changer transitions 183/183 dead transitions. [2023-11-30 02:58:37,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 183 transitions, 1626 flow [2023-11-30 02:58:37,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-11-30 02:58:37,694 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-30 02:58:37,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-11-30 02:58:37,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-11-30 02:58:37,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:37,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-11-30 02:58:37,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:37,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:37,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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 02:58:37,697 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -2 predicate places. [2023-11-30 02:58:37,697 INFO L500 AbstractCegarLoop]: Abstraction has has 208 places, 183 transitions, 1626 flow [2023-11-30 02:58:37,697 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:37,706 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-time-subst.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 02:58:37,750 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (67 of 68 remaining) [2023-11-30 02:58:37,750 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (66 of 68 remaining) [2023-11-30 02:58:37,750 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (65 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (64 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (62 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (61 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (60 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 68 remaining) [2023-11-30 02:58:37,751 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (52 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (51 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (50 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (49 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (48 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (47 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (46 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (45 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (44 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 68 remaining) [2023-11-30 02:58:37,752 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (29 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (28 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (27 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 68 remaining) [2023-11-30 02:58:37,753 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (20 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 68 remaining) [2023-11-30 02:58:37,754 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 68 remaining) [2023-11-30 02:58:37,755 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 68 remaining) [2023-11-30 02:58:37,755 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 02:58:37,756 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:58:37,761 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 02:58:37,761 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 02:58:37,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:58:37 BasicIcfg [2023-11-30 02:58:37,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 02:58:37,768 INFO L158 Benchmark]: Toolchain (without parser) took 4773.98ms. Allocated memory was 614.5MB in the beginning and 822.1MB in the end (delta: 207.6MB). Free memory was 569.0MB in the beginning and 537.8MB in the end (delta: 31.2MB). Peak memory consumption was 240.7MB. Max. memory is 16.0GB. [2023-11-30 02:58:37,768 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 369.1MB. Free memory is still 316.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 02:58:37,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.07ms. Allocated memory is still 614.5MB. Free memory was 569.0MB in the beginning and 556.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 02:58:37,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.80ms. Allocated memory is still 614.5MB. Free memory was 556.7MB in the beginning and 553.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 02:58:37,769 INFO L158 Benchmark]: Boogie Preprocessor took 33.10ms. Allocated memory is still 614.5MB. Free memory was 553.7MB in the beginning and 551.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:58:37,769 INFO L158 Benchmark]: RCFGBuilder took 788.14ms. Allocated memory is still 614.5MB. Free memory was 551.3MB in the beginning and 520.6MB in the end (delta: 30.7MB). Peak memory consumption was 51.3MB. Max. memory is 16.0GB. [2023-11-30 02:58:37,769 INFO L158 Benchmark]: TraceAbstraction took 3742.70ms. Allocated memory was 614.5MB in the beginning and 822.1MB in the end (delta: 207.6MB). Free memory was 519.6MB in the beginning and 537.8MB in the end (delta: -18.2MB). Peak memory consumption was 189.4MB. Max. memory is 16.0GB. [2023-11-30 02:58:37,770 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.09ms. Allocated memory is still 369.1MB. Free memory is still 316.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 170.07ms. Allocated memory is still 614.5MB. Free memory was 569.0MB in the beginning and 556.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.80ms. Allocated memory is still 614.5MB. Free memory was 556.7MB in the beginning and 553.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.10ms. Allocated memory is still 614.5MB. Free memory was 553.7MB in the beginning and 551.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 788.14ms. Allocated memory is still 614.5MB. Free memory was 551.3MB in the beginning and 520.6MB in the end (delta: 30.7MB). Peak memory consumption was 51.3MB. Max. memory is 16.0GB. * TraceAbstraction took 3742.70ms. Allocated memory was 614.5MB in the beginning and 822.1MB in the end (delta: 207.6MB). Free memory was 519.6MB in the beginning and 537.8MB in the end (delta: -18.2MB). Peak memory consumption was 189.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 272 locations, 68 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 91 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1626occurred in iteration=15, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1360 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1345 ConstructedInterpolants, 0 QuantifiedInterpolants, 1612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 02:58:37,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...