/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/39_rand_lock_p0_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 00:37:35,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 00:37:35,736 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:37:35,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 00:37:35,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 00:37:35,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 00:37:35,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 00:37:35,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 00:37:35,761 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 00:37:35,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 00:37:35,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 00:37:35,765 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 00:37:35,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 00:37:35,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 00:37:35,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 00:37:35,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 00:37:35,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 00:37:35,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 00:37:35,767 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 00:37:35,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 00:37:35,767 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 00:37:35,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 00:37:35,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 00:37:35,768 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 00:37:35,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 00:37:35,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:37:35,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 00:37:35,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 00:37:35,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 00:37:35,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 00:37:35,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 00:37:35,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 00:37:35,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 00:37:35,770 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:37:35,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 00:37:35,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 00:37:35,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 00:37:35,951 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 00:37:35,951 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 00:37:35,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i [2023-11-30 00:37:36,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 00:37:37,172 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 00:37:37,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i [2023-11-30 00:37:37,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc46e860/9e95f21d15204771aad7552e5bd6abab/FLAG865cbf020 [2023-11-30 00:37:37,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc46e860/9e95f21d15204771aad7552e5bd6abab [2023-11-30 00:37:37,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 00:37:37,220 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 00:37:37,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 00:37:37,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 00:37:37,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 00:37:37,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae3d0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37, skipping insertion in model container [2023-11-30 00:37:37,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,269 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 00:37:37,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:37:37,462 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 00:37:37,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:37:37,515 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 00:37:37,516 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 00:37:37,521 INFO L206 MainTranslator]: Completed translation [2023-11-30 00:37:37,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37 WrapperNode [2023-11-30 00:37:37,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 00:37:37,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 00:37:37,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 00:37:37,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 00:37:37,527 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:37:37" (1/1) ... [2023-11-30 00:37:37,557 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:37:37" (1/1) ... [2023-11-30 00:37:37,577 INFO L138 Inliner]: procedures = 167, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2023-11-30 00:37:37,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 00:37:37,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 00:37:37,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 00:37:37,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 00:37:37,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 00:37:37,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 00:37:37,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 00:37:37,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 00:37:37,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (1/1) ... [2023-11-30 00:37:37,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:37:37,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 00:37:37,628 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:37:37,632 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:37:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 00:37:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 00:37:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 00:37:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 00:37:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 00:37:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 00:37:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 00:37:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 00:37:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 00:37:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 00:37:37,656 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:37:37,737 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 00:37:37,738 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 00:37:37,839 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 00:37:37,864 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 00:37:37,864 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 00:37:37,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:37 BoogieIcfgContainer [2023-11-30 00:37:37,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 00:37:37,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 00:37:37,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 00:37:37,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 00:37:37,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:37:37" (1/3) ... [2023-11-30 00:37:37,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396d273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:37, skipping insertion in model container [2023-11-30 00:37:37,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:37" (2/3) ... [2023-11-30 00:37:37,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396d273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:37, skipping insertion in model container [2023-11-30 00:37:37,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:37" (3/3) ... [2023-11-30 00:37:37,870 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs-pthread.i [2023-11-30 00:37:37,882 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 00:37:37,882 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-30 00:37:37,882 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 00:37:37,961 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:37:37,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 158 flow [2023-11-30 00:37:38,022 INFO L124 PetriNetUnfolderBase]: 4/88 cut-off events. [2023-11-30 00:37:38,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:37:38,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 88 events. 4/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2023-11-30 00:37:38,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 77 transitions, 158 flow [2023-11-30 00:37:38,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 77 transitions, 158 flow [2023-11-30 00:37:38,042 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:37:38,056 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;@9d4e818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:37:38,056 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-30 00:37:38,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:37:38,070 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2023-11-30 00:37:38,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:37:38,070 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:38,071 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] [2023-11-30 00:37:38,072 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-30 00:37:38,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash -445449284, now seen corresponding path program 1 times [2023-11-30 00:37:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:38,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899236701] [2023-11-30 00:37:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:38,207 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:37:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899236701] [2023-11-30 00:37:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899236701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:38,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:38,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:37:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116005167] [2023-11-30 00:37:38,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:38,219 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:37:38,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:37:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:37:38,240 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 77 [2023-11-30 00:37:38,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have 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:37:38,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:38,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 77 [2023-11-30 00:37:38,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:38,271 INFO L124 PetriNetUnfolderBase]: 1/71 cut-off events. [2023-11-30 00:37:38,272 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:37:38,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 71 events. 1/71 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 15 event pairs, 0 based on Foata normal form. 7/76 useless extension candidates. Maximal degree in co-relation 52. Up to 6 conditions per place. [2023-11-30 00:37:38,273 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 5 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2023-11-30 00:37:38,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 148 flow [2023-11-30 00:37:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:37:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:37:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 144 transitions. [2023-11-30 00:37:38,282 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.935064935064935 [2023-11-30 00:37:38,282 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 144 transitions. [2023-11-30 00:37:38,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 144 transitions. [2023-11-30 00:37:38,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:38,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 144 transitions. [2023-11-30 00:37:38,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have 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:37:38,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have 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:37:38,293 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have 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:37:38,299 INFO L307 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2023-11-30 00:37:38,299 INFO L500 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 148 flow [2023-11-30 00:37:38,300 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have 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:37:38,300 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:38,300 INFO L232 CegarLoopForPetriNet]: trace histogram [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:37:38,300 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 00:37:38,300 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-30 00:37:38,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash -579926155, now seen corresponding path program 1 times [2023-11-30 00:37:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:38,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129117639] [2023-11-30 00:37:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:38,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:38,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:37:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:38,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:37:38,366 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:37:38,367 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-30 00:37:38,368 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-30 00:37:38,369 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-30 00:37:38,369 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-30 00:37:38,369 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-30 00:37:38,369 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-30 00:37:38,369 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-30 00:37:38,369 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 00:37:38,370 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-30 00:37:38,371 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:37:38,371 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 00:37:38,396 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:37:38,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 256 flow [2023-11-30 00:37:38,433 INFO L124 PetriNetUnfolderBase]: 7/147 cut-off events. [2023-11-30 00:37:38,433 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 00:37:38,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 147 events. 7/147 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 240 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2023-11-30 00:37:38,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 123 transitions, 256 flow [2023-11-30 00:37:38,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 123 transitions, 256 flow [2023-11-30 00:37:38,436 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:37:38,437 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;@9d4e818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:37:38,437 INFO L363 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-30 00:37:38,442 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:37:38,442 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2023-11-30 00:37:38,443 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:37:38,443 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:38,444 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] [2023-11-30 00:37:38,444 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-30 00:37:38,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1392247945, now seen corresponding path program 1 times [2023-11-30 00:37:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336819419] [2023-11-30 00:37:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:38,502 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:37:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336819419] [2023-11-30 00:37:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336819419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:38,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:38,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:37:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083743635] [2023-11-30 00:37:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:38,504 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:37:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:38,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:37:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:37:38,505 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 123 [2023-11-30 00:37:38,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 123 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 106.0) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have 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:37:38,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:38,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 123 [2023-11-30 00:37:38,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:38,561 INFO L124 PetriNetUnfolderBase]: 27/347 cut-off events. [2023-11-30 00:37:38,561 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-30 00:37:38,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 347 events. 27/347 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1258 event pairs, 20 based on Foata normal form. 40/371 useless extension candidates. Maximal degree in co-relation 317. Up to 51 conditions per place. [2023-11-30 00:37:38,565 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 10 selfloop transitions, 0 changer transitions 0/110 dead transitions. [2023-11-30 00:37:38,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 250 flow [2023-11-30 00:37:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:37:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:37:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2023-11-30 00:37:38,576 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2023-11-30 00:37:38,576 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 228 transitions. [2023-11-30 00:37:38,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 228 transitions. [2023-11-30 00:37:38,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:38,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 228 transitions. [2023-11-30 00:37:38,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 114.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:37:38,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have 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:37:38,589 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have 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:37:38,590 INFO L307 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places. [2023-11-30 00:37:38,590 INFO L500 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 250 flow [2023-11-30 00:37:38,590 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.0) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have 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:37:38,590 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:38,590 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:37:38,591 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 00:37:38,591 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-30 00:37:38,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1273294650, now seen corresponding path program 1 times [2023-11-30 00:37:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:38,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060037846] [2023-11-30 00:37:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:38,654 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:37:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:38,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060037846] [2023-11-30 00:37:38,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060037846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:38,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:37:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323206466] [2023-11-30 00:37:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:38,656 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:37:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:38,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:37:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:37:38,657 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2023-11-30 00:37:38,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:37:38,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:38,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2023-11-30 00:37:38,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:38,753 INFO L124 PetriNetUnfolderBase]: 64/540 cut-off events. [2023-11-30 00:37:38,753 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2023-11-30 00:37:38,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 540 events. 64/540 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2583 event pairs, 20 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 657. Up to 87 conditions per place. [2023-11-30 00:37:38,758 INFO L140 encePairwiseOnDemand]: 113/123 looper letters, 21 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2023-11-30 00:37:38,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 123 transitions, 357 flow [2023-11-30 00:37:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:37:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:37:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-11-30 00:37:38,763 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-30 00:37:38,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-11-30 00:37:38,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-11-30 00:37:38,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:38,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-11-30 00:37:38,764 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:37:38,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have 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:37:38,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have 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:37:38,767 INFO L307 CegarLoopForPetriNet]: 123 programPoint places, -7 predicate places. [2023-11-30 00:37:38,767 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 123 transitions, 357 flow [2023-11-30 00:37:38,767 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:37:38,768 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:38,768 INFO L232 CegarLoopForPetriNet]: trace histogram [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:37:38,768 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 00:37:38,768 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-30 00:37:38,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash -538440815, now seen corresponding path program 1 times [2023-11-30 00:37:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014120732] [2023-11-30 00:37:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:38,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:37:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:38,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:37:38,806 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:37:38,806 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-30 00:37:38,806 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-30 00:37:38,806 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-30 00:37:38,806 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-30 00:37:38,806 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-30 00:37:38,807 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-30 00:37:38,807 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-30 00:37:38,807 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-30 00:37:38,807 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-30 00:37:38,807 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-30 00:37:38,807 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 00:37:38,807 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 00:37:38,808 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:37:38,808 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 00:37:38,838 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:37:38,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 169 transitions, 356 flow [2023-11-30 00:37:38,876 INFO L124 PetriNetUnfolderBase]: 10/206 cut-off events. [2023-11-30 00:37:38,877 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 00:37:38,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 10/206 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 500 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 151. Up to 8 conditions per place. [2023-11-30 00:37:38,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 169 transitions, 356 flow [2023-11-30 00:37:38,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 169 transitions, 356 flow [2023-11-30 00:37:38,880 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:37:38,880 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;@9d4e818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:37:38,880 INFO L363 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-30 00:37:38,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:37:38,883 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2023-11-30 00:37:38,883 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:37:38,883 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:38,883 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] [2023-11-30 00:37:38,884 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:37:38,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1499936877, now seen corresponding path program 1 times [2023-11-30 00:37:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:38,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896955949] [2023-11-30 00:37:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:38,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:38,901 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:37:38,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896955949] [2023-11-30 00:37:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896955949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:38,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:38,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:37:38,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190417678] [2023-11-30 00:37:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:38,902 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:37:38,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:37:38,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:37:38,903 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 169 [2023-11-30 00:37:38,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 356 flow. Second operand has 2 states, 2 states have (on average 144.0) internal successors, (288), 2 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:37:38,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:38,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 169 [2023-11-30 00:37:38,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:39,107 INFO L124 PetriNetUnfolderBase]: 253/1831 cut-off events. [2023-11-30 00:37:39,107 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-11-30 00:37:39,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 1831 events. 253/1831 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 13989 event pairs, 220 based on Foata normal form. 217/1957 useless extension candidates. Maximal degree in co-relation 1771. Up to 376 conditions per place. [2023-11-30 00:37:39,125 INFO L140 encePairwiseOnDemand]: 158/169 looper letters, 15 selfloop transitions, 0 changer transitions 0/153 dead transitions. [2023-11-30 00:37:39,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 354 flow [2023-11-30 00:37:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:37:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:37:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 312 transitions. [2023-11-30 00:37:39,128 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2023-11-30 00:37:39,128 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 312 transitions. [2023-11-30 00:37:39,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 312 transitions. [2023-11-30 00:37:39,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:39,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 312 transitions. [2023-11-30 00:37:39,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:37:39,130 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:37:39,130 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:37:39,132 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, -11 predicate places. [2023-11-30 00:37:39,132 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 354 flow [2023-11-30 00:37:39,133 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 144.0) internal successors, (288), 2 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:37:39,133 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:39,133 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] [2023-11-30 00:37:39,133 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 00:37:39,133 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:37:39,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1743933546, now seen corresponding path program 1 times [2023-11-30 00:37:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783392704] [2023-11-30 00:37:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:39,192 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:37:39,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:39,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783392704] [2023-11-30 00:37:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783392704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:39,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:37:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291538706] [2023-11-30 00:37:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:39,194 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:37:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:39,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:37:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:37:39,196 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 169 [2023-11-30 00:37:39,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 354 flow. Second operand has 3 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:37:39,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:39,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 169 [2023-11-30 00:37:39,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:39,723 INFO L124 PetriNetUnfolderBase]: 1172/5383 cut-off events. [2023-11-30 00:37:39,723 INFO L125 PetriNetUnfolderBase]: For 1022/1212 co-relation queries the response was YES. [2023-11-30 00:37:39,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8668 conditions, 5383 events. 1172/5383 cut-off events. For 1022/1212 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 52297 event pairs, 427 based on Foata normal form. 0/5129 useless extension candidates. Maximal degree in co-relation 7414. Up to 1185 conditions per place. [2023-11-30 00:37:39,833 INFO L140 encePairwiseOnDemand]: 154/169 looper letters, 32 selfloop transitions, 12 changer transitions 0/173 dead transitions. [2023-11-30 00:37:39,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 173 transitions, 522 flow [2023-11-30 00:37:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:37:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:37:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-11-30 00:37:39,835 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2023-11-30 00:37:39,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-11-30 00:37:39,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-11-30 00:37:39,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:39,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-11-30 00:37:39,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have 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:37:39,837 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:37:39,837 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:37:39,837 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, -9 predicate places. [2023-11-30 00:37:39,838 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 173 transitions, 522 flow [2023-11-30 00:37:39,838 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:37:39,838 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:39,838 INFO L232 CegarLoopForPetriNet]: trace histogram [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:37:39,838 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 00:37:39,838 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:37:39,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1591388776, now seen corresponding path program 1 times [2023-11-30 00:37:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:39,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276663029] [2023-11-30 00:37:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:39,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:37:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:39,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:37:39,885 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:37:39,886 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-11-30 00:37:39,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-11-30 00:37:39,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-11-30 00:37:39,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-11-30 00:37:39,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-11-30 00:37:39,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-11-30 00:37:39,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-11-30 00:37:39,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2023-11-30 00:37:39,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-11-30 00:37:39,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-11-30 00:37:39,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-11-30 00:37:39,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-11-30 00:37:39,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-11-30 00:37:39,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 00:37:39,887 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 00:37:39,888 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:37:39,888 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 00:37:39,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:37:39,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 215 transitions, 458 flow [2023-11-30 00:37:40,011 INFO L124 PetriNetUnfolderBase]: 13/265 cut-off events. [2023-11-30 00:37:40,011 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 00:37:40,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 265 events. 13/265 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 755 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 214. Up to 10 conditions per place. [2023-11-30 00:37:40,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 215 transitions, 458 flow [2023-11-30 00:37:40,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 215 transitions, 458 flow [2023-11-30 00:37:40,017 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:37:40,020 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;@9d4e818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:37:40,021 INFO L363 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-30 00:37:40,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:37:40,025 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-30 00:37:40,025 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:37:40,025 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:40,025 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] [2023-11-30 00:37:40,025 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:37:40,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:40,026 INFO L85 PathProgramCache]: Analyzing trace with hash 164947626, now seen corresponding path program 1 times [2023-11-30 00:37:40,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:40,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881451984] [2023-11-30 00:37:40,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:40,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:40,046 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:37:40,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881451984] [2023-11-30 00:37:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881451984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:40,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:40,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:37:40,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180039676] [2023-11-30 00:37:40,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:40,049 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:37:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:40,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:37:40,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:37:40,051 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 215 [2023-11-30 00:37:40,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 215 transitions, 458 flow. Second operand has 2 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have 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:37:40,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:40,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 215 [2023-11-30 00:37:40,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:41,110 INFO L124 PetriNetUnfolderBase]: 1859/9727 cut-off events. [2023-11-30 00:37:41,110 INFO L125 PetriNetUnfolderBase]: For 1422/1422 co-relation queries the response was YES. [2023-11-30 00:37:41,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12975 conditions, 9727 events. 1859/9727 cut-off events. For 1422/1422 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 107524 event pairs, 1720 based on Foata normal form. 1190/10448 useless extension candidates. Maximal degree in co-relation 9789. Up to 2501 conditions per place. [2023-11-30 00:37:41,189 INFO L140 encePairwiseOnDemand]: 201/215 looper letters, 20 selfloop transitions, 0 changer transitions 0/196 dead transitions. [2023-11-30 00:37:41,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 196 transitions, 460 flow [2023-11-30 00:37:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:37:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:37:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 396 transitions. [2023-11-30 00:37:41,190 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9209302325581395 [2023-11-30 00:37:41,190 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 396 transitions. [2023-11-30 00:37:41,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 396 transitions. [2023-11-30 00:37:41,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:41,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 396 transitions. [2023-11-30 00:37:41,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 198.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:37:41,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have 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:37:41,192 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have 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:37:41,194 INFO L307 CegarLoopForPetriNet]: 215 programPoint places, -13 predicate places. [2023-11-30 00:37:41,194 INFO L500 AbstractCegarLoop]: Abstraction has has 202 places, 196 transitions, 460 flow [2023-11-30 00:37:41,194 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have 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:37:41,194 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:41,194 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] [2023-11-30 00:37:41,194 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 00:37:41,194 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:37:41,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1277129683, now seen corresponding path program 1 times [2023-11-30 00:37:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882699807] [2023-11-30 00:37:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:41,233 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:37:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882699807] [2023-11-30 00:37:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882699807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:37:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419998823] [2023-11-30 00:37:41,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:41,234 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:37:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:37:41,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:37:41,235 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 215 [2023-11-30 00:37:41,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 196 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:37:41,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:41,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 215 [2023-11-30 00:37:41,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:46,873 INFO L124 PetriNetUnfolderBase]: 15875/53826 cut-off events. [2023-11-30 00:37:46,873 INFO L125 PetriNetUnfolderBase]: For 14517/18046 co-relation queries the response was YES. [2023-11-30 00:37:47,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93099 conditions, 53826 events. 15875/53826 cut-off events. For 14517/18046 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 725946 event pairs, 6167 based on Foata normal form. 0/50978 useless extension candidates. Maximal degree in co-relation 79160. Up to 14066 conditions per place. [2023-11-30 00:37:47,633 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 43 selfloop transitions, 16 changer transitions 0/223 dead transitions. [2023-11-30 00:37:47,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 223 transitions, 691 flow [2023-11-30 00:37:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:37:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:37:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-11-30 00:37:47,642 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2023-11-30 00:37:47,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-11-30 00:37:47,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-11-30 00:37:47,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:47,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-11-30 00:37:47,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have 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:37:47,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:37:47,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have 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:37:47,646 INFO L307 CegarLoopForPetriNet]: 215 programPoint places, -11 predicate places. [2023-11-30 00:37:47,646 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 223 transitions, 691 flow [2023-11-30 00:37:47,646 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:37:47,646 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:47,646 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 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:37:47,646 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 00:37:47,646 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:37:47,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash -310142582, now seen corresponding path program 1 times [2023-11-30 00:37:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451294039] [2023-11-30 00:37:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:47,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:37:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:37:47,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:37:47,694 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2023-11-30 00:37:47,695 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2023-11-30 00:37:47,696 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2023-11-30 00:37:47,696 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2023-11-30 00:37:47,696 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2023-11-30 00:37:47,696 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2023-11-30 00:37:47,696 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2023-11-30 00:37:47,696 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 00:37:47,696 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 00:37:47,696 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:37:47,697 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 00:37:47,739 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:37:47,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 261 transitions, 562 flow [2023-11-30 00:37:47,775 INFO L124 PetriNetUnfolderBase]: 16/324 cut-off events. [2023-11-30 00:37:47,775 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 00:37:47,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 324 events. 16/324 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1044 event pairs, 0 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 278. Up to 12 conditions per place. [2023-11-30 00:37:47,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 261 transitions, 562 flow [2023-11-30 00:37:47,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 261 transitions, 562 flow [2023-11-30 00:37:47,782 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:37:47,785 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;@9d4e818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:37:47,785 INFO L363 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-30 00:37:47,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:37:47,787 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-30 00:37:47,787 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:37:47,787 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:47,787 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] [2023-11-30 00:37:47,789 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2023-11-30 00:37:47,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash 54726357, now seen corresponding path program 1 times [2023-11-30 00:37:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:47,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918988371] [2023-11-30 00:37:47,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:47,805 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:37:47,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:47,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918988371] [2023-11-30 00:37:47,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918988371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:47,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:47,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:37:47,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528989073] [2023-11-30 00:37:47,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:47,806 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:37:47,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:47,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:37:47,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:37:47,807 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 261 [2023-11-30 00:37:47,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 261 transitions, 562 flow. Second operand has 2 states, 2 states have (on average 220.0) internal successors, (440), 2 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:37:47,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:47,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 261 [2023-11-30 00:37:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:37:54,619 INFO L124 PetriNetUnfolderBase]: 12349/51891 cut-off events. [2023-11-30 00:37:54,619 INFO L125 PetriNetUnfolderBase]: For 10801/10801 co-relation queries the response was YES. [2023-11-30 00:37:55,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72015 conditions, 51891 events. 12349/51891 cut-off events. For 10801/10801 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 730223 event pairs, 11720 based on Foata normal form. 6632/56145 useless extension candidates. Maximal degree in co-relation 54063. Up to 15626 conditions per place. [2023-11-30 00:37:55,487 INFO L140 encePairwiseOnDemand]: 244/261 looper letters, 25 selfloop transitions, 0 changer transitions 0/239 dead transitions. [2023-11-30 00:37:55,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 239 transitions, 568 flow [2023-11-30 00:37:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:37:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:37:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 480 transitions. [2023-11-30 00:37:55,489 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9195402298850575 [2023-11-30 00:37:55,489 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 480 transitions. [2023-11-30 00:37:55,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 480 transitions. [2023-11-30 00:37:55,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:37:55,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 480 transitions. [2023-11-30 00:37:55,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 240.0) internal successors, (480), 2 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have 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:37:55,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:37:55,491 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:37:55,491 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, -15 predicate places. [2023-11-30 00:37:55,491 INFO L500 AbstractCegarLoop]: Abstraction has has 246 places, 239 transitions, 568 flow [2023-11-30 00:37:55,492 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 220.0) internal successors, (440), 2 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:37:55,492 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:37:55,492 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] [2023-11-30 00:37:55,492 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 00:37:55,492 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2023-11-30 00:37:55,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:37:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2092834008, now seen corresponding path program 1 times [2023-11-30 00:37:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:37:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581917696] [2023-11-30 00:37:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:37:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:37:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:37:55,509 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:37:55,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:37:55,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581917696] [2023-11-30 00:37:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581917696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:37:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:37:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:37:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467379965] [2023-11-30 00:37:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:37:55,509 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:37:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:37:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:37:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:37:55,510 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 261 [2023-11-30 00:37:55,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 239 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have 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:37:55,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:37:55,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 261 [2023-11-30 00:37:55,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:39:03,751 INFO L124 PetriNetUnfolderBase]: 185425/517064 cut-off events. [2023-11-30 00:39:03,751 INFO L125 PetriNetUnfolderBase]: For 182663/221692 co-relation queries the response was YES. [2023-11-30 00:39:09,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944178 conditions, 517064 events. 185425/517064 cut-off events. For 182663/221692 co-relation queries the response was YES. Maximal size of possible extension queue 13115. Compared 8478951 event pairs, 75324 based on Foata normal form. 0/487890 useless extension candidates. Maximal degree in co-relation 797237. Up to 151906 conditions per place. [2023-11-30 00:39:13,870 INFO L140 encePairwiseOnDemand]: 236/261 looper letters, 54 selfloop transitions, 20 changer transitions 0/273 dead transitions. [2023-11-30 00:39:13,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 273 transitions, 864 flow [2023-11-30 00:39:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:39:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:39:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-11-30 00:39:13,873 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8825031928480205 [2023-11-30 00:39:13,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-11-30 00:39:13,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-11-30 00:39:13,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:39:13,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-11-30 00:39:13,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have 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:39:13,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:39:13,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:39:13,878 INFO L307 CegarLoopForPetriNet]: 261 programPoint places, -13 predicate places. [2023-11-30 00:39:13,878 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 273 transitions, 864 flow [2023-11-30 00:39:13,879 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have 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:39:13,879 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:39:13,879 INFO L232 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 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:39:13,879 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 00:39:13,879 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2023-11-30 00:39:13,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:39:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash 220238579, now seen corresponding path program 1 times [2023-11-30 00:39:13,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:39:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118869270] [2023-11-30 00:39:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:39:13,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:39:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:39:13,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:39:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:39:13,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:39:13,916 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-11-30 00:39:13,917 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-11-30 00:39:13,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-11-30 00:39:13,918 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 00:39:13,918 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 00:39:13,919 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:39:13,919 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-30 00:39:13,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:39:13,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 307 transitions, 668 flow [2023-11-30 00:39:13,992 INFO L124 PetriNetUnfolderBase]: 19/383 cut-off events. [2023-11-30 00:39:13,992 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-30 00:39:13,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 383 events. 19/383 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1348 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 343. Up to 14 conditions per place. [2023-11-30 00:39:13,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 307 transitions, 668 flow [2023-11-30 00:39:13,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 307 places, 307 transitions, 668 flow [2023-11-30 00:39:13,999 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:39:14,000 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;@9d4e818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:39:14,000 INFO L363 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-30 00:39:14,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:39:14,007 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-30 00:39:14,007 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:39:14,007 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:39:14,007 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] [2023-11-30 00:39:14,007 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 18 more)] === [2023-11-30 00:39:14,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:39:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1717078523, now seen corresponding path program 1 times [2023-11-30 00:39:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:39:14,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651766680] [2023-11-30 00:39:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:39:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:39:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:39:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:39:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:39:14,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651766680] [2023-11-30 00:39:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651766680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:39:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:39:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:39:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241024785] [2023-11-30 00:39:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:39:14,028 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:39:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:39:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:39:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:39:14,029 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 307 [2023-11-30 00:39:14,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 307 transitions, 668 flow. Second operand has 2 states, 2 states have (on average 258.0) internal successors, (516), 2 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:39:14,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:39:14,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 307 [2023-11-30 00:39:14,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:39:55,981 INFO L124 PetriNetUnfolderBase]: 77259/275395 cut-off events. [2023-11-30 00:39:55,981 INFO L125 PetriNetUnfolderBase]: For 76431/76431 co-relation queries the response was YES. [2023-11-30 00:40:00,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395520 conditions, 275395 events. 77259/275395 cut-off events. For 76431/76431 co-relation queries the response was YES. Maximal size of possible extension queue 6412. Compared 4594591 event pairs, 74220 based on Foata normal form. 36973/300382 useless extension candidates. Maximal degree in co-relation 295409. Up to 93751 conditions per place. [2023-11-30 00:40:02,646 INFO L140 encePairwiseOnDemand]: 287/307 looper letters, 30 selfloop transitions, 0 changer transitions 0/282 dead transitions. [2023-11-30 00:40:02,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 282 transitions, 678 flow [2023-11-30 00:40:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:40:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:40:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 564 transitions. [2023-11-30 00:40:02,649 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9185667752442996 [2023-11-30 00:40:02,649 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 564 transitions. [2023-11-30 00:40:02,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 564 transitions. [2023-11-30 00:40:02,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:40:02,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 564 transitions. [2023-11-30 00:40:02,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 282.0) internal successors, (564), 2 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:40:02,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have 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:40:02,657 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have 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:40:02,657 INFO L307 CegarLoopForPetriNet]: 307 programPoint places, -17 predicate places. [2023-11-30 00:40:02,657 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 282 transitions, 678 flow [2023-11-30 00:40:02,657 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 258.0) internal successors, (516), 2 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:40:02,658 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:40:02,658 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] [2023-11-30 00:40:02,658 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 00:40:02,658 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 18 more)] === [2023-11-30 00:40:02,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:40:02,658 INFO L85 PathProgramCache]: Analyzing trace with hash 356895166, now seen corresponding path program 1 times [2023-11-30 00:40:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:40:02,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900006631] [2023-11-30 00:40:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:40:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:40:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:40:02,674 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:40:02,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:40:02,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900006631] [2023-11-30 00:40:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900006631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:40:02,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:40:02,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:40:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771973921] [2023-11-30 00:40:02,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:40:02,676 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:40:02,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:40:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:40:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:40:02,677 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 307 [2023-11-30 00:40:02,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 282 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have 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:40:02,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:40:02,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 307 [2023-11-30 00:40:02,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand