/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/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 00:41:24,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 00:41:24,821 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 00:41:24,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 00:41:24,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 00:41:24,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 00:41:24,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 00:41:24,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 00:41:24,853 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 00:41:24,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 00:41:24,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 00:41:24,856 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 00:41:24,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 00:41:24,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 00:41:24,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 00:41:24,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 00:41:24,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 00:41:24,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 00:41:24,858 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 00:41:24,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 00:41:24,858 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 00:41:24,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 00:41:24,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 00:41:24,859 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 00:41:24,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 00:41:24,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:41:24,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 00:41:24,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 00:41:24,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 00:41:24,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 00:41:24,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 00:41:24,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 00:41:24,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 00:41:24,861 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 00:41:25,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 00:41:25,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 00:41:25,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 00:41:25,081 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 00:41:25,081 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 00:41:25,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-11-30 00:41:26,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 00:41:26,300 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 00:41:26,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-11-30 00:41:26,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe51c065/fc1fdd3e2ec24765ac6cbe6e36a44f9b/FLAG462ee45fe [2023-11-30 00:41:26,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe51c065/fc1fdd3e2ec24765ac6cbe6e36a44f9b [2023-11-30 00:41:26,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 00:41:26,336 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 00:41:26,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 00:41:26,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 00:41:26,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 00:41:26,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e2c2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26, skipping insertion in model container [2023-11-30 00:41:26,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,377 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 00:41:26,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:41:26,647 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 00:41:26,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:41:26,718 INFO L206 MainTranslator]: Completed translation [2023-11-30 00:41:26,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26 WrapperNode [2023-11-30 00:41:26,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 00:41:26,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 00:41:26,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 00:41:26,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 00:41:26,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,759 INFO L138 Inliner]: procedures = 165, calls = 21, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 95 [2023-11-30 00:41:26,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 00:41:26,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 00:41:26,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 00:41:26,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 00:41:26,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 00:41:26,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 00:41:26,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 00:41:26,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 00:41:26,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (1/1) ... [2023-11-30 00:41:26,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:41:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 00:41:26,801 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 00:41:26,808 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 00:41:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 00:41:26,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 00:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 00:41:26,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 00:41:26,837 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 00:41:26,931 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 00:41:26,932 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 00:41:27,053 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 00:41:27,070 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 00:41:27,070 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-30 00:41:27,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:41:27 BoogieIcfgContainer [2023-11-30 00:41:27,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 00:41:27,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 00:41:27,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 00:41:27,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 00:41:27,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:41:26" (1/3) ... [2023-11-30 00:41:27,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12819f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:41:27, skipping insertion in model container [2023-11-30 00:41:27,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:41:26" (2/3) ... [2023-11-30 00:41:27,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12819f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:41:27, skipping insertion in model container [2023-11-30 00:41:27,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:41:27" (3/3) ... [2023-11-30 00:41:27,077 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2023-11-30 00:41:27,089 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 00:41:27,089 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-30 00:41:27,089 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 00:41:27,122 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:41:27,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 105 transitions, 214 flow [2023-11-30 00:41:27,187 INFO L124 PetriNetUnfolderBase]: 8/158 cut-off events. [2023-11-30 00:41:27,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:41:27,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 8/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 384 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2023-11-30 00:41:27,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 105 transitions, 214 flow [2023-11-30 00:41:27,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 105 transitions, 214 flow [2023-11-30 00:41:27,202 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:41:27,206 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;@416cc382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:41:27,207 INFO L363 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-30 00:41:27,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:41:27,214 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 00:41:27,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:41:27,215 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:27,215 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] [2023-11-30 00:41:27,215 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 00:41:27,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1866201768, now seen corresponding path program 1 times [2023-11-30 00:41:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829071296] [2023-11-30 00:41:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:27,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 00:41:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829071296] [2023-11-30 00:41:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829071296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:27,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901670954] [2023-11-30 00:41:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:27,359 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:41:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:41:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:41:27,381 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105 [2023-11-30 00:41:27,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 105 transitions, 214 flow. Second operand has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:27,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105 [2023-11-30 00:41:27,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:27,421 INFO L124 PetriNetUnfolderBase]: 4/195 cut-off events. [2023-11-30 00:41:27,421 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:41:27,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 195 events. 4/195 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 558 event pairs, 4 based on Foata normal form. 15/186 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place. [2023-11-30 00:41:27,423 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 5 selfloop transitions, 0 changer transitions 0/94 dead transitions. [2023-11-30 00:41:27,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 202 flow [2023-11-30 00:41:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:41:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:41:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions. [2023-11-30 00:41:27,432 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-11-30 00:41:27,432 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 196 transitions. [2023-11-30 00:41:27,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 196 transitions. [2023-11-30 00:41:27,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:27,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 196 transitions. [2023-11-30 00:41:27,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,439 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,442 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, -5 predicate places. [2023-11-30 00:41:27,442 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 202 flow [2023-11-30 00:41:27,442 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,442 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:27,442 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 00:41:27,442 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 00:41:27,443 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 00:41:27,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1524195953, now seen corresponding path program 1 times [2023-11-30 00:41:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958863199] [2023-11-30 00:41:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:27,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:27,497 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 00:41:27,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958863199] [2023-11-30 00:41:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958863199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:27,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:27,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:27,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216328210] [2023-11-30 00:41:27,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:27,499 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:27,500 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 105 [2023-11-30 00:41:27,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:27,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 105 [2023-11-30 00:41:27,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:27,618 INFO L124 PetriNetUnfolderBase]: 181/761 cut-off events. [2023-11-30 00:41:27,618 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-30 00:41:27,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 761 events. 181/761 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4493 event pairs, 139 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 1143. Up to 354 conditions per place. [2023-11-30 00:41:27,625 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 34 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2023-11-30 00:41:27,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 312 flow [2023-11-30 00:41:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2023-11-30 00:41:27,631 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8063492063492064 [2023-11-30 00:41:27,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 254 transitions. [2023-11-30 00:41:27,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 254 transitions. [2023-11-30 00:41:27,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:27,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 254 transitions. [2023-11-30 00:41:27,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,637 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, -3 predicate places. [2023-11-30 00:41:27,638 INFO L500 AbstractCegarLoop]: Abstraction has has 100 places, 107 transitions, 312 flow [2023-11-30 00:41:27,638 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,638 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:27,639 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:41:27,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 00:41:27,639 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 00:41:27,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:27,639 INFO L85 PathProgramCache]: Analyzing trace with hash 293414073, now seen corresponding path program 1 times [2023-11-30 00:41:27,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:27,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292155243] [2023-11-30 00:41:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:27,719 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 00:41:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292155243] [2023-11-30 00:41:27,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292155243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:27,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:27,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297729911] [2023-11-30 00:41:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:27,720 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:27,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:27,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:27,722 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2023-11-30 00:41:27,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 107 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:27,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2023-11-30 00:41:27,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:27,824 INFO L124 PetriNetUnfolderBase]: 215/843 cut-off events. [2023-11-30 00:41:27,824 INFO L125 PetriNetUnfolderBase]: For 180/218 co-relation queries the response was YES. [2023-11-30 00:41:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 843 events. 215/843 cut-off events. For 180/218 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4989 event pairs, 135 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 1679. Up to 390 conditions per place. [2023-11-30 00:41:27,829 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 44 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2023-11-30 00:41:27,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 122 transitions, 478 flow [2023-11-30 00:41:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-11-30 00:41:27,832 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.819047619047619 [2023-11-30 00:41:27,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-11-30 00:41:27,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-11-30 00:41:27,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:27,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-11-30 00:41:27,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,835 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places. [2023-11-30 00:41:27,836 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 122 transitions, 478 flow [2023-11-30 00:41:27,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,836 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:27,836 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:41:27,836 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 00:41:27,836 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 00:41:27,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 927636466, now seen corresponding path program 1 times [2023-11-30 00:41:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049830450] [2023-11-30 00:41:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:27,917 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 00:41:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:27,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049830450] [2023-11-30 00:41:27,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049830450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:27,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:27,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428364836] [2023-11-30 00:41:27,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:27,919 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:27,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:27,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:27,920 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2023-11-30 00:41:27,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 122 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:27,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:27,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2023-11-30 00:41:27,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:28,038 INFO L124 PetriNetUnfolderBase]: 221/912 cut-off events. [2023-11-30 00:41:28,038 INFO L125 PetriNetUnfolderBase]: For 455/551 co-relation queries the response was YES. [2023-11-30 00:41:28,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 912 events. 221/912 cut-off events. For 455/551 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5766 event pairs, 95 based on Foata normal form. 2/790 useless extension candidates. Maximal degree in co-relation 2177. Up to 409 conditions per place. [2023-11-30 00:41:28,043 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 61 selfloop transitions, 14 changer transitions 0/148 dead transitions. [2023-11-30 00:41:28,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 148 transitions, 792 flow [2023-11-30 00:41:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2023-11-30 00:41:28,044 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2023-11-30 00:41:28,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2023-11-30 00:41:28,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2023-11-30 00:41:28,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:28,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2023-11-30 00:41:28,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,048 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2023-11-30 00:41:28,048 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 148 transitions, 792 flow [2023-11-30 00:41:28,048 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,048 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:28,048 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:41:28,049 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 00:41:28,049 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 00:41:28,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 130408571, now seen corresponding path program 1 times [2023-11-30 00:41:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:28,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205797349] [2023-11-30 00:41:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:41:28,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:41:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:41:28,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:41:28,111 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:41:28,112 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-30 00:41:28,113 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-30 00:41:28,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-30 00:41:28,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-30 00:41:28,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-30 00:41:28,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-30 00:41:28,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-30 00:41:28,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-30 00:41:28,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-30 00:41:28,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-30 00:41:28,115 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 00:41:28,116 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 00:41:28,117 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:41:28,118 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 00:41:28,149 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:41:28,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 137 transitions, 284 flow [2023-11-30 00:41:28,176 INFO L124 PetriNetUnfolderBase]: 13/245 cut-off events. [2023-11-30 00:41:28,176 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 00:41:28,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 245 events. 13/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 802 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 159. Up to 6 conditions per place. [2023-11-30 00:41:28,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 137 transitions, 284 flow [2023-11-30 00:41:28,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 137 transitions, 284 flow [2023-11-30 00:41:28,186 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:41:28,190 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;@416cc382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:41:28,190 INFO L363 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-30 00:41:28,195 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:41:28,195 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 00:41:28,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:41:28,195 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:28,195 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] [2023-11-30 00:41:28,195 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:28,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1881723496, now seen corresponding path program 1 times [2023-11-30 00:41:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:28,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181481443] [2023-11-30 00:41:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:28,225 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 00:41:28,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181481443] [2023-11-30 00:41:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181481443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911611928] [2023-11-30 00:41:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:28,226 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:41:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:28,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:41:28,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:41:28,227 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 137 [2023-11-30 00:41:28,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 137 transitions, 284 flow. Second operand has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:28,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 137 [2023-11-30 00:41:28,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:28,288 INFO L124 PetriNetUnfolderBase]: 34/576 cut-off events. [2023-11-30 00:41:28,288 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-30 00:41:28,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 576 events. 34/576 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3237 event pairs, 34 based on Foata normal form. 65/554 useless extension candidates. Maximal degree in co-relation 433. Up to 73 conditions per place. [2023-11-30 00:41:28,291 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 8 selfloop transitions, 0 changer transitions 0/121 dead transitions. [2023-11-30 00:41:28,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 268 flow [2023-11-30 00:41:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:41:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:41:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-11-30 00:41:28,292 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9233576642335767 [2023-11-30 00:41:28,292 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-11-30 00:41:28,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-11-30 00:41:28,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:28,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-11-30 00:41:28,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,294 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,297 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, -8 predicate places. [2023-11-30 00:41:28,297 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 121 transitions, 268 flow [2023-11-30 00:41:28,297 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,297 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:28,297 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 00:41:28,297 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 00:41:28,297 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:28,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 75662874, now seen corresponding path program 1 times [2023-11-30 00:41:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:28,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73636601] [2023-11-30 00:41:28,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:28,369 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 00:41:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73636601] [2023-11-30 00:41:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73636601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599714572] [2023-11-30 00:41:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:28,371 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:28,372 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 137 [2023-11-30 00:41:28,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:28,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:28,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 137 [2023-11-30 00:41:28,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:29,192 INFO L124 PetriNetUnfolderBase]: 4777/10888 cut-off events. [2023-11-30 00:41:29,193 INFO L125 PetriNetUnfolderBase]: For 1152/1157 co-relation queries the response was YES. [2023-11-30 00:41:29,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19724 conditions, 10888 events. 4777/10888 cut-off events. For 1152/1157 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 99545 event pairs, 3897 based on Foata normal form. 0/8660 useless extension candidates. Maximal degree in co-relation 18420. Up to 6718 conditions per place. [2023-11-30 00:41:29,262 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 54 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-11-30 00:41:29,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 145 transitions, 450 flow [2023-11-30 00:41:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-11-30 00:41:29,265 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7980535279805353 [2023-11-30 00:41:29,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-11-30 00:41:29,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-11-30 00:41:29,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:29,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-11-30 00:41:29,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:29,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:29,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:29,268 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, -6 predicate places. [2023-11-30 00:41:29,268 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 145 transitions, 450 flow [2023-11-30 00:41:29,268 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:29,268 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:29,269 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] [2023-11-30 00:41:29,269 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 00:41:29,269 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:29,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash -808995271, now seen corresponding path program 1 times [2023-11-30 00:41:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546860564] [2023-11-30 00:41:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:29,305 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 00:41:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546860564] [2023-11-30 00:41:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546860564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511336050] [2023-11-30 00:41:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:29,306 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:29,308 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 137 [2023-11-30 00:41:29,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 145 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:29,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:29,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 137 [2023-11-30 00:41:29,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:30,467 INFO L124 PetriNetUnfolderBase]: 6285/13643 cut-off events. [2023-11-30 00:41:30,467 INFO L125 PetriNetUnfolderBase]: For 3100/4402 co-relation queries the response was YES. [2023-11-30 00:41:30,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33341 conditions, 13643 events. 6285/13643 cut-off events. For 3100/4402 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 124787 event pairs, 3904 based on Foata normal form. 5/10955 useless extension candidates. Maximal degree in co-relation 21222. Up to 8228 conditions per place. [2023-11-30 00:41:30,657 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 84 selfloop transitions, 14 changer transitions 0/183 dead transitions. [2023-11-30 00:41:30,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 183 transitions, 815 flow [2023-11-30 00:41:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-11-30 00:41:30,673 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8102189781021898 [2023-11-30 00:41:30,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-11-30 00:41:30,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-11-30 00:41:30,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:30,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-11-30 00:41:30,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:30,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:30,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:30,677 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, -4 predicate places. [2023-11-30 00:41:30,677 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 183 transitions, 815 flow [2023-11-30 00:41:30,677 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:30,677 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:30,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] [2023-11-30 00:41:30,677 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 00:41:30,677 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:30,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash -784761070, now seen corresponding path program 1 times [2023-11-30 00:41:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385979367] [2023-11-30 00:41:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:30,734 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 00:41:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385979367] [2023-11-30 00:41:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385979367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:30,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80545814] [2023-11-30 00:41:30,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:30,741 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:30,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:30,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:30,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:30,743 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 137 [2023-11-30 00:41:30,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 183 transitions, 815 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:30,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:30,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 137 [2023-11-30 00:41:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:32,058 INFO L124 PetriNetUnfolderBase]: 7533/17916 cut-off events. [2023-11-30 00:41:32,059 INFO L125 PetriNetUnfolderBase]: For 8437/13574 co-relation queries the response was YES. [2023-11-30 00:41:32,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51828 conditions, 17916 events. 7533/17916 cut-off events. For 8437/13574 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 183252 event pairs, 2870 based on Foata normal form. 36/14774 useless extension candidates. Maximal degree in co-relation 33995. Up to 10074 conditions per place. [2023-11-30 00:41:32,186 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 141 selfloop transitions, 31 changer transitions 0/260 dead transitions. [2023-11-30 00:41:32,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 260 transitions, 1656 flow [2023-11-30 00:41:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-11-30 00:41:32,188 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8394160583941606 [2023-11-30 00:41:32,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-11-30 00:41:32,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-11-30 00:41:32,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:32,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-11-30 00:41:32,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:32,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:32,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:32,190 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, -2 predicate places. [2023-11-30 00:41:32,190 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 260 transitions, 1656 flow [2023-11-30 00:41:32,190 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:32,190 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:32,190 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 00:41:32,190 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 00:41:32,191 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:32,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash -147005306, now seen corresponding path program 1 times [2023-11-30 00:41:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818216882] [2023-11-30 00:41:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:32,214 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 00:41:32,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:32,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818216882] [2023-11-30 00:41:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818216882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469382157] [2023-11-30 00:41:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:32,216 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:32,216 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 137 [2023-11-30 00:41:32,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 260 transitions, 1656 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:32,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:32,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 137 [2023-11-30 00:41:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:33,900 INFO L124 PetriNetUnfolderBase]: 9131/20990 cut-off events. [2023-11-30 00:41:33,900 INFO L125 PetriNetUnfolderBase]: For 17619/28044 co-relation queries the response was YES. [2023-11-30 00:41:33,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73067 conditions, 20990 events. 9131/20990 cut-off events. For 17619/28044 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 213935 event pairs, 3052 based on Foata normal form. 80/17526 useless extension candidates. Maximal degree in co-relation 69955. Up to 11671 conditions per place. [2023-11-30 00:41:34,068 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 213 selfloop transitions, 25 changer transitions 0/322 dead transitions. [2023-11-30 00:41:34,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 322 transitions, 2642 flow [2023-11-30 00:41:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-11-30 00:41:34,070 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7980535279805353 [2023-11-30 00:41:34,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-11-30 00:41:34,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-11-30 00:41:34,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:34,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-11-30 00:41:34,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:34,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:34,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:34,073 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2023-11-30 00:41:34,073 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 322 transitions, 2642 flow [2023-11-30 00:41:34,073 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:34,073 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:34,073 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] [2023-11-30 00:41:34,073 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 00:41:34,074 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:34,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash -559176797, now seen corresponding path program 1 times [2023-11-30 00:41:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384124548] [2023-11-30 00:41:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:34,103 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 00:41:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:34,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384124548] [2023-11-30 00:41:34,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384124548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:34,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:34,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995580533] [2023-11-30 00:41:34,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:34,105 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:34,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:34,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:34,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:34,106 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 137 [2023-11-30 00:41:34,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 322 transitions, 2642 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:34,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:34,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 137 [2023-11-30 00:41:34,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:36,203 INFO L124 PetriNetUnfolderBase]: 11220/24876 cut-off events. [2023-11-30 00:41:36,203 INFO L125 PetriNetUnfolderBase]: For 33275/51141 co-relation queries the response was YES. [2023-11-30 00:41:36,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99968 conditions, 24876 events. 11220/24876 cut-off events. For 33275/51141 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 252308 event pairs, 3332 based on Foata normal form. 90/20959 useless extension candidates. Maximal degree in co-relation 96120. Up to 13549 conditions per place. [2023-11-30 00:41:36,381 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 280 selfloop transitions, 33 changer transitions 2/402 dead transitions. [2023-11-30 00:41:36,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 402 transitions, 4095 flow [2023-11-30 00:41:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-11-30 00:41:36,383 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8102189781021898 [2023-11-30 00:41:36,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-11-30 00:41:36,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-11-30 00:41:36,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:36,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-11-30 00:41:36,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:36,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:36,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:36,385 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places. [2023-11-30 00:41:36,385 INFO L500 AbstractCegarLoop]: Abstraction has has 137 places, 402 transitions, 4095 flow [2023-11-30 00:41:36,385 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:36,385 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:36,386 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 00:41:36,386 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 00:41:36,386 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:36,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -602538138, now seen corresponding path program 1 times [2023-11-30 00:41:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40671082] [2023-11-30 00:41:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-30 00:41:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40671082] [2023-11-30 00:41:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40671082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:36,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258040397] [2023-11-30 00:41:36,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:36,416 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:36,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:36,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:36,417 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 137 [2023-11-30 00:41:36,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 402 transitions, 4095 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:36,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:36,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 137 [2023-11-30 00:41:36,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:39,004 INFO L124 PetriNetUnfolderBase]: 13345/29088 cut-off events. [2023-11-30 00:41:39,004 INFO L125 PetriNetUnfolderBase]: For 55487/69141 co-relation queries the response was YES. [2023-11-30 00:41:39,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129766 conditions, 29088 events. 13345/29088 cut-off events. For 55487/69141 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 296307 event pairs, 3699 based on Foata normal form. 89/24938 useless extension candidates. Maximal degree in co-relation 125450. Up to 15173 conditions per place. [2023-11-30 00:41:39,349 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 380 selfloop transitions, 57 changer transitions 2/527 dead transitions. [2023-11-30 00:41:39,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 527 transitions, 6495 flow [2023-11-30 00:41:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-30 00:41:39,351 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8077858880778589 [2023-11-30 00:41:39,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-30 00:41:39,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-30 00:41:39,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:39,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-30 00:41:39,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,357 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 4 predicate places. [2023-11-30 00:41:39,357 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 527 transitions, 6495 flow [2023-11-30 00:41:39,357 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,357 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:39,357 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:41:39,357 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 00:41:39,358 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-30 00:41:39,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2039971382, now seen corresponding path program 1 times [2023-11-30 00:41:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465355878] [2023-11-30 00:41:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:41:39,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:41:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:41:39,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:41:39,390 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:41:39,390 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-11-30 00:41:39,390 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-11-30 00:41:39,390 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-11-30 00:41:39,390 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-11-30 00:41:39,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-11-30 00:41:39,391 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 00:41:39,391 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:41:39,392 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:41:39,392 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 00:41:39,410 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:41:39,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 356 flow [2023-11-30 00:41:39,428 INFO L124 PetriNetUnfolderBase]: 18/332 cut-off events. [2023-11-30 00:41:39,428 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 00:41:39,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 332 events. 18/332 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1225 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 249. Up to 8 conditions per place. [2023-11-30 00:41:39,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 169 transitions, 356 flow [2023-11-30 00:41:39,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 169 transitions, 356 flow [2023-11-30 00:41:39,436 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:41:39,438 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;@416cc382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:41:39,438 INFO L363 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-30 00:41:39,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:41:39,440 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 00:41:39,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:41:39,440 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:39,440 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] [2023-11-30 00:41:39,440 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:41:39,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:39,440 INFO L85 PathProgramCache]: Analyzing trace with hash -513088984, now seen corresponding path program 1 times [2023-11-30 00:41:39,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:39,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218062615] [2023-11-30 00:41:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:41:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218062615] [2023-11-30 00:41:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218062615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:39,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:39,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912364209] [2023-11-30 00:41:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:39,452 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:41:39,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:41:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:41:39,454 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 169 [2023-11-30 00:41:39,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 169 transitions, 356 flow. Second operand has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:39,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 169 [2023-11-30 00:41:39,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:39,569 INFO L124 PetriNetUnfolderBase]: 178/1746 cut-off events. [2023-11-30 00:41:39,569 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-30 00:41:39,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1746 events. 178/1746 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14284 event pairs, 178 based on Foata normal form. 260/1723 useless extension candidates. Maximal degree in co-relation 1379. Up to 298 conditions per place. [2023-11-30 00:41:39,582 INFO L140 encePairwiseOnDemand]: 160/169 looper letters, 11 selfloop transitions, 0 changer transitions 0/148 dead transitions. [2023-11-30 00:41:39,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 148 transitions, 336 flow [2023-11-30 00:41:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:41:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:41:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions. [2023-11-30 00:41:39,584 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9171597633136095 [2023-11-30 00:41:39,584 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 310 transitions. [2023-11-30 00:41:39,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions. [2023-11-30 00:41:39,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:39,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions. [2023-11-30 00:41:39,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,585 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,586 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -11 predicate places. [2023-11-30 00:41:39,586 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 336 flow [2023-11-30 00:41:39,586 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,586 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:39,586 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 00:41:39,586 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 00:41:39,586 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:41:39,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:39,587 INFO L85 PathProgramCache]: Analyzing trace with hash -81007133, now seen corresponding path program 1 times [2023-11-30 00:41:39,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:39,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076881091] [2023-11-30 00:41:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:39,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:41:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076881091] [2023-11-30 00:41:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076881091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943272368] [2023-11-30 00:41:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:39,602 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:39,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:39,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:39,603 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 169 [2023-11-30 00:41:39,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:39,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:39,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 169 [2023-11-30 00:41:39,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:41:51,314 INFO L124 PetriNetUnfolderBase]: 88657/160464 cut-off events. [2023-11-30 00:41:51,314 INFO L125 PetriNetUnfolderBase]: For 19222/19275 co-relation queries the response was YES. [2023-11-30 00:41:51,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303953 conditions, 160464 events. 88657/160464 cut-off events. For 19222/19275 co-relation queries the response was YES. Maximal size of possible extension queue 4368. Compared 1738746 event pairs, 74353 based on Foata normal form. 0/125829 useless extension candidates. Maximal degree in co-relation 283222. Up to 109590 conditions per place. [2023-11-30 00:41:52,746 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 74 selfloop transitions, 12 changer transitions 0/183 dead transitions. [2023-11-30 00:41:52,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 183 transitions, 590 flow [2023-11-30 00:41:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:41:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:41:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-30 00:41:52,748 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7928994082840237 [2023-11-30 00:41:52,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-30 00:41:52,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-30 00:41:52,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:41:52,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-30 00:41:52,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:52,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:52,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:52,751 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -9 predicate places. [2023-11-30 00:41:52,751 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 183 transitions, 590 flow [2023-11-30 00:41:52,751 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:52,751 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:41:52,751 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] [2023-11-30 00:41:52,751 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 00:41:52,751 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:41:52,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:41:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1116714810, now seen corresponding path program 1 times [2023-11-30 00:41:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:41:52,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584087938] [2023-11-30 00:41:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:41:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:41:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:41:52,774 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 00:41:52,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:41:52,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584087938] [2023-11-30 00:41:52,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584087938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:41:52,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:41:52,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:41:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851928995] [2023-11-30 00:41:52,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:41:52,775 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:41:52,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:41:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:41:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:41:52,776 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 169 [2023-11-30 00:41:52,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 183 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:41:52,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:41:52,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 169 [2023-11-30 00:41:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:42:08,826 INFO L124 PetriNetUnfolderBase]: 118293/208174 cut-off events. [2023-11-30 00:42:08,827 INFO L125 PetriNetUnfolderBase]: For 45182/61026 co-relation queries the response was YES. [2023-11-30 00:42:09,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539469 conditions, 208174 events. 118293/208174 cut-off events. For 45182/61026 co-relation queries the response was YES. Maximal size of possible extension queue 5385. Compared 2248138 event pairs, 79735 based on Foata normal form. 93/164949 useless extension candidates. Maximal degree in co-relation 504567. Up to 138582 conditions per place. [2023-11-30 00:42:11,034 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 124 selfloop transitions, 20 changer transitions 0/244 dead transitions. [2023-11-30 00:42:11,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 244 transitions, 1156 flow [2023-11-30 00:42:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:42:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:42:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-11-30 00:42:11,038 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8047337278106509 [2023-11-30 00:42:11,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-11-30 00:42:11,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-11-30 00:42:11,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:42:11,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-11-30 00:42:11,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:11,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:11,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:11,042 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -7 predicate places. [2023-11-30 00:42:11,042 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 244 transitions, 1156 flow [2023-11-30 00:42:11,042 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:11,042 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:42:11,042 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:42:11,042 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 00:42:11,043 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:42:11,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:42:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash 488678962, now seen corresponding path program 1 times [2023-11-30 00:42:11,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:42:11,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770142683] [2023-11-30 00:42:11,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:42:11,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:42:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:42:11,067 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 00:42:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:42:11,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770142683] [2023-11-30 00:42:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770142683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:42:11,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:42:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:42:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738635792] [2023-11-30 00:42:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:42:11,069 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:42:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:42:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:42:11,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:42:11,069 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 169 [2023-11-30 00:42:11,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 244 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:11,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:42:11,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 169 [2023-11-30 00:42:11,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:42:36,487 INFO L124 PetriNetUnfolderBase]: 159419/309975 cut-off events. [2023-11-30 00:42:36,487 INFO L125 PetriNetUnfolderBase]: For 125183/184500 co-relation queries the response was YES. [2023-11-30 00:42:37,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952487 conditions, 309975 events. 159419/309975 cut-off events. For 125183/184500 co-relation queries the response was YES. Maximal size of possible extension queue 8603. Compared 3880282 event pairs, 61950 based on Foata normal form. 345/252155 useless extension candidates. Maximal degree in co-relation 397622. Up to 190272 conditions per place. [2023-11-30 00:42:40,058 INFO L140 encePairwiseOnDemand]: 149/169 looper letters, 220 selfloop transitions, 48 changer transitions 0/371 dead transitions. [2023-11-30 00:42:40,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 371 transitions, 2527 flow [2023-11-30 00:42:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:42:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:42:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-11-30 00:42:40,059 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8284023668639053 [2023-11-30 00:42:40,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-11-30 00:42:40,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-11-30 00:42:40,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:42:40,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-11-30 00:42:40,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:40,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:40,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:40,061 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -5 predicate places. [2023-11-30 00:42:40,061 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 371 transitions, 2527 flow [2023-11-30 00:42:40,062 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:40,062 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:42:40,062 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 00:42:40,062 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 00:42:40,062 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:42:40,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:42:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash -789703729, now seen corresponding path program 1 times [2023-11-30 00:42:40,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:42:40,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350521673] [2023-11-30 00:42:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:42:40,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:42:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:42:40,082 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 00:42:40,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:42:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350521673] [2023-11-30 00:42:40,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350521673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:42:40,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:42:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:42:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612883983] [2023-11-30 00:42:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:42:40,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:42:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:42:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:42:40,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:42:40,083 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 169 [2023-11-30 00:42:40,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 371 transitions, 2527 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:42:40,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:42:40,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 169 [2023-11-30 00:42:40,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:43:18,343 INFO L124 PetriNetUnfolderBase]: 194884/368716 cut-off events. [2023-11-30 00:43:18,343 INFO L125 PetriNetUnfolderBase]: For 263102/404444 co-relation queries the response was YES. [2023-11-30 00:43:20,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373853 conditions, 368716 events. 194884/368716 cut-off events. For 263102/404444 co-relation queries the response was YES. Maximal size of possible extension queue 9558. Compared 4563058 event pairs, 67293 based on Foata normal form. 1184/301739 useless extension candidates. Maximal degree in co-relation 701143. Up to 225995 conditions per place. [2023-11-30 00:43:22,844 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 345 selfloop transitions, 39 changer transitions 0/483 dead transitions. [2023-11-30 00:43:22,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 483 transitions, 4225 flow [2023-11-30 00:43:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:43:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:43:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-30 00:43:22,846 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7928994082840237 [2023-11-30 00:43:22,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-30 00:43:22,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-30 00:43:22,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:43:22,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-30 00:43:22,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:43:22,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:43:22,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:43:22,854 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -3 predicate places. [2023-11-30 00:43:22,854 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 483 transitions, 4225 flow [2023-11-30 00:43:22,854 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:43:22,855 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:43:22,855 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] [2023-11-30 00:43:22,855 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 00:43:22,855 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:43:22,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:43:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1949648860, now seen corresponding path program 1 times [2023-11-30 00:43:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:43:22,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627897157] [2023-11-30 00:43:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:43:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:43:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:43:22,899 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 00:43:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:43:22,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627897157] [2023-11-30 00:43:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627897157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:43:22,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:43:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:43:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295322437] [2023-11-30 00:43:22,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:43:22,900 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:43:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:43:22,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:43:22,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:43:22,901 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 169 [2023-11-30 00:43:22,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 483 transitions, 4225 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:43:22,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:43:22,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 169 [2023-11-30 00:43:22,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:44:19,423 INFO L124 PetriNetUnfolderBase]: 242948/448952 cut-off events. [2023-11-30 00:44:19,423 INFO L125 PetriNetUnfolderBase]: For 525386/795824 co-relation queries the response was YES. [2023-11-30 00:44:21,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940555 conditions, 448952 events. 242948/448952 cut-off events. For 525386/795824 co-relation queries the response was YES. Maximal size of possible extension queue 11363. Compared 5521464 event pairs, 74230 based on Foata normal form. 1948/370235 useless extension candidates. Maximal degree in co-relation 1141122. Up to 270603 conditions per place. [2023-11-30 00:44:25,262 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 487 selfloop transitions, 55 changer transitions 0/644 dead transitions. [2023-11-30 00:44:25,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 644 transitions, 6992 flow [2023-11-30 00:44:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:44:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:44:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-11-30 00:44:25,264 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8047337278106509 [2023-11-30 00:44:25,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-11-30 00:44:25,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-11-30 00:44:25,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:44:25,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-11-30 00:44:25,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:44:25,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:44:25,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:44:25,277 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -1 predicate places. [2023-11-30 00:44:25,277 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 644 transitions, 6992 flow [2023-11-30 00:44:25,277 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:44:25,277 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:44:25,277 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 00:44:25,278 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 00:44:25,278 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:44:25,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:44:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1893983034, now seen corresponding path program 1 times [2023-11-30 00:44:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:44:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064491342] [2023-11-30 00:44:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:44:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:44:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:44:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-30 00:44:25,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:44:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064491342] [2023-11-30 00:44:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064491342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:44:25,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:44:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:44:25,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586352103] [2023-11-30 00:44:25,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:44:25,338 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:44:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:44:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:44:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:44:25,338 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 169 [2023-11-30 00:44:25,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 644 transitions, 6992 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:44:25,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:44:25,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 169 [2023-11-30 00:44:25,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:45:51,642 INFO L124 PetriNetUnfolderBase]: 307312/556269 cut-off events. [2023-11-30 00:45:51,642 INFO L125 PetriNetUnfolderBase]: For 984195/1579810 co-relation queries the response was YES. [2023-11-30 00:45:55,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690655 conditions, 556269 events. 307312/556269 cut-off events. For 984195/1579810 co-relation queries the response was YES. Maximal size of possible extension queue 13968. Compared 6835501 event pairs, 84607 based on Foata normal form. 2937/464376 useless extension candidates. Maximal degree in co-relation 1592500. Up to 324027 conditions per place. [2023-11-30 00:46:00,883 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 752 selfloop transitions, 119 changer transitions 0/974 dead transitions. [2023-11-30 00:46:00,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 974 transitions, 12824 flow [2023-11-30 00:46:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:46:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:46:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-11-30 00:46:00,885 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8027613412228797 [2023-11-30 00:46:00,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-11-30 00:46:00,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-11-30 00:46:00,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:46:00,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-11-30 00:46:00,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:00,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:00,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:00,902 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, 1 predicate places. [2023-11-30 00:46:00,902 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 974 transitions, 12824 flow [2023-11-30 00:46:00,903 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:00,903 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:46:00,903 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:46:00,903 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 00:46:00,903 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:46:00,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:46:00,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1531399634, now seen corresponding path program 1 times [2023-11-30 00:46:00,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:46:00,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507802511] [2023-11-30 00:46:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:46:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:46:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:46:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-30 00:46:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:46:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507802511] [2023-11-30 00:46:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507802511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:46:01,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:46:01,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 00:46:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716400140] [2023-11-30 00:46:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:46:01,049 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:46:01,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:46:01,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:46:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:46:01,050 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 169 [2023-11-30 00:46:01,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 974 transitions, 12824 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:01,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:46:01,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 169 [2023-11-30 00:46:01,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:46:01,749 INFO L124 PetriNetUnfolderBase]: 381/2335 cut-off events. [2023-11-30 00:46:01,749 INFO L125 PetriNetUnfolderBase]: For 16619/17279 co-relation queries the response was YES. [2023-11-30 00:46:01,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8521 conditions, 2335 events. 381/2335 cut-off events. For 16619/17279 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 20709 event pairs, 312 based on Foata normal form. 918/3062 useless extension candidates. Maximal degree in co-relation 2768. Up to 1078 conditions per place. [2023-11-30 00:46:01,759 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 18 selfloop transitions, 8 changer transitions 3/148 dead transitions. [2023-11-30 00:46:01,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 148 transitions, 1053 flow [2023-11-30 00:46:01,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:46:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:46:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-11-30 00:46:01,784 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8678500986193294 [2023-11-30 00:46:01,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-11-30 00:46:01,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-11-30 00:46:01,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:46:01,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-11-30 00:46:01,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:01,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:01,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:01,787 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -6 predicate places. [2023-11-30 00:46:01,787 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 148 transitions, 1053 flow [2023-11-30 00:46:01,787 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:01,787 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:46:01,787 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:46:01,787 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 00:46:01,787 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:46:01,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:46:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash -732032720, now seen corresponding path program 1 times [2023-11-30 00:46:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:46:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188478757] [2023-11-30 00:46:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:46:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:46:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:46:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-30 00:46:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:46:01,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188478757] [2023-11-30 00:46:01,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188478757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:46:01,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:46:01,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:46:01,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415727372] [2023-11-30 00:46:01,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:46:01,832 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:46:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:46:01,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:46:01,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:46:01,833 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 169 [2023-11-30 00:46:01,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 148 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:01,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:46:01,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 169 [2023-11-30 00:46:01,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:46:02,109 INFO L124 PetriNetUnfolderBase]: 370/2262 cut-off events. [2023-11-30 00:46:02,109 INFO L125 PetriNetUnfolderBase]: For 10065/10787 co-relation queries the response was YES. [2023-11-30 00:46:02,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9110 conditions, 2262 events. 370/2262 cut-off events. For 10065/10787 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19903 event pairs, 296 based on Foata normal form. 0/2089 useless extension candidates. Maximal degree in co-relation 3365. Up to 1043 conditions per place. [2023-11-30 00:46:02,120 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 47 selfloop transitions, 2 changer transitions 3/148 dead transitions. [2023-11-30 00:46:02,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 148 transitions, 1162 flow [2023-11-30 00:46:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:46:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:46:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-11-30 00:46:02,122 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7140039447731755 [2023-11-30 00:46:02,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-11-30 00:46:02,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-11-30 00:46:02,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:46:02,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-11-30 00:46:02,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,137 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -5 predicate places. [2023-11-30 00:46:02,137 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 148 transitions, 1162 flow [2023-11-30 00:46:02,137 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,137 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:46:02,138 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 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 00:46:02,138 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 00:46:02,138 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:46:02,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:46:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1179652468, now seen corresponding path program 1 times [2023-11-30 00:46:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:46:02,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365674627] [2023-11-30 00:46:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:46:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:46:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:46:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-30 00:46:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:46:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365674627] [2023-11-30 00:46:02,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365674627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:46:02,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:46:02,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:46:02,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686853861] [2023-11-30 00:46:02,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:46:02,188 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:46:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:46:02,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:46:02,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:46:02,189 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 169 [2023-11-30 00:46:02,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 148 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:46:02,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 169 [2023-11-30 00:46:02,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:46:02,447 INFO L124 PetriNetUnfolderBase]: 362/2261 cut-off events. [2023-11-30 00:46:02,447 INFO L125 PetriNetUnfolderBase]: For 12377/13386 co-relation queries the response was YES. [2023-11-30 00:46:02,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9755 conditions, 2261 events. 362/2261 cut-off events. For 12377/13386 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 20035 event pairs, 290 based on Foata normal form. 0/2112 useless extension candidates. Maximal degree in co-relation 3143. Up to 1019 conditions per place. [2023-11-30 00:46:02,459 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 46 selfloop transitions, 2 changer transitions 3/147 dead transitions. [2023-11-30 00:46:02,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 147 transitions, 1242 flow [2023-11-30 00:46:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:46:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:46:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-30 00:46:02,477 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7100591715976331 [2023-11-30 00:46:02,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-30 00:46:02,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-30 00:46:02,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:46:02,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-30 00:46:02,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,480 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -4 predicate places. [2023-11-30 00:46:02,480 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 147 transitions, 1242 flow [2023-11-30 00:46:02,480 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,480 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:46:02,480 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:46:02,480 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-30 00:46:02,480 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-30 00:46:02,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:46:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash 894769424, now seen corresponding path program 1 times [2023-11-30 00:46:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:46:02,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477535016] [2023-11-30 00:46:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:46:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:46:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:46:02,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:46:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:46:02,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:46:02,503 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:46:02,503 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-11-30 00:46:02,503 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2023-11-30 00:46:02,504 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2023-11-30 00:46:02,504 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2023-11-30 00:46:02,504 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2023-11-30 00:46:02,524 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2023-11-30 00:46:02,524 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2023-11-30 00:46:02,524 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2023-11-30 00:46:02,524 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2023-11-30 00:46:02,524 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2023-11-30 00:46:02,525 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2023-11-30 00:46:02,525 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2023-11-30 00:46:02,525 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2023-11-30 00:46:02,525 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2023-11-30 00:46:02,525 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2023-11-30 00:46:02,525 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2023-11-30 00:46:02,525 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-30 00:46:02,525 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:46:02,526 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:46:02,526 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 00:46:02,561 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:46:02,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 201 transitions, 430 flow [2023-11-30 00:46:02,602 INFO L124 PetriNetUnfolderBase]: 23/419 cut-off events. [2023-11-30 00:46:02,602 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 00:46:02,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 419 events. 23/419 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1643 event pairs, 0 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 340. Up to 10 conditions per place. [2023-11-30 00:46:02,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 201 transitions, 430 flow [2023-11-30 00:46:02,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 201 transitions, 430 flow [2023-11-30 00:46:02,623 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:46:02,623 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;@416cc382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:46:02,623 INFO L363 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-30 00:46:02,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:46:02,633 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 00:46:02,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:46:02,633 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:46: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] [2023-11-30 00:46:02,633 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 00:46:02,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:46:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1023268376, now seen corresponding path program 1 times [2023-11-30 00:46:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:46:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715259344] [2023-11-30 00:46:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:46:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:46:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:46:02,647 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 00:46:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:46:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715259344] [2023-11-30 00:46:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715259344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:46:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:46:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:46:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728278026] [2023-11-30 00:46:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:46:02,648 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:46:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:46:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:46:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:46:02,649 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 201 [2023-11-30 00:46:02,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 201 transitions, 430 flow. Second operand has 2 states, 2 states have (on average 172.0) internal successors, (344), 2 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:02,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:46:02,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 201 [2023-11-30 00:46:02,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:46:03,117 INFO L124 PetriNetUnfolderBase]: 772/5391 cut-off events. [2023-11-30 00:46:03,117 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-11-30 00:46:03,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6713 conditions, 5391 events. 772/5391 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 57421 event pairs, 772 based on Foata normal form. 971/5482 useless extension candidates. Maximal degree in co-relation 4431. Up to 1135 conditions per place. [2023-11-30 00:46:03,181 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 14 selfloop transitions, 0 changer transitions 0/175 dead transitions. [2023-11-30 00:46:03,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 175 transitions, 406 flow [2023-11-30 00:46:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:46:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:46:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2023-11-30 00:46:03,183 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9129353233830846 [2023-11-30 00:46:03,183 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 367 transitions. [2023-11-30 00:46:03,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 367 transitions. [2023-11-30 00:46:03,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:46:03,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 367 transitions. [2023-11-30 00:46:03,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:03,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:03,185 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:03,185 INFO L307 CegarLoopForPetriNet]: 199 programPoint places, -14 predicate places. [2023-11-30 00:46:03,185 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 175 transitions, 406 flow [2023-11-30 00:46:03,185 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 172.0) internal successors, (344), 2 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:03,186 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:46:03,186 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 00:46:03,186 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-30 00:46:03,186 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 00:46:03,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:46:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1054185932, now seen corresponding path program 1 times [2023-11-30 00:46:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:46:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115862982] [2023-11-30 00:46:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:46:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:46:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:46:03,238 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 00:46:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:46:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115862982] [2023-11-30 00:46:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115862982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:46:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:46:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:46:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364430472] [2023-11-30 00:46:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:46:03,239 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:46:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:46:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:46:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:46:03,240 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 201 [2023-11-30 00:46:03,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 175 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:46:03,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:46:03,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 201 [2023-11-30 00:46:03,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand