/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/parallel-ticket-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:11:02,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:11:02,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:11:02,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:11:02,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:11:02,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:11:02,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:11:02,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:11:02,551 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:11:02,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:11:02,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:11:02,552 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:11:02,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:11:02,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:11:02,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:11:02,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:11:02,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:11:02,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:11:02,555 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:11:02,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:11:02,555 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:11:02,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:11:02,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:11:02,556 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:11:02,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:11:02,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:11:02,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:11:02,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:11:02,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:11:02,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:11:02,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:11:02,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:11:02,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:11:02,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:11:02,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:11:02,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:11:02,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:11:02,809 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:11:02,809 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:11:02,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-2.wvr.c [2023-11-30 03:11:03,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:11:04,185 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:11:04,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-2.wvr.c [2023-11-30 03:11:04,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729548576/08eb073b3eb14277805cea9ad722046a/FLAG3755b20ed [2023-11-30 03:11:04,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729548576/08eb073b3eb14277805cea9ad722046a [2023-11-30 03:11:04,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:11:04,212 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:11:04,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:11:04,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:11:04,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:11:04,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c2794d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04, skipping insertion in model container [2023-11-30 03:11:04,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,244 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:11:04,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:11:04,393 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:11:04,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:11:04,423 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:11:04,423 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:11:04,429 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:11:04,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04 WrapperNode [2023-11-30 03:11:04,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:11:04,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:11:04,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:11:04,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:11:04,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,465 INFO L138 Inliner]: procedures = 21, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 251 [2023-11-30 03:11:04,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:11:04,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:11:04,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:11:04,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:11:04,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:11:04,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:11:04,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:11:04,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:11:04,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (1/1) ... [2023-11-30 03:11:04,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:11:04,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:11:04,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:11:04,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:11:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:11:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:11:04,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:11:04,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:11:04,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:11:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:11:04,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:11:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:11:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:11:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:11:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:11:04,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:11:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:11:04,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:11:04,557 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:11:04,683 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:11:04,686 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:11:05,029 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:11:05,165 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:11:05,165 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:11:05,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:11:05 BoogieIcfgContainer [2023-11-30 03:11:05,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:11:05,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:11:05,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:11:05,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:11:05,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:11:04" (1/3) ... [2023-11-30 03:11:05,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe30548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:11:05, skipping insertion in model container [2023-11-30 03:11:05,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:04" (2/3) ... [2023-11-30 03:11:05,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe30548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:11:05, skipping insertion in model container [2023-11-30 03:11:05,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:11:05" (3/3) ... [2023-11-30 03:11:05,173 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-2.wvr.c [2023-11-30 03:11:05,187 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:11:05,187 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-11-30 03:11:05,187 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:11:05,265 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:11:05,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 201 transitions, 416 flow [2023-11-30 03:11:05,355 INFO L124 PetriNetUnfolderBase]: 5/199 cut-off events. [2023-11-30 03:11:05,356 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:11:05,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 199 events. 5/199 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 181 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-30 03:11:05,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 201 transitions, 416 flow [2023-11-30 03:11:05,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 178 transitions, 368 flow [2023-11-30 03:11:05,371 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:11:05,376 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;@51d2a85d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:11:05,376 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-30 03:11:05,382 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:11:05,382 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-30 03:11:05,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:11:05,382 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:05,382 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] [2023-11-30 03:11:05,383 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:05,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash -100784942, now seen corresponding path program 1 times [2023-11-30 03:11:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084316863] [2023-11-30 03:11:05,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:05,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084316863] [2023-11-30 03:11:05,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084316863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:05,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:05,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069356137] [2023-11-30 03:11:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:05,582 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:05,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:05,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:05,606 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 201 [2023-11-30 03:11:05,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 178 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:05,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 201 [2023-11-30 03:11:05,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:05,686 INFO L124 PetriNetUnfolderBase]: 32/237 cut-off events. [2023-11-30 03:11:05,686 INFO L125 PetriNetUnfolderBase]: For 25/51 co-relation queries the response was YES. [2023-11-30 03:11:05,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 237 events. 32/237 cut-off events. For 25/51 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 490 event pairs, 29 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 166. Up to 75 conditions per place. [2023-11-30 03:11:05,690 INFO L140 encePairwiseOnDemand]: 176/201 looper letters, 16 selfloop transitions, 2 changer transitions 1/155 dead transitions. [2023-11-30 03:11:05,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 358 flow [2023-11-30 03:11:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-11-30 03:11:05,708 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8490878938640133 [2023-11-30 03:11:05,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-11-30 03:11:05,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-11-30 03:11:05,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:05,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-11-30 03:11:05,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,722 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -20 predicate places. [2023-11-30 03:11:05,723 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 155 transitions, 358 flow [2023-11-30 03:11:05,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,723 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:05,723 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] [2023-11-30 03:11:05,724 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:11:05,724 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:05,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash -561065903, now seen corresponding path program 1 times [2023-11-30 03:11:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:05,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823889157] [2023-11-30 03:11:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:05,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823889157] [2023-11-30 03:11:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823889157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:05,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:05,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812824665] [2023-11-30 03:11:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:05,771 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:05,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:05,773 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 201 [2023-11-30 03:11:05,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 155 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:05,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 201 [2023-11-30 03:11:05,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:05,848 INFO L124 PetriNetUnfolderBase]: 32/236 cut-off events. [2023-11-30 03:11:05,848 INFO L125 PetriNetUnfolderBase]: For 78/690 co-relation queries the response was YES. [2023-11-30 03:11:05,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 236 events. 32/236 cut-off events. For 78/690 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 486 event pairs, 29 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 226. Up to 75 conditions per place. [2023-11-30 03:11:05,850 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 16 selfloop transitions, 2 changer transitions 1/154 dead transitions. [2023-11-30 03:11:05,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 392 flow [2023-11-30 03:11:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2023-11-30 03:11:05,852 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8126036484245439 [2023-11-30 03:11:05,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2023-11-30 03:11:05,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2023-11-30 03:11:05,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:05,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2023-11-30 03:11:05,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,857 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -19 predicate places. [2023-11-30 03:11:05,857 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 154 transitions, 392 flow [2023-11-30 03:11:05,857 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,857 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:05,858 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] [2023-11-30 03:11:05,858 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:11:05,858 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:05,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1535741456, now seen corresponding path program 1 times [2023-11-30 03:11:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458509347] [2023-11-30 03:11:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458509347] [2023-11-30 03:11:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458509347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:05,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299913376] [2023-11-30 03:11:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:05,929 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:05,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:05,931 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 201 [2023-11-30 03:11:05,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 154 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:05,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:05,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 201 [2023-11-30 03:11:05,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:06,021 INFO L124 PetriNetUnfolderBase]: 32/235 cut-off events. [2023-11-30 03:11:06,022 INFO L125 PetriNetUnfolderBase]: For 170/1368 co-relation queries the response was YES. [2023-11-30 03:11:06,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 235 events. 32/235 cut-off events. For 170/1368 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 490 event pairs, 29 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 286. Up to 84 conditions per place. [2023-11-30 03:11:06,028 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 25 selfloop transitions, 2 changer transitions 1/153 dead transitions. [2023-11-30 03:11:06,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 444 flow [2023-11-30 03:11:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-11-30 03:11:06,030 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7827529021558872 [2023-11-30 03:11:06,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-11-30 03:11:06,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-11-30 03:11:06,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:06,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-11-30 03:11:06,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,037 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -18 predicate places. [2023-11-30 03:11:06,037 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 153 transitions, 444 flow [2023-11-30 03:11:06,038 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,038 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:06,038 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] [2023-11-30 03:11:06,038 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:11:06,038 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:06,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2126986108, now seen corresponding path program 1 times [2023-11-30 03:11:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:06,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130270372] [2023-11-30 03:11:06,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:06,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:06,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130270372] [2023-11-30 03:11:06,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130270372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:06,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:06,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:06,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252997236] [2023-11-30 03:11:06,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:06,137 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:06,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:06,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:06,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:06,139 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2023-11-30 03:11:06,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 153 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:06,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2023-11-30 03:11:06,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:06,208 INFO L124 PetriNetUnfolderBase]: 32/234 cut-off events. [2023-11-30 03:11:06,208 INFO L125 PetriNetUnfolderBase]: For 301/2085 co-relation queries the response was YES. [2023-11-30 03:11:06,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 234 events. 32/234 cut-off events. For 301/2085 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 490 event pairs, 29 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 346. Up to 84 conditions per place. [2023-11-30 03:11:06,212 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 19 selfloop transitions, 2 changer transitions 1/152 dead transitions. [2023-11-30 03:11:06,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 152 transitions, 484 flow [2023-11-30 03:11:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-11-30 03:11:06,215 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.802653399668325 [2023-11-30 03:11:06,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-11-30 03:11:06,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-11-30 03:11:06,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:06,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-11-30 03:11:06,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,220 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -17 predicate places. [2023-11-30 03:11:06,221 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 152 transitions, 484 flow [2023-11-30 03:11:06,221 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,221 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:06,222 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] [2023-11-30 03:11:06,222 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:11:06,222 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:06,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -623726066, now seen corresponding path program 1 times [2023-11-30 03:11:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:06,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076399417] [2023-11-30 03:11:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:06,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076399417] [2023-11-30 03:11:06,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076399417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:06,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:06,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:06,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532699408] [2023-11-30 03:11:06,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:06,298 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:06,300 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2023-11-30 03:11:06,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 152 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:06,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2023-11-30 03:11:06,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:06,361 INFO L124 PetriNetUnfolderBase]: 32/233 cut-off events. [2023-11-30 03:11:06,361 INFO L125 PetriNetUnfolderBase]: For 471/2841 co-relation queries the response was YES. [2023-11-30 03:11:06,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 233 events. 32/233 cut-off events. For 471/2841 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 491 event pairs, 29 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 406. Up to 84 conditions per place. [2023-11-30 03:11:06,363 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 19 selfloop transitions, 2 changer transitions 1/151 dead transitions. [2023-11-30 03:11:06,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 151 transitions, 524 flow [2023-11-30 03:11:06,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-11-30 03:11:06,365 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.802653399668325 [2023-11-30 03:11:06,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-11-30 03:11:06,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-11-30 03:11:06,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:06,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-11-30 03:11:06,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,372 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -16 predicate places. [2023-11-30 03:11:06,372 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 151 transitions, 524 flow [2023-11-30 03:11:06,373 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,373 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:06,373 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] [2023-11-30 03:11:06,373 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:11:06,373 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:06,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1968377455, now seen corresponding path program 1 times [2023-11-30 03:11:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724453015] [2023-11-30 03:11:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:06,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724453015] [2023-11-30 03:11:06,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724453015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486346068] [2023-11-30 03:11:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:06,454 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:06,456 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 201 [2023-11-30 03:11:06,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 151 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:06,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 201 [2023-11-30 03:11:06,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:06,518 INFO L124 PetriNetUnfolderBase]: 32/232 cut-off events. [2023-11-30 03:11:06,518 INFO L125 PetriNetUnfolderBase]: For 680/3636 co-relation queries the response was YES. [2023-11-30 03:11:06,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 232 events. 32/232 cut-off events. For 680/3636 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 488 event pairs, 29 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 466. Up to 84 conditions per place. [2023-11-30 03:11:06,520 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 21 selfloop transitions, 2 changer transitions 1/150 dead transitions. [2023-11-30 03:11:06,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 150 transitions, 568 flow [2023-11-30 03:11:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-11-30 03:11:06,541 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7910447761194029 [2023-11-30 03:11:06,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-11-30 03:11:06,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-11-30 03:11:06,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:06,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-11-30 03:11:06,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,548 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -15 predicate places. [2023-11-30 03:11:06,548 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 150 transitions, 568 flow [2023-11-30 03:11:06,548 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,549 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:06,549 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] [2023-11-30 03:11:06,549 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:11:06,549 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:06,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1582665972, now seen corresponding path program 1 times [2023-11-30 03:11:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119357641] [2023-11-30 03:11:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:06,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119357641] [2023-11-30 03:11:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119357641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:06,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:06,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291186165] [2023-11-30 03:11:06,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:06,614 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:06,616 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 201 [2023-11-30 03:11:06,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 150 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:06,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 201 [2023-11-30 03:11:06,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:06,682 INFO L124 PetriNetUnfolderBase]: 34/258 cut-off events. [2023-11-30 03:11:06,682 INFO L125 PetriNetUnfolderBase]: For 1009/4790 co-relation queries the response was YES. [2023-11-30 03:11:06,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 258 events. 34/258 cut-off events. For 1009/4790 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 639 event pairs, 17 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 608. Up to 90 conditions per place. [2023-11-30 03:11:06,685 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 27 selfloop transitions, 5 changer transitions 1/158 dead transitions. [2023-11-30 03:11:06,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 158 transitions, 780 flow [2023-11-30 03:11:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2023-11-30 03:11:06,688 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.814262023217247 [2023-11-30 03:11:06,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2023-11-30 03:11:06,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2023-11-30 03:11:06,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:06,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2023-11-30 03:11:06,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,692 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -16 predicate places. [2023-11-30 03:11:06,692 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 158 transitions, 780 flow [2023-11-30 03:11:06,692 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,692 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:06,693 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:06,693 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:11:06,693 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:06,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash -523558636, now seen corresponding path program 1 times [2023-11-30 03:11:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920941983] [2023-11-30 03:11:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:06,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:06,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920941983] [2023-11-30 03:11:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920941983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:06,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:06,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:06,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143805441] [2023-11-30 03:11:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:06,743 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:06,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:06,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:06,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:06,744 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201 [2023-11-30 03:11:06,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 158 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:06,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201 [2023-11-30 03:11:06,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:06,804 INFO L124 PetriNetUnfolderBase]: 34/257 cut-off events. [2023-11-30 03:11:06,804 INFO L125 PetriNetUnfolderBase]: For 1310/5717 co-relation queries the response was YES. [2023-11-30 03:11:06,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 257 events. 34/257 cut-off events. For 1310/5717 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 615 event pairs, 10 based on Foata normal form. 3/245 useless extension candidates. Maximal degree in co-relation 675. Up to 90 conditions per place. [2023-11-30 03:11:06,807 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 28 selfloop transitions, 3 changer transitions 1/160 dead transitions. [2023-11-30 03:11:06,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 160 transitions, 889 flow [2023-11-30 03:11:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-11-30 03:11:06,809 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8208955223880597 [2023-11-30 03:11:06,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-11-30 03:11:06,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-11-30 03:11:06,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:06,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-11-30 03:11:06,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,816 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -15 predicate places. [2023-11-30 03:11:06,816 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 889 flow [2023-11-30 03:11:06,816 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,816 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:06,817 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] [2023-11-30 03:11:06,818 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:11:06,818 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:06,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 322302788, now seen corresponding path program 1 times [2023-11-30 03:11:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:06,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231968059] [2023-11-30 03:11:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231968059] [2023-11-30 03:11:06,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231968059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519822542] [2023-11-30 03:11:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:06,865 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:06,866 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201 [2023-11-30 03:11:06,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:06,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201 [2023-11-30 03:11:06,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:06,945 INFO L124 PetriNetUnfolderBase]: 51/367 cut-off events. [2023-11-30 03:11:06,946 INFO L125 PetriNetUnfolderBase]: For 2129/9748 co-relation queries the response was YES. [2023-11-30 03:11:06,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 367 events. 51/367 cut-off events. For 2129/9748 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1280 event pairs, 18 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 710. Up to 127 conditions per place. [2023-11-30 03:11:06,948 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 43 selfloop transitions, 3 changer transitions 1/174 dead transitions. [2023-11-30 03:11:06,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 174 transitions, 1256 flow [2023-11-30 03:11:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2023-11-30 03:11:06,951 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8308457711442786 [2023-11-30 03:11:06,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2023-11-30 03:11:06,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2023-11-30 03:11:06,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:06,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2023-11-30 03:11:06,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,955 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -14 predicate places. [2023-11-30 03:11:06,955 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 174 transitions, 1256 flow [2023-11-30 03:11:06,955 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:06,955 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:06,955 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] [2023-11-30 03:11:06,955 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:11:06,956 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:06,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1500391509, now seen corresponding path program 1 times [2023-11-30 03:11:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:06,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222282452] [2023-11-30 03:11:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:07,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222282452] [2023-11-30 03:11:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222282452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:07,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60387765] [2023-11-30 03:11:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:07,001 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:07,003 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 201 [2023-11-30 03:11:07,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 174 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:07,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:07,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 201 [2023-11-30 03:11:07,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:07,119 INFO L124 PetriNetUnfolderBase]: 87/545 cut-off events. [2023-11-30 03:11:07,119 INFO L125 PetriNetUnfolderBase]: For 4454/16702 co-relation queries the response was YES. [2023-11-30 03:11:07,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 545 events. 87/545 cut-off events. For 4454/16702 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2596 event pairs, 29 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 775. Up to 206 conditions per place. [2023-11-30 03:11:07,125 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 71 selfloop transitions, 4 changer transitions 4/202 dead transitions. [2023-11-30 03:11:07,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 202 transitions, 2029 flow [2023-11-30 03:11:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-11-30 03:11:07,127 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8225538971807629 [2023-11-30 03:11:07,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-11-30 03:11:07,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-11-30 03:11:07,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:07,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-11-30 03:11:07,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:07,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:07,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:07,131 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -14 predicate places. [2023-11-30 03:11:07,131 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 202 transitions, 2029 flow [2023-11-30 03:11:07,131 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:07,131 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:07,132 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] [2023-11-30 03:11:07,132 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:11:07,132 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:07,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:07,132 INFO L85 PathProgramCache]: Analyzing trace with hash -205107605, now seen corresponding path program 1 times [2023-11-30 03:11:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:07,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768950691] [2023-11-30 03:11:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768950691] [2023-11-30 03:11:07,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768950691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:07,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:07,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:07,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259632989] [2023-11-30 03:11:07,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:07,603 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:07,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:07,604 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 201 [2023-11-30 03:11:07,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 202 transitions, 2029 flow. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:07,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:07,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 201 [2023-11-30 03:11:07,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:08,024 INFO L124 PetriNetUnfolderBase]: 951/1880 cut-off events. [2023-11-30 03:11:08,024 INFO L125 PetriNetUnfolderBase]: For 43398/44042 co-relation queries the response was YES. [2023-11-30 03:11:08,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14206 conditions, 1880 events. 951/1880 cut-off events. For 43398/44042 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10129 event pairs, 117 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 5693. Up to 1070 conditions per place. [2023-11-30 03:11:08,051 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 293 selfloop transitions, 4 changer transitions 5/413 dead transitions. [2023-11-30 03:11:08,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 413 transitions, 7289 flow [2023-11-30 03:11:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:11:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:11:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 935 transitions. [2023-11-30 03:11:08,055 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.775290215588723 [2023-11-30 03:11:08,055 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 935 transitions. [2023-11-30 03:11:08,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 935 transitions. [2023-11-30 03:11:08,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:08,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 935 transitions. [2023-11-30 03:11:08,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:08,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:08,062 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:08,062 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -10 predicate places. [2023-11-30 03:11:08,063 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 413 transitions, 7289 flow [2023-11-30 03:11:08,063 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:08,063 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:08,063 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 03:11:08,063 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:11:08,064 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:11:08,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1341625167, now seen corresponding path program 1 times [2023-11-30 03:11:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840361114] [2023-11-30 03:11:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840361114] [2023-11-30 03:11:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840361114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111578994] [2023-11-30 03:11:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:08,573 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:08,575 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 201 [2023-11-30 03:11:08,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 413 transitions, 7289 flow. Second operand has 6 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:08,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:08,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 201 [2023-11-30 03:11:08,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:09,018 INFO L124 PetriNetUnfolderBase]: 967/1900 cut-off events. [2023-11-30 03:11:09,018 INFO L125 PetriNetUnfolderBase]: For 42951/42951 co-relation queries the response was YES. [2023-11-30 03:11:09,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15947 conditions, 1900 events. 967/1900 cut-off events. For 42951/42951 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10213 event pairs, 129 based on Foata normal form. 0/1877 useless extension candidates. Maximal degree in co-relation 6323. Up to 1450 conditions per place. [2023-11-30 03:11:09,030 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 0 selfloop transitions, 0 changer transitions 452/452 dead transitions. [2023-11-30 03:11:09,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 452 transitions, 8921 flow [2023-11-30 03:11:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:11:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:11:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 914 transitions. [2023-11-30 03:11:09,033 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.75787728026534 [2023-11-30 03:11:09,033 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 914 transitions. [2023-11-30 03:11:09,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 914 transitions. [2023-11-30 03:11:09,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:09,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 914 transitions. [2023-11-30 03:11:09,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:09,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:09,038 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:09,038 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, -6 predicate places. [2023-11-30 03:11:09,038 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 452 transitions, 8921 flow [2023-11-30 03:11:09,039 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:09,045 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-2.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:11:09,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (58 of 59 remaining) [2023-11-30 03:11:09,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2023-11-30 03:11:09,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2023-11-30 03:11:09,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2023-11-30 03:11:09,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2023-11-30 03:11:09,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2023-11-30 03:11:09,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (52 of 59 remaining) [2023-11-30 03:11:09,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2023-11-30 03:11:09,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2023-11-30 03:11:09,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2023-11-30 03:11:09,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2023-11-30 03:11:09,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2023-11-30 03:11:09,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2023-11-30 03:11:09,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2023-11-30 03:11:09,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2023-11-30 03:11:09,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2023-11-30 03:11:09,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2023-11-30 03:11:09,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2023-11-30 03:11:09,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2023-11-30 03:11:09,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2023-11-30 03:11:09,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2023-11-30 03:11:09,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2023-11-30 03:11:09,082 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2023-11-30 03:11:09,082 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2023-11-30 03:11:09,082 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2023-11-30 03:11:09,082 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2023-11-30 03:11:09,082 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2023-11-30 03:11:09,082 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2023-11-30 03:11:09,082 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2023-11-30 03:11:09,083 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2023-11-30 03:11:09,083 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 59 remaining) [2023-11-30 03:11:09,083 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (27 of 59 remaining) [2023-11-30 03:11:09,083 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (26 of 59 remaining) [2023-11-30 03:11:09,083 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 59 remaining) [2023-11-30 03:11:09,083 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining) [2023-11-30 03:11:09,083 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining) [2023-11-30 03:11:09,084 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-11-30 03:11:09,084 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 59 remaining) [2023-11-30 03:11:09,084 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2023-11-30 03:11:09,084 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2023-11-30 03:11:09,084 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2023-11-30 03:11:09,084 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2023-11-30 03:11:09,084 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2023-11-30 03:11:09,085 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2023-11-30 03:11:09,086 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2023-11-30 03:11:09,087 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:11:09,087 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:09,091 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:11:09,091 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:11:09,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:11:09 BasicIcfg [2023-11-30 03:11:09,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:11:09,097 INFO L158 Benchmark]: Toolchain (without parser) took 4885.01ms. Allocated memory was 587.2MB in the beginning and 715.1MB in the end (delta: 127.9MB). Free memory was 533.8MB in the beginning and 448.1MB in the end (delta: 85.7MB). Peak memory consumption was 216.0MB. Max. memory is 16.0GB. [2023-11-30 03:11:09,097 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 385.9MB. Free memory is still 335.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:11:09,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.43ms. Allocated memory is still 587.2MB. Free memory was 533.4MB in the beginning and 522.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:11:09,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.73ms. Allocated memory is still 587.2MB. Free memory was 522.0MB in the beginning and 519.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:11:09,098 INFO L158 Benchmark]: Boogie Preprocessor took 24.08ms. Allocated memory is still 587.2MB. Free memory was 519.6MB in the beginning and 517.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:11:09,098 INFO L158 Benchmark]: RCFGBuilder took 675.91ms. Allocated memory is still 587.2MB. Free memory was 517.9MB in the beginning and 482.8MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-11-30 03:11:09,098 INFO L158 Benchmark]: TraceAbstraction took 3928.34ms. Allocated memory was 587.2MB in the beginning and 715.1MB in the end (delta: 127.9MB). Free memory was 482.2MB in the beginning and 448.1MB in the end (delta: 34.2MB). Peak memory consumption was 163.6MB. Max. memory is 16.0GB. [2023-11-30 03:11:09,099 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 385.9MB. Free memory is still 335.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 216.43ms. Allocated memory is still 587.2MB. Free memory was 533.4MB in the beginning and 522.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.73ms. Allocated memory is still 587.2MB. Free memory was 522.0MB in the beginning and 519.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.08ms. Allocated memory is still 587.2MB. Free memory was 519.6MB in the beginning and 517.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 675.91ms. Allocated memory is still 587.2MB. Free memory was 517.9MB in the beginning and 482.8MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 3928.34ms. Allocated memory was 587.2MB in the beginning and 715.1MB in the end (delta: 127.9MB). Free memory was 482.2MB in the beginning and 448.1MB in the end (delta: 34.2MB). Peak memory consumption was 163.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 237 locations, 59 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.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 74 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8921occurred in iteration=12, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 747 NumberOfCodeBlocks, 747 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 735 ConstructedInterpolants, 0 QuantifiedInterpolants, 917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:11:09,112 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...