/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/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:00:58,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:00:58,282 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:00:58,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:00:58,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:00:58,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:00:58,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:00:58,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:00:58,312 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:00:58,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:00:58,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:00:58,315 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:00:58,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:00:58,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:00:58,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:00:58,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:00:58,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:00:58,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:00:58,317 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:00:58,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:00:58,317 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:00:58,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:00:58,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:00:58,318 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:00:58,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:00:58,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:00:58,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:00:58,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:00:58,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:00:58,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:00:58,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:00:58,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:00:58,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:00:58,320 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:00:58,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:00:58,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:00:58,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:00:58,503 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:00:58,505 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:00:58,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2023-11-30 03:00:59,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:00:59,627 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:00:59,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2023-11-30 03:00:59,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a89d27a9/a6c8231ee226473ab175b4f144b610cf/FLAG3e9b14181 [2023-11-30 03:00:59,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a89d27a9/a6c8231ee226473ab175b4f144b610cf [2023-11-30 03:00:59,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:00:59,648 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:00:59,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:00:59,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:00:59,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:00:59,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c3508f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59, skipping insertion in model container [2023-11-30 03:00:59,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:00:59,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:00:59,798 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:00:59,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:00:59,825 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:00:59,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59 WrapperNode [2023-11-30 03:00:59,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:00:59,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:00:59,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:00:59,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:00:59,830 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:00:59" (1/1) ... [2023-11-30 03:00:59,835 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:00:59" (1/1) ... [2023-11-30 03:00:59,850 INFO L138 Inliner]: procedures = 19, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2023-11-30 03:00:59,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:00:59,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:00:59,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:00:59,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:00:59,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:00:59,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:00:59,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:00:59,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:00:59,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (1/1) ... [2023-11-30 03:00:59,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:00:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:00:59,915 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:00:59,917 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:00:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:00:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:00:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:00:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:00:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:00:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:00:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:00:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:00:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:00:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:00:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:00:59,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:00:59,938 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:01:00,043 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:01:00,044 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:01:00,316 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:01:00,330 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:01:00,330 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 03:01:00,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:00 BoogieIcfgContainer [2023-11-30 03:01:00,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:01:00,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:01:00,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:01:00,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:01:00,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:00:59" (1/3) ... [2023-11-30 03:01:00,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229f6eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:00, skipping insertion in model container [2023-11-30 03:01:00,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:00:59" (2/3) ... [2023-11-30 03:01:00,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229f6eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:00, skipping insertion in model container [2023-11-30 03:01:00,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:00" (3/3) ... [2023-11-30 03:01:00,337 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2023-11-30 03:01:00,349 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:01:00,349 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-30 03:01:00,349 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:01:00,403 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:01:00,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 286 transitions, 586 flow [2023-11-30 03:01:00,524 INFO L124 PetriNetUnfolderBase]: 12/284 cut-off events. [2023-11-30 03:01:00,524 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:01:00,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 284 events. 12/284 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 442 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 204. Up to 2 conditions per place. [2023-11-30 03:01:00,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 286 transitions, 586 flow [2023-11-30 03:01:00,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 263 transitions, 538 flow [2023-11-30 03:01:00,552 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:01:00,556 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;@6a615d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:01:00,556 INFO L363 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2023-11-30 03:01:00,560 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:01:00,561 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-30 03:01:00,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:01:00,561 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:00,561 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] [2023-11-30 03:01:00,562 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:00,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash -101003842, now seen corresponding path program 1 times [2023-11-30 03:01:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068831657] [2023-11-30 03:01:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:00,717 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:01:00,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:00,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068831657] [2023-11-30 03:01:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068831657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:00,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:00,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576567689] [2023-11-30 03:01:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:00,727 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:00,755 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 286 [2023-11-30 03:01:00,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 263 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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:01:00,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:00,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 286 [2023-11-30 03:01:00,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:00,884 INFO L124 PetriNetUnfolderBase]: 31/531 cut-off events. [2023-11-30 03:01:00,884 INFO L125 PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES. [2023-11-30 03:01:00,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 531 events. 31/531 cut-off events. For 29/38 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2303 event pairs, 15 based on Foata normal form. 21/441 useless extension candidates. Maximal degree in co-relation 382. Up to 52 conditions per place. [2023-11-30 03:01:00,894 INFO L140 encePairwiseOnDemand]: 278/286 looper letters, 13 selfloop transitions, 2 changer transitions 2/257 dead transitions. [2023-11-30 03:01:00,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 257 transitions, 556 flow [2023-11-30 03:01:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2023-11-30 03:01:00,910 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9405594405594405 [2023-11-30 03:01:00,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2023-11-30 03:01:00,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2023-11-30 03:01:00,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:00,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2023-11-30 03:01:00,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 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:01:00,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:00,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:00,931 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 1 predicate places. [2023-11-30 03:01:00,932 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 257 transitions, 556 flow [2023-11-30 03:01:00,933 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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:01:00,933 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:00,933 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:00,933 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:01:00,933 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:00,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1302245666, now seen corresponding path program 1 times [2023-11-30 03:01:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481432831] [2023-11-30 03:01:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:01,007 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:01:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481432831] [2023-11-30 03:01:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481432831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:01,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564500145] [2023-11-30 03:01:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:01,010 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:01,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:01,012 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 286 [2023-11-30 03:01:01,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 257 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 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:01:01,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:01,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 286 [2023-11-30 03:01:01,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:01,113 INFO L124 PetriNetUnfolderBase]: 49/617 cut-off events. [2023-11-30 03:01:01,114 INFO L125 PetriNetUnfolderBase]: For 118/136 co-relation queries the response was YES. [2023-11-30 03:01:01,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 617 events. 49/617 cut-off events. For 118/136 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3053 event pairs, 30 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 524. Up to 65 conditions per place. [2023-11-30 03:01:01,118 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 16 selfloop transitions, 2 changer transitions 2/256 dead transitions. [2023-11-30 03:01:01,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 256 transitions, 590 flow [2023-11-30 03:01:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions. [2023-11-30 03:01:01,120 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9277389277389277 [2023-11-30 03:01:01,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 796 transitions. [2023-11-30 03:01:01,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 796 transitions. [2023-11-30 03:01:01,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:01,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 796 transitions. [2023-11-30 03:01:01,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 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:01:01,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,125 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 2 predicate places. [2023-11-30 03:01:01,125 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 256 transitions, 590 flow [2023-11-30 03:01:01,126 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 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:01:01,126 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:01,126 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:01,127 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:01:01,127 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:01,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1402201007, now seen corresponding path program 1 times [2023-11-30 03:01:01,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:01,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593955167] [2023-11-30 03:01:01,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:01,193 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:01:01,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:01,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593955167] [2023-11-30 03:01:01,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593955167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:01,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:01,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507505471] [2023-11-30 03:01:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:01,196 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:01,198 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 286 [2023-11-30 03:01:01,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 256 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 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:01:01,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:01,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 286 [2023-11-30 03:01:01,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:01,309 INFO L124 PetriNetUnfolderBase]: 58/625 cut-off events. [2023-11-30 03:01:01,310 INFO L125 PetriNetUnfolderBase]: For 333/384 co-relation queries the response was YES. [2023-11-30 03:01:01,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 625 events. 58/625 cut-off events. For 333/384 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3136 event pairs, 39 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 612. Up to 74 conditions per place. [2023-11-30 03:01:01,316 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 28 selfloop transitions, 2 changer transitions 2/255 dead transitions. [2023-11-30 03:01:01,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 255 transitions, 648 flow [2023-11-30 03:01:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2023-11-30 03:01:01,322 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8997668997668997 [2023-11-30 03:01:01,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 772 transitions. [2023-11-30 03:01:01,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 772 transitions. [2023-11-30 03:01:01,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:01,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 772 transitions. [2023-11-30 03:01:01,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:01,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,377 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 3 predicate places. [2023-11-30 03:01:01,377 INFO L500 AbstractCegarLoop]: Abstraction has has 262 places, 255 transitions, 648 flow [2023-11-30 03:01:01,378 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 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:01:01,378 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:01,378 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:01,378 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:01:01,379 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:01,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:01,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1943611393, now seen corresponding path program 1 times [2023-11-30 03:01:01,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:01,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170506034] [2023-11-30 03:01:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:01,442 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:01:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170506034] [2023-11-30 03:01:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170506034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087259678] [2023-11-30 03:01:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:01,444 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:01,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:01,446 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 286 [2023-11-30 03:01:01,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 255 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:01,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:01,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 286 [2023-11-30 03:01:01,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:01,586 INFO L124 PetriNetUnfolderBase]: 70/628 cut-off events. [2023-11-30 03:01:01,586 INFO L125 PetriNetUnfolderBase]: For 873/1006 co-relation queries the response was YES. [2023-11-30 03:01:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 628 events. 70/628 cut-off events. For 873/1006 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3330 event pairs, 48 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 691. Up to 117 conditions per place. [2023-11-30 03:01:01,591 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 19 selfloop transitions, 2 changer transitions 2/254 dead transitions. [2023-11-30 03:01:01,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 254 transitions, 688 flow [2023-11-30 03:01:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2023-11-30 03:01:01,594 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9207459207459208 [2023-11-30 03:01:01,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:01,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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:01:01,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,598 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 4 predicate places. [2023-11-30 03:01:01,599 INFO L500 AbstractCegarLoop]: Abstraction has has 263 places, 254 transitions, 688 flow [2023-11-30 03:01:01,599 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:01,599 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:01,600 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:01,600 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:01:01,600 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:01,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash -883304562, now seen corresponding path program 1 times [2023-11-30 03:01:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500191834] [2023-11-30 03:01:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:01,636 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:01:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500191834] [2023-11-30 03:01:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500191834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382700977] [2023-11-30 03:01:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:01,637 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:01,639 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 286 [2023-11-30 03:01:01,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 254 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:01,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:01,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 286 [2023-11-30 03:01:01,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:01,765 INFO L124 PetriNetUnfolderBase]: 82/639 cut-off events. [2023-11-30 03:01:01,766 INFO L125 PetriNetUnfolderBase]: For 2420/2616 co-relation queries the response was YES. [2023-11-30 03:01:01,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 639 events. 82/639 cut-off events. For 2420/2616 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3483 event pairs, 60 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 839. Up to 129 conditions per place. [2023-11-30 03:01:01,771 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 19 selfloop transitions, 2 changer transitions 2/253 dead transitions. [2023-11-30 03:01:01,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 253 transitions, 728 flow [2023-11-30 03:01:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2023-11-30 03:01:01,773 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9207459207459208 [2023-11-30 03:01:01,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:01,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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:01:01,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,779 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 5 predicate places. [2023-11-30 03:01:01,780 INFO L500 AbstractCegarLoop]: Abstraction has has 264 places, 253 transitions, 728 flow [2023-11-30 03:01:01,780 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:01,780 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:01,781 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] [2023-11-30 03:01:01,781 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:01:01,781 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:01,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash 73213209, now seen corresponding path program 1 times [2023-11-30 03:01:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322700307] [2023-11-30 03:01:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:01,850 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:01:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:01,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322700307] [2023-11-30 03:01:01,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322700307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:01,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724490740] [2023-11-30 03:01:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:01,853 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:01,855 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 286 [2023-11-30 03:01:01,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 253 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:01,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:01,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 286 [2023-11-30 03:01:01,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:01,949 INFO L124 PetriNetUnfolderBase]: 88/644 cut-off events. [2023-11-30 03:01:01,949 INFO L125 PetriNetUnfolderBase]: For 3508/3704 co-relation queries the response was YES. [2023-11-30 03:01:01,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 644 events. 88/644 cut-off events. For 3508/3704 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3561 event pairs, 66 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 939. Up to 135 conditions per place. [2023-11-30 03:01:01,953 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 19 selfloop transitions, 2 changer transitions 2/252 dead transitions. [2023-11-30 03:01:01,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 252 transitions, 768 flow [2023-11-30 03:01:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2023-11-30 03:01:01,955 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9207459207459208 [2023-11-30 03:01:01,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:01,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2023-11-30 03:01:01,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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:01:01,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:01,961 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 6 predicate places. [2023-11-30 03:01:01,961 INFO L500 AbstractCegarLoop]: Abstraction has has 265 places, 252 transitions, 768 flow [2023-11-30 03:01:01,962 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:01,962 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:01,962 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] [2023-11-30 03:01:01,962 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:01:01,962 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:01,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash -537164511, now seen corresponding path program 1 times [2023-11-30 03:01:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85914535] [2023-11-30 03:01:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:02,006 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:01:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:02,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85914535] [2023-11-30 03:01:02,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85914535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:02,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:02,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711838660] [2023-11-30 03:01:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:02,010 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:02,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:02,011 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 286 [2023-11-30 03:01:02,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 252 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:02,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:02,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 286 [2023-11-30 03:01:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:02,104 INFO L124 PetriNetUnfolderBase]: 94/649 cut-off events. [2023-11-30 03:01:02,104 INFO L125 PetriNetUnfolderBase]: For 5441/5692 co-relation queries the response was YES. [2023-11-30 03:01:02,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 649 events. 94/649 cut-off events. For 5441/5692 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3668 event pairs, 72 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1006. Up to 141 conditions per place. [2023-11-30 03:01:02,109 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 18 selfloop transitions, 2 changer transitions 2/251 dead transitions. [2023-11-30 03:01:02,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 251 transitions, 806 flow [2023-11-30 03:01:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2023-11-30 03:01:02,111 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9195804195804196 [2023-11-30 03:01:02,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2023-11-30 03:01:02,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2023-11-30 03:01:02,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:02,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2023-11-30 03:01:02,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 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:01:02,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,115 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 7 predicate places. [2023-11-30 03:01:02,115 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 251 transitions, 806 flow [2023-11-30 03:01:02,116 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:01:02,116 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:02,116 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:01:02,116 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:01:02,117 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:02,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1081902481, now seen corresponding path program 1 times [2023-11-30 03:01:02,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:02,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447700192] [2023-11-30 03:01:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:02,167 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:01:02,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447700192] [2023-11-30 03:01:02,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447700192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:02,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:02,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:02,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981113676] [2023-11-30 03:01:02,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:02,168 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:02,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:02,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:02,170 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 286 [2023-11-30 03:01:02,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 251 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 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:01:02,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:02,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 286 [2023-11-30 03:01:02,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:02,296 INFO L124 PetriNetUnfolderBase]: 92/638 cut-off events. [2023-11-30 03:01:02,296 INFO L125 PetriNetUnfolderBase]: For 6183/6433 co-relation queries the response was YES. [2023-11-30 03:01:02,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 638 events. 92/638 cut-off events. For 6183/6433 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3585 event pairs, 67 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1031. Up to 139 conditions per place. [2023-11-30 03:01:02,300 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 20 selfloop transitions, 3 changer transitions 2/247 dead transitions. [2023-11-30 03:01:02,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 247 transitions, 851 flow [2023-11-30 03:01:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2023-11-30 03:01:02,302 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9114219114219114 [2023-11-30 03:01:02,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 782 transitions. [2023-11-30 03:01:02,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 782 transitions. [2023-11-30 03:01:02,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:02,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 782 transitions. [2023-11-30 03:01:02,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 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:01:02,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,306 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 3 predicate places. [2023-11-30 03:01:02,307 INFO L500 AbstractCegarLoop]: Abstraction has has 262 places, 247 transitions, 851 flow [2023-11-30 03:01:02,307 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 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:01:02,307 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:02,309 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:01:02,309 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:01:02,309 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:02,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash -326182469, now seen corresponding path program 1 times [2023-11-30 03:01:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071902654] [2023-11-30 03:01:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:02,351 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:01:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071902654] [2023-11-30 03:01:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071902654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:02,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:02,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634770996] [2023-11-30 03:01:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:02,352 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:02,353 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 286 [2023-11-30 03:01:02,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 247 transitions, 851 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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:01:02,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:02,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 286 [2023-11-30 03:01:02,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:02,436 INFO L124 PetriNetUnfolderBase]: 89/619 cut-off events. [2023-11-30 03:01:02,436 INFO L125 PetriNetUnfolderBase]: For 6290/6520 co-relation queries the response was YES. [2023-11-30 03:01:02,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 619 events. 89/619 cut-off events. For 6290/6520 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3450 event pairs, 62 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 1087. Up to 120 conditions per place. [2023-11-30 03:01:02,440 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 15 selfloop transitions, 3 changer transitions 2/246 dead transitions. [2023-11-30 03:01:02,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 246 transitions, 900 flow [2023-11-30 03:01:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2023-11-30 03:01:02,443 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9324009324009324 [2023-11-30 03:01:02,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2023-11-30 03:01:02,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2023-11-30 03:01:02,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:02,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2023-11-30 03:01:02,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 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:01:02,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,447 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 2 predicate places. [2023-11-30 03:01:02,447 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 246 transitions, 900 flow [2023-11-30 03:01:02,448 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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:01:02,448 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:02,448 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] [2023-11-30 03:01:02,448 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:01:02,448 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:02,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash -82520552, now seen corresponding path program 1 times [2023-11-30 03:01:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:02,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639365059] [2023-11-30 03:01:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:02,477 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:01:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:02,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639365059] [2023-11-30 03:01:02,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639365059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:02,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170183858] [2023-11-30 03:01:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:02,482 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:02,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:02,485 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 286 [2023-11-30 03:01:02,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 246 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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:01:02,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:02,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 286 [2023-11-30 03:01:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:02,618 INFO L124 PetriNetUnfolderBase]: 164/1069 cut-off events. [2023-11-30 03:01:02,619 INFO L125 PetriNetUnfolderBase]: For 14445/14905 co-relation queries the response was YES. [2023-11-30 03:01:02,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 1069 events. 164/1069 cut-off events. For 14445/14905 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7509 event pairs, 109 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 1115. Up to 221 conditions per place. [2023-11-30 03:01:02,627 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 21 selfloop transitions, 4 changer transitions 2/251 dead transitions. [2023-11-30 03:01:02,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 251 transitions, 1084 flow [2023-11-30 03:01:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2023-11-30 03:01:02,629 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9370629370629371 [2023-11-30 03:01:02,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 804 transitions. [2023-11-30 03:01:02,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 804 transitions. [2023-11-30 03:01:02,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:02,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 804 transitions. [2023-11-30 03:01:02,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 268.0) internal successors, (804), 3 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:01:02,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,632 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 1 predicate places. [2023-11-30 03:01:02,632 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 251 transitions, 1084 flow [2023-11-30 03:01:02,633 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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:01:02,633 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:02,633 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] [2023-11-30 03:01:02,633 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:01:02,633 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:02,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash -899332236, now seen corresponding path program 1 times [2023-11-30 03:01:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:02,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231374190] [2023-11-30 03:01:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:02,655 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:01:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231374190] [2023-11-30 03:01:02,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231374190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:02,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23509690] [2023-11-30 03:01:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:02,656 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:02,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:02,657 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 286 [2023-11-30 03:01:02,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 251 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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:01:02,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:02,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 286 [2023-11-30 03:01:02,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:02,837 INFO L124 PetriNetUnfolderBase]: 267/1607 cut-off events. [2023-11-30 03:01:02,837 INFO L125 PetriNetUnfolderBase]: For 22523/23231 co-relation queries the response was YES. [2023-11-30 03:01:02,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4828 conditions, 1607 events. 267/1607 cut-off events. For 22523/23231 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 13161 event pairs, 166 based on Foata normal form. 3/1329 useless extension candidates. Maximal degree in co-relation 1167. Up to 312 conditions per place. [2023-11-30 03:01:02,850 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 25 selfloop transitions, 3 changer transitions 12/260 dead transitions. [2023-11-30 03:01:02,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 260 transitions, 1398 flow [2023-11-30 03:01:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2023-11-30 03:01:02,852 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2023-11-30 03:01:02,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2023-11-30 03:01:02,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2023-11-30 03:01:02,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:02,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2023-11-30 03:01:02,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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:01:02,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:02,856 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 0 predicate places. [2023-11-30 03:01:02,856 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 260 transitions, 1398 flow [2023-11-30 03:01:02,856 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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:01:02,856 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:02,856 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] [2023-11-30 03:01:02,857 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:01:02,857 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:02,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:02,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1565747677, now seen corresponding path program 1 times [2023-11-30 03:01:02,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:02,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237546323] [2023-11-30 03:01:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:02,883 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:01:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237546323] [2023-11-30 03:01:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237546323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:02,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797052771] [2023-11-30 03:01:02,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:02,884 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:02,885 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 286 [2023-11-30 03:01:02,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 260 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 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:01:02,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:02,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 286 [2023-11-30 03:01:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:03,075 INFO L124 PetriNetUnfolderBase]: 249/1517 cut-off events. [2023-11-30 03:01:03,075 INFO L125 PetriNetUnfolderBase]: For 25181/25895 co-relation queries the response was YES. [2023-11-30 03:01:03,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 1517 events. 249/1517 cut-off events. For 25181/25895 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12201 event pairs, 152 based on Foata normal form. 2/1282 useless extension candidates. Maximal degree in co-relation 1131. Up to 304 conditions per place. [2023-11-30 03:01:03,089 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 25 selfloop transitions, 1 changer transitions 12/257 dead transitions. [2023-11-30 03:01:03,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 257 transitions, 1446 flow [2023-11-30 03:01:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2023-11-30 03:01:03,091 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9370629370629371 [2023-11-30 03:01:03,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 804 transitions. [2023-11-30 03:01:03,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 804 transitions. [2023-11-30 03:01:03,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:03,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 804 transitions. [2023-11-30 03:01:03,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 268.0) internal successors, (804), 3 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:01:03,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,095 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, -1 predicate places. [2023-11-30 03:01:03,095 INFO L500 AbstractCegarLoop]: Abstraction has has 258 places, 257 transitions, 1446 flow [2023-11-30 03:01:03,095 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 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:01:03,095 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:03,095 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] [2023-11-30 03:01:03,095 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:01:03,095 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:03,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash 378799634, now seen corresponding path program 1 times [2023-11-30 03:01:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441159806] [2023-11-30 03:01:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:03,121 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:01:03,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441159806] [2023-11-30 03:01:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441159806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788030090] [2023-11-30 03:01:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:03,122 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:03,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:03,124 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 286 [2023-11-30 03:01:03,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 257 transitions, 1446 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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:01:03,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:03,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 286 [2023-11-30 03:01:03,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:03,278 INFO L124 PetriNetUnfolderBase]: 221/1519 cut-off events. [2023-11-30 03:01:03,278 INFO L125 PetriNetUnfolderBase]: For 29873/31227 co-relation queries the response was YES. [2023-11-30 03:01:03,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4976 conditions, 1519 events. 221/1519 cut-off events. For 29873/31227 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 12290 event pairs, 118 based on Foata normal form. 1/1327 useless extension candidates. Maximal degree in co-relation 1141. Up to 278 conditions per place. [2023-11-30 03:01:03,289 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 28 selfloop transitions, 2 changer transitions 12/261 dead transitions. [2023-11-30 03:01:03,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 261 transitions, 1630 flow [2023-11-30 03:01:03,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2023-11-30 03:01:03,292 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9475524475524476 [2023-11-30 03:01:03,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 813 transitions. [2023-11-30 03:01:03,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 813 transitions. [2023-11-30 03:01:03,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:03,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 813 transitions. [2023-11-30 03:01:03,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 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:01:03,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,295 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, -1 predicate places. [2023-11-30 03:01:03,295 INFO L500 AbstractCegarLoop]: Abstraction has has 258 places, 261 transitions, 1630 flow [2023-11-30 03:01:03,296 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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:01:03,296 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:03,296 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] [2023-11-30 03:01:03,296 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:01:03,296 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:03,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1735245384, now seen corresponding path program 1 times [2023-11-30 03:01:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400609171] [2023-11-30 03:01:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:03,323 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:01:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400609171] [2023-11-30 03:01:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400609171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:03,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502262201] [2023-11-30 03:01:03,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:03,324 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:03,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:03,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:03,326 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 286 [2023-11-30 03:01:03,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 261 transitions, 1630 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 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:01:03,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:03,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 286 [2023-11-30 03:01:03,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:03,485 INFO L124 PetriNetUnfolderBase]: 225/1285 cut-off events. [2023-11-30 03:01:03,485 INFO L125 PetriNetUnfolderBase]: For 42679/44999 co-relation queries the response was YES. [2023-11-30 03:01:03,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4939 conditions, 1285 events. 225/1285 cut-off events. For 42679/44999 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9461 event pairs, 50 based on Foata normal form. 38/1184 useless extension candidates. Maximal degree in co-relation 1149. Up to 266 conditions per place. [2023-11-30 03:01:03,497 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 39 selfloop transitions, 2 changer transitions 12/264 dead transitions. [2023-11-30 03:01:03,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 264 transitions, 1840 flow [2023-11-30 03:01:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2023-11-30 03:01:03,499 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9265734265734266 [2023-11-30 03:01:03,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2023-11-30 03:01:03,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2023-11-30 03:01:03,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:03,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2023-11-30 03:01:03,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 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:01:03,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,513 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 0 predicate places. [2023-11-30 03:01:03,513 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 264 transitions, 1840 flow [2023-11-30 03:01:03,513 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 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:01:03,513 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:03,513 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] [2023-11-30 03:01:03,513 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:01:03,513 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:03,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 469524472, now seen corresponding path program 1 times [2023-11-30 03:01:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:03,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656187873] [2023-11-30 03:01:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:03,549 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:01:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656187873] [2023-11-30 03:01:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656187873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:03,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992566724] [2023-11-30 03:01:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:03,550 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:03,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:03,552 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 286 [2023-11-30 03:01:03,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 264 transitions, 1840 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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:01:03,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:03,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 286 [2023-11-30 03:01:03,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:03,847 INFO L124 PetriNetUnfolderBase]: 302/1947 cut-off events. [2023-11-30 03:01:03,848 INFO L125 PetriNetUnfolderBase]: For 50747/53473 co-relation queries the response was YES. [2023-11-30 03:01:03,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7222 conditions, 1947 events. 302/1947 cut-off events. For 50747/53473 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 16237 event pairs, 108 based on Foata normal form. 29/1757 useless extension candidates. Maximal degree in co-relation 1452. Up to 378 conditions per place. [2023-11-30 03:01:03,865 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 45 selfloop transitions, 3 changer transitions 16/277 dead transitions. [2023-11-30 03:01:03,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 277 transitions, 2408 flow [2023-11-30 03:01:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2023-11-30 03:01:03,868 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9335664335664335 [2023-11-30 03:01:03,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 801 transitions. [2023-11-30 03:01:03,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 801 transitions. [2023-11-30 03:01:03,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:03,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 801 transitions. [2023-11-30 03:01:03,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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:01:03,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:03,872 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 0 predicate places. [2023-11-30 03:01:03,872 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 277 transitions, 2408 flow [2023-11-30 03:01:03,872 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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:01:03,872 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:03,872 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:01:03,872 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:01:03,872 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:03,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1834215897, now seen corresponding path program 1 times [2023-11-30 03:01:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:03,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776548688] [2023-11-30 03:01:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:04,264 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:01:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776548688] [2023-11-30 03:01:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776548688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:04,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:04,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:01:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777210880] [2023-11-30 03:01:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:04,265 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:01:04,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:04,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:01:04,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:01:04,267 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 286 [2023-11-30 03:01:04,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 277 transitions, 2408 flow. Second operand has 6 states, 6 states have (on average 257.8333333333333) internal successors, (1547), 6 states have internal predecessors, (1547), 0 states have call successors, (0), 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:01:04,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:04,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 286 [2023-11-30 03:01:04,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:04,592 INFO L124 PetriNetUnfolderBase]: 298/1724 cut-off events. [2023-11-30 03:01:04,592 INFO L125 PetriNetUnfolderBase]: For 190333/200308 co-relation queries the response was YES. [2023-11-30 03:01:04,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7191 conditions, 1724 events. 298/1724 cut-off events. For 190333/200308 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13644 event pairs, 98 based on Foata normal form. 413/1959 useless extension candidates. Maximal degree in co-relation 1496. Up to 373 conditions per place. [2023-11-30 03:01:04,607 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 47 selfloop transitions, 4 changer transitions 16/276 dead transitions. [2023-11-30 03:01:04,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 276 transitions, 2524 flow [2023-11-30 03:01:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:01:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:01:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1556 transitions. [2023-11-30 03:01:04,610 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9067599067599068 [2023-11-30 03:01:04,610 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1556 transitions. [2023-11-30 03:01:04,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1556 transitions. [2023-11-30 03:01:04,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:04,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1556 transitions. [2023-11-30 03:01:04,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.3333333333333) internal successors, (1556), 6 states have internal predecessors, (1556), 0 states have call successors, (0), 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:01:04,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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:01:04,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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:01:04,617 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 4 predicate places. [2023-11-30 03:01:04,617 INFO L500 AbstractCegarLoop]: Abstraction has has 263 places, 276 transitions, 2524 flow [2023-11-30 03:01:04,618 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.8333333333333) internal successors, (1547), 6 states have internal predecessors, (1547), 0 states have call successors, (0), 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:01:04,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:04,618 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:04,618 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:01:04,618 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:04,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:04,619 INFO L85 PathProgramCache]: Analyzing trace with hash -258146586, now seen corresponding path program 1 times [2023-11-30 03:01:04,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:04,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534112465] [2023-11-30 03:01:04,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:04,652 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:01:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534112465] [2023-11-30 03:01:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534112465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:04,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:04,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41841263] [2023-11-30 03:01:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:04,653 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:04,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:04,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:04,654 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 286 [2023-11-30 03:01:04,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 276 transitions, 2524 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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:01:04,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:04,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 286 [2023-11-30 03:01:04,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:04,966 INFO L124 PetriNetUnfolderBase]: 306/1934 cut-off events. [2023-11-30 03:01:04,966 INFO L125 PetriNetUnfolderBase]: For 89837/94001 co-relation queries the response was YES. [2023-11-30 03:01:04,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7991 conditions, 1934 events. 306/1934 cut-off events. For 89837/94001 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 16120 event pairs, 103 based on Foata normal form. 31/1771 useless extension candidates. Maximal degree in co-relation 1592. Up to 382 conditions per place. [2023-11-30 03:01:04,986 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 49 selfloop transitions, 2 changer transitions 16/279 dead transitions. [2023-11-30 03:01:04,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 279 transitions, 2788 flow [2023-11-30 03:01:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-11-30 03:01:04,988 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.921911421911422 [2023-11-30 03:01:04,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-11-30 03:01:04,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-11-30 03:01:04,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:04,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-11-30 03:01:04,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 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:01:04,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:04,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:04,991 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 5 predicate places. [2023-11-30 03:01:04,992 INFO L500 AbstractCegarLoop]: Abstraction has has 264 places, 279 transitions, 2788 flow [2023-11-30 03:01:04,992 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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:01:04,992 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:04,992 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:04,992 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:01:04,992 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:04,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1959194118, now seen corresponding path program 1 times [2023-11-30 03:01:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234150306] [2023-11-30 03:01:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:05,023 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:01:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234150306] [2023-11-30 03:01:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234150306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:05,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135401275] [2023-11-30 03:01:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:05,025 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:05,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:05,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:05,026 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 286 [2023-11-30 03:01:05,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 279 transitions, 2788 flow. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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:01:05,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:05,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 286 [2023-11-30 03:01:05,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:05,307 INFO L124 PetriNetUnfolderBase]: 306/1645 cut-off events. [2023-11-30 03:01:05,308 INFO L125 PetriNetUnfolderBase]: For 117949/122145 co-relation queries the response was YES. [2023-11-30 03:01:05,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7829 conditions, 1645 events. 306/1645 cut-off events. For 117949/122145 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12764 event pairs, 84 based on Foata normal form. 32/1536 useless extension candidates. Maximal degree in co-relation 1626. Up to 380 conditions per place. [2023-11-30 03:01:05,327 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 61 selfloop transitions, 2 changer transitions 16/282 dead transitions. [2023-11-30 03:01:05,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 282 transitions, 3080 flow [2023-11-30 03:01:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2023-11-30 03:01:05,329 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8986013986013986 [2023-11-30 03:01:05,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 771 transitions. [2023-11-30 03:01:05,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 771 transitions. [2023-11-30 03:01:05,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:05,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 771 transitions. [2023-11-30 03:01:05,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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:01:05,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:05,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:05,332 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 6 predicate places. [2023-11-30 03:01:05,332 INFO L500 AbstractCegarLoop]: Abstraction has has 265 places, 282 transitions, 3080 flow [2023-11-30 03:01:05,332 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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:01:05,332 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:05,332 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:05,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:01:05,333 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:05,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1207813852, now seen corresponding path program 1 times [2023-11-30 03:01:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480408573] [2023-11-30 03:01:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:05,364 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:01:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480408573] [2023-11-30 03:01:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480408573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:05,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:05,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262151048] [2023-11-30 03:01:05,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:05,365 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:05,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:05,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:05,366 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 286 [2023-11-30 03:01:05,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 282 transitions, 3080 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 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:01:05,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:05,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 286 [2023-11-30 03:01:05,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:05,614 INFO L124 PetriNetUnfolderBase]: 308/1643 cut-off events. [2023-11-30 03:01:05,615 INFO L125 PetriNetUnfolderBase]: For 134170/138366 co-relation queries the response was YES. [2023-11-30 03:01:05,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8134 conditions, 1643 events. 308/1643 cut-off events. For 134170/138366 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12691 event pairs, 84 based on Foata normal form. 32/1538 useless extension candidates. Maximal degree in co-relation 1669. Up to 382 conditions per place. [2023-11-30 03:01:05,630 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 55 selfloop transitions, 2 changer transitions 16/283 dead transitions. [2023-11-30 03:01:05,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 283 transitions, 3292 flow [2023-11-30 03:01:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2023-11-30 03:01:05,632 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2023-11-30 03:01:05,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2023-11-30 03:01:05,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2023-11-30 03:01:05,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:05,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2023-11-30 03:01:05,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 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:01:05,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:05,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:05,635 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 7 predicate places. [2023-11-30 03:01:05,635 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 283 transitions, 3292 flow [2023-11-30 03:01:05,636 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 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:01:05,636 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:05,636 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:05,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:01:05,636 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:05,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 453433547, now seen corresponding path program 1 times [2023-11-30 03:01:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460264483] [2023-11-30 03:01:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:05,664 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:01:05,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460264483] [2023-11-30 03:01:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460264483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:05,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:05,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21013972] [2023-11-30 03:01:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:05,666 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:05,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:05,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:05,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:05,667 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 286 [2023-11-30 03:01:05,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 283 transitions, 3292 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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:01:05,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:05,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 286 [2023-11-30 03:01:05,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:05,940 INFO L124 PetriNetUnfolderBase]: 312/1727 cut-off events. [2023-11-30 03:01:05,941 INFO L125 PetriNetUnfolderBase]: For 147016/151808 co-relation queries the response was YES. [2023-11-30 03:01:05,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8761 conditions, 1727 events. 312/1727 cut-off events. For 147016/151808 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 13761 event pairs, 94 based on Foata normal form. 32/1626 useless extension candidates. Maximal degree in co-relation 1884. Up to 375 conditions per place. [2023-11-30 03:01:05,955 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 61 selfloop transitions, 2 changer transitions 16/286 dead transitions. [2023-11-30 03:01:05,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 286 transitions, 3600 flow [2023-11-30 03:01:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2023-11-30 03:01:05,957 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2023-11-30 03:01:05,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2023-11-30 03:01:05,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2023-11-30 03:01:05,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:05,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2023-11-30 03:01:05,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 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:01:05,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:05,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:05,961 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 8 predicate places. [2023-11-30 03:01:05,961 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 286 transitions, 3600 flow [2023-11-30 03:01:05,962 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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:01:05,962 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:05,962 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:05,962 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 03:01:05,962 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:05,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:05,962 INFO L85 PathProgramCache]: Analyzing trace with hash -561540306, now seen corresponding path program 1 times [2023-11-30 03:01:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:05,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992371485] [2023-11-30 03:01:05,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:06,373 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:01:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992371485] [2023-11-30 03:01:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992371485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:01:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200116557] [2023-11-30 03:01:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:06,374 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:01:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:01:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:01:06,375 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 286 [2023-11-30 03:01:06,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 286 transitions, 3600 flow. Second operand has 6 states, 6 states have (on average 258.8333333333333) internal successors, (1553), 6 states have internal predecessors, (1553), 0 states have call successors, (0), 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:01:06,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:06,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 286 [2023-11-30 03:01:06,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:06,655 INFO L124 PetriNetUnfolderBase]: 316/1887 cut-off events. [2023-11-30 03:01:06,655 INFO L125 PetriNetUnfolderBase]: For 166338/172504 co-relation queries the response was YES. [2023-11-30 03:01:06,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9511 conditions, 1887 events. 316/1887 cut-off events. For 166338/172504 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15532 event pairs, 106 based on Foata normal form. 33/1783 useless extension candidates. Maximal degree in co-relation 1967. Up to 374 conditions per place. [2023-11-30 03:01:06,669 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 38 selfloop transitions, 0 changer transitions 43/285 dead transitions. [2023-11-30 03:01:06,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 285 transitions, 3740 flow [2023-11-30 03:01:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:01:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:01:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1555 transitions. [2023-11-30 03:01:06,672 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9061771561771562 [2023-11-30 03:01:06,672 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1555 transitions. [2023-11-30 03:01:06,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1555 transitions. [2023-11-30 03:01:06,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:06,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1555 transitions. [2023-11-30 03:01:06,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.1666666666667) internal successors, (1555), 6 states have internal predecessors, (1555), 0 states have call successors, (0), 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:01:06,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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:01:06,676 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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:01:06,677 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 12 predicate places. [2023-11-30 03:01:06,677 INFO L500 AbstractCegarLoop]: Abstraction has has 271 places, 285 transitions, 3740 flow [2023-11-30 03:01:06,677 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.8333333333333) internal successors, (1553), 6 states have internal predecessors, (1553), 0 states have call successors, (0), 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:01:06,677 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:06,677 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:06,677 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 03:01:06,678 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:01:06,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1936622972, now seen corresponding path program 1 times [2023-11-30 03:01:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:06,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620801139] [2023-11-30 03:01:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:06,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:06,700 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:01:06,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:06,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620801139] [2023-11-30 03:01:06,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620801139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534213330] [2023-11-30 03:01:06,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:06,701 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:06,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:06,702 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 286 [2023-11-30 03:01:06,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 285 transitions, 3740 flow. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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:01:06,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:06,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 286 [2023-11-30 03:01:06,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:06,957 INFO L124 PetriNetUnfolderBase]: 316/1713 cut-off events. [2023-11-30 03:01:06,957 INFO L125 PetriNetUnfolderBase]: For 204974/215104 co-relation queries the response was YES. [2023-11-30 03:01:06,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9398 conditions, 1713 events. 316/1713 cut-off events. For 204974/215104 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13403 event pairs, 91 based on Foata normal form. 35/1633 useless extension candidates. Maximal degree in co-relation 1906. Up to 382 conditions per place. [2023-11-30 03:01:06,965 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 0 selfloop transitions, 0 changer transitions 286/286 dead transitions. [2023-11-30 03:01:06,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 286 transitions, 3972 flow [2023-11-30 03:01:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2023-11-30 03:01:06,967 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2023-11-30 03:01:06,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2023-11-30 03:01:06,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2023-11-30 03:01:06,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:06,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2023-11-30 03:01:06,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 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:01:06,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:06,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:01:06,969 INFO L307 CegarLoopForPetriNet]: 259 programPoint places, 13 predicate places. [2023-11-30 03:01:06,969 INFO L500 AbstractCegarLoop]: Abstraction has has 272 places, 286 transitions, 3972 flow [2023-11-30 03:01:06,970 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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:01:06,978 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/clever.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:01:07,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 57 remaining) [2023-11-30 03:01:07,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 57 remaining) [2023-11-30 03:01:07,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (54 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (53 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (52 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (49 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (46 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (45 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (44 of 57 remaining) [2023-11-30 03:01:07,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (43 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (42 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (40 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (39 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (32 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 57 remaining) [2023-11-30 03:01:07,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (27 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (26 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (25 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (24 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (23 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (22 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (21 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (20 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 57 remaining) [2023-11-30 03:01:07,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (13 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (10 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (9 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (8 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (7 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 57 remaining) [2023-11-30 03:01:07,024 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 57 remaining) [2023-11-30 03:01:07,025 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 57 remaining) [2023-11-30 03:01:07,025 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 57 remaining) [2023-11-30 03:01:07,025 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 57 remaining) [2023-11-30 03:01:07,025 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 57 remaining) [2023-11-30 03:01:07,025 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 03:01:07,025 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:07,029 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:01:07,029 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:01:07,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:01:07 BasicIcfg [2023-11-30 03:01:07,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:01:07,034 INFO L158 Benchmark]: Toolchain (without parser) took 7386.43ms. Allocated memory was 364.9MB in the beginning and 939.5MB in the end (delta: 574.6MB). Free memory was 312.9MB in the beginning and 797.9MB in the end (delta: -485.1MB). Peak memory consumption was 569.8MB. Max. memory is 16.0GB. [2023-11-30 03:01:07,034 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 316.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:01:07,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.53ms. Allocated memory is still 364.9MB. Free memory was 312.9MB in the beginning and 301.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:01:07,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.71ms. Allocated memory is still 364.9MB. Free memory was 301.3MB in the beginning and 299.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:01:07,034 INFO L158 Benchmark]: Boogie Preprocessor took 25.23ms. Allocated memory is still 364.9MB. Free memory was 299.2MB in the beginning and 297.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:01:07,035 INFO L158 Benchmark]: RCFGBuilder took 451.02ms. Allocated memory is still 364.9MB. Free memory was 297.1MB in the beginning and 274.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 03:01:07,035 INFO L158 Benchmark]: TraceAbstraction took 6700.90ms. Allocated memory was 364.9MB in the beginning and 939.5MB in the end (delta: 574.6MB). Free memory was 274.1MB in the beginning and 797.9MB in the end (delta: -523.9MB). Peak memory consumption was 529.9MB. Max. memory is 16.0GB. [2023-11-30 03:01:07,036 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.11ms. Allocated memory is still 364.9MB. Free memory is still 316.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 175.53ms. Allocated memory is still 364.9MB. Free memory was 312.9MB in the beginning and 301.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.71ms. Allocated memory is still 364.9MB. Free memory was 301.3MB in the beginning and 299.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.23ms. Allocated memory is still 364.9MB. Free memory was 299.2MB in the beginning and 297.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 451.02ms. Allocated memory is still 364.9MB. Free memory was 297.1MB in the beginning and 274.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 6700.90ms. Allocated memory was 364.9MB in the beginning and 939.5MB in the end (delta: 574.6MB). Free memory was 274.1MB in the beginning and 797.9MB in the end (delta: -523.9MB). Peak memory consumption was 529.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: 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: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 368 locations, 57 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: 6.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 451 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 260 mSDtfsCounter, 451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3972occurred in iteration=22, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1948 NumberOfCodeBlocks, 1948 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1926 ConstructedInterpolants, 0 QuantifiedInterpolants, 2128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 37 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:01:07,051 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...