/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/14_spin2003.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 00:23:35,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 00:23:35,557 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:23:35,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 00:23:35,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 00:23:35,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 00:23:35,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 00:23:35,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 00:23:35,591 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 00:23:35,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 00:23:35,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 00:23:35,595 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 00:23:35,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 00:23:35,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 00:23:35,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 00:23:35,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 00:23:35,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 00:23:35,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 00:23:35,597 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 00:23:35,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 00:23:35,598 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 00:23:35,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 00:23:35,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 00:23:35,599 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 00:23:35,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 00:23:35,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:23:35,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 00:23:35,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 00:23:35,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 00:23:35,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 00:23:35,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 00:23:35,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 00:23:35,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 00:23:35,601 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:23:35,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 00:23:35,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 00:23:35,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 00:23:35,851 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 00:23:35,851 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 00:23:35,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i [2023-11-30 00:23:37,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 00:23:37,372 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 00:23:37,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i [2023-11-30 00:23:37,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c65bf470/f41cbf2776b4484b9fba7b7fba4c688a/FLAG83fe67355 [2023-11-30 00:23:37,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c65bf470/f41cbf2776b4484b9fba7b7fba4c688a [2023-11-30 00:23:37,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 00:23:37,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 00:23:37,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 00:23:37,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 00:23:37,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 00:23:37,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af6636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37, skipping insertion in model container [2023-11-30 00:23:37,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,457 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 00:23:37,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:23:37,692 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 00:23:37,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:23:37,767 INFO L206 MainTranslator]: Completed translation [2023-11-30 00:23:37,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37 WrapperNode [2023-11-30 00:23:37,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 00:23:37,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 00:23:37,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 00:23:37,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 00:23:37,774 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:23:37" (1/1) ... [2023-11-30 00:23:37,783 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:23:37" (1/1) ... [2023-11-30 00:23:37,806 INFO L138 Inliner]: procedures = 169, calls = 15, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 71 [2023-11-30 00:23:37,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 00:23:37,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 00:23:37,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 00:23:37,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 00:23:37,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 00:23:37,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 00:23:37,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 00:23:37,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 00:23:37,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (1/1) ... [2023-11-30 00:23:37,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:23:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 00:23:37,868 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:23:37,873 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:23:37,889 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 00:23:37,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 00:23:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 00:23:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 00:23:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 00:23:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 00:23:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 00:23:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 00:23:37,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 00:23:37,891 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:23:37,987 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 00:23:37,989 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 00:23:38,106 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 00:23:38,164 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 00:23:38,164 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-30 00:23:38,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:23:38 BoogieIcfgContainer [2023-11-30 00:23:38,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 00:23:38,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 00:23:38,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 00:23:38,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 00:23:38,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:23:37" (1/3) ... [2023-11-30 00:23:38,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b11c55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:23:38, skipping insertion in model container [2023-11-30 00:23:38,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:37" (2/3) ... [2023-11-30 00:23:38,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b11c55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:23:38, skipping insertion in model container [2023-11-30 00:23:38,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:23:38" (3/3) ... [2023-11-30 00:23:38,189 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2023-11-30 00:23:38,202 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 00:23:38,202 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-30 00:23:38,202 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 00:23:38,240 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:38,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 122 flow [2023-11-30 00:23:38,304 INFO L124 PetriNetUnfolderBase]: 4/70 cut-off events. [2023-11-30 00:23:38,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:23:38,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 4/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 46. Up to 4 conditions per place. [2023-11-30 00:23:38,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 59 transitions, 122 flow [2023-11-30 00:23:38,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 59 transitions, 122 flow [2023-11-30 00:23:38,335 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:38,341 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;@2d3985d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:38,342 INFO L363 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-30 00:23:38,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:38,365 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-11-30 00:23:38,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:23:38,365 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:38,366 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:38,366 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-30 00:23:38,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash -757099383, now seen corresponding path program 1 times [2023-11-30 00:23:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:38,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449898655] [2023-11-30 00:23:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:38,609 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:23:38,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:38,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449898655] [2023-11-30 00:23:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449898655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:38,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:38,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:23:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539536710] [2023-11-30 00:23:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:38,636 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:23:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:38,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:23:38,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:23:38,676 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 59 [2023-11-30 00:23:38,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:23:38,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:38,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 59 [2023-11-30 00:23:38,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:38,714 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2023-11-30 00:23:38,714 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:23:38,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 47 events. 0/47 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2023-11-30 00:23:38,716 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 3 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-11-30 00:23:38,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 96 flow [2023-11-30 00:23:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:23:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:23:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 105 transitions. [2023-11-30 00:23:38,726 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8898305084745762 [2023-11-30 00:23:38,727 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 105 transitions. [2023-11-30 00:23:38,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 105 transitions. [2023-11-30 00:23:38,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:38,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 105 transitions. [2023-11-30 00:23:38,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:23:38,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have 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:23:38,737 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have 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:23:38,739 INFO L307 CegarLoopForPetriNet]: 59 programPoint places, -12 predicate places. [2023-11-30 00:23:38,740 INFO L500 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 96 flow [2023-11-30 00:23:38,740 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:23:38,740 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:38,740 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:38,740 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 00:23:38,741 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-30 00:23:38,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2030254541, now seen corresponding path program 1 times [2023-11-30 00:23:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758710176] [2023-11-30 00:23:38,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:38,849 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:23:38,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758710176] [2023-11-30 00:23:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758710176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016570209] [2023-11-30 00:23:38,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:38,852 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:38,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:38,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:38,854 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 59 [2023-11-30 00:23:38,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:23:38,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:38,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 59 [2023-11-30 00:23:38,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:38,878 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2023-11-30 00:23:38,879 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 00:23:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 46 events. 0/46 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2023-11-30 00:23:38,879 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 11 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-30 00:23:38,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 120 flow [2023-11-30 00:23:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-30 00:23:38,881 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6892655367231638 [2023-11-30 00:23:38,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-30 00:23:38,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-30 00:23:38,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:38,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-30 00:23:38,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have 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:23:38,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:23:38,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:23:38,885 INFO L307 CegarLoopForPetriNet]: 59 programPoint places, -11 predicate places. [2023-11-30 00:23:38,885 INFO L500 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 120 flow [2023-11-30 00:23:38,886 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:23:38,886 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:38,886 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:38,886 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 00:23:38,886 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-30 00:23:38,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1071337540, now seen corresponding path program 1 times [2023-11-30 00:23:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:38,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554518740] [2023-11-30 00:23:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:38,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:38,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:23:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:38,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:23:38,935 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:23:38,936 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-30 00:23:38,938 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-30 00:23:38,938 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-30 00:23:38,938 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-30 00:23:38,938 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-30 00:23:38,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-30 00:23:38,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-30 00:23:38,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-30 00:23:38,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-30 00:23:38,939 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-30 00:23:38,940 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-30 00:23:38,940 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-30 00:23:38,940 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-30 00:23:38,940 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-30 00:23:38,940 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-30 00:23:38,941 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 00:23:38,941 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 00:23:38,943 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:23:38,943 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 00:23:38,966 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:38,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2023-11-30 00:23:38,989 INFO L124 PetriNetUnfolderBase]: 7/117 cut-off events. [2023-11-30 00:23:38,990 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 00:23:38,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 117 events. 7/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 251 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 79. Up to 6 conditions per place. [2023-11-30 00:23:38,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2023-11-30 00:23:38,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 93 transitions, 196 flow [2023-11-30 00:23:38,994 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:38,995 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;@2d3985d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:38,995 INFO L363 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-30 00:23:39,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:39,000 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-11-30 00:23:39,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:23:39,000 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:39,000 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:39,000 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-30 00:23:39,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash -368452310, now seen corresponding path program 1 times [2023-11-30 00:23:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:39,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129090894] [2023-11-30 00:23:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:39,051 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:23:39,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129090894] [2023-11-30 00:23:39,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129090894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:39,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:39,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:23:39,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190708214] [2023-11-30 00:23:39,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:39,053 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:23:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:39,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:23:39,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:23:39,054 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2023-11-30 00:23:39,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 196 flow. Second operand has 2 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:23:39,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:39,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2023-11-30 00:23:39,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:39,123 INFO L124 PetriNetUnfolderBase]: 6/153 cut-off events. [2023-11-30 00:23:39,123 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-30 00:23:39,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 153 events. 6/153 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 445 event pairs, 6 based on Foata normal form. 23/154 useless extension candidates. Maximal degree in co-relation 116. Up to 19 conditions per place. [2023-11-30 00:23:39,127 INFO L140 encePairwiseOnDemand]: 79/93 looper letters, 6 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-11-30 00:23:39,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 158 flow [2023-11-30 00:23:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:23:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:23:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 162 transitions. [2023-11-30 00:23:39,136 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2023-11-30 00:23:39,136 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 162 transitions. [2023-11-30 00:23:39,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 162 transitions. [2023-11-30 00:23:39,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:39,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 162 transitions. [2023-11-30 00:23:39,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:23:39,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:23:39,142 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:23:39,142 INFO L307 CegarLoopForPetriNet]: 93 programPoint places, -19 predicate places. [2023-11-30 00:23:39,143 INFO L500 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 158 flow [2023-11-30 00:23:39,143 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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:23:39,143 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:39,143 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:39,143 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 00:23:39,144 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-30 00:23:39,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -354322066, now seen corresponding path program 1 times [2023-11-30 00:23:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953502213] [2023-11-30 00:23:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:39,227 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:23:39,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:39,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953502213] [2023-11-30 00:23:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953502213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:39,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:39,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209595266] [2023-11-30 00:23:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:39,228 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:39,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:39,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:39,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:39,230 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 93 [2023-11-30 00:23:39,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have 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:23:39,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:39,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 93 [2023-11-30 00:23:39,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:39,414 INFO L124 PetriNetUnfolderBase]: 171/598 cut-off events. [2023-11-30 00:23:39,414 INFO L125 PetriNetUnfolderBase]: For 129/133 co-relation queries the response was YES. [2023-11-30 00:23:39,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 598 events. 171/598 cut-off events. For 129/133 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3441 event pairs, 112 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 659. Up to 317 conditions per place. [2023-11-30 00:23:39,421 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 34 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2023-11-30 00:23:39,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 82 transitions, 277 flow [2023-11-30 00:23:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2023-11-30 00:23:39,424 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6953405017921147 [2023-11-30 00:23:39,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 194 transitions. [2023-11-30 00:23:39,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 194 transitions. [2023-11-30 00:23:39,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:39,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 194 transitions. [2023-11-30 00:23:39,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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:23:39,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:23:39,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:23:39,431 INFO L307 CegarLoopForPetriNet]: 93 programPoint places, -17 predicate places. [2023-11-30 00:23:39,431 INFO L500 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 277 flow [2023-11-30 00:23:39,431 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have 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:23:39,432 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:39,432 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] [2023-11-30 00:23:39,432 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 00:23:39,432 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-30 00:23:39,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash 91560465, now seen corresponding path program 1 times [2023-11-30 00:23:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501552587] [2023-11-30 00:23:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:39,498 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:23:39,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501552587] [2023-11-30 00:23:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501552587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:39,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:39,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543966438] [2023-11-30 00:23:39,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:39,500 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:39,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:39,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:39,501 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 93 [2023-11-30 00:23:39,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have 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:23:39,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:39,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 93 [2023-11-30 00:23:39,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:39,678 INFO L124 PetriNetUnfolderBase]: 210/681 cut-off events. [2023-11-30 00:23:39,678 INFO L125 PetriNetUnfolderBase]: For 282/338 co-relation queries the response was YES. [2023-11-30 00:23:39,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 681 events. 210/681 cut-off events. For 282/338 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3970 event pairs, 108 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 1098. Up to 363 conditions per place. [2023-11-30 00:23:39,686 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 47 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2023-11-30 00:23:39,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 448 flow [2023-11-30 00:23:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2023-11-30 00:23:39,687 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6953405017921147 [2023-11-30 00:23:39,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 194 transitions. [2023-11-30 00:23:39,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 194 transitions. [2023-11-30 00:23:39,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:39,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 194 transitions. [2023-11-30 00:23:39,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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:23:39,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:23:39,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:23:39,693 INFO L307 CegarLoopForPetriNet]: 93 programPoint places, -15 predicate places. [2023-11-30 00:23:39,694 INFO L500 AbstractCegarLoop]: Abstraction has has 78 places, 96 transitions, 448 flow [2023-11-30 00:23:39,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have 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:23:39,694 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:39,694 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:23:39,695 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 00:23:39,695 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-30 00:23:39,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1813948008, now seen corresponding path program 1 times [2023-11-30 00:23:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300332624] [2023-11-30 00:23:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:23:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300332624] [2023-11-30 00:23:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300332624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535865808] [2023-11-30 00:23:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:39,735 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:39,737 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 93 [2023-11-30 00:23:39,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 96 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:23:39,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:39,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 93 [2023-11-30 00:23:39,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:39,848 INFO L124 PetriNetUnfolderBase]: 240/745 cut-off events. [2023-11-30 00:23:39,848 INFO L125 PetriNetUnfolderBase]: For 552/654 co-relation queries the response was YES. [2023-11-30 00:23:39,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 745 events. 240/745 cut-off events. For 552/654 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4389 event pairs, 118 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 2017. Up to 389 conditions per place. [2023-11-30 00:23:39,855 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 59 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2023-11-30 00:23:39,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 113 transitions, 688 flow [2023-11-30 00:23:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2023-11-30 00:23:39,857 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6917562724014337 [2023-11-30 00:23:39,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 193 transitions. [2023-11-30 00:23:39,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 193 transitions. [2023-11-30 00:23:39,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:39,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 193 transitions. [2023-11-30 00:23:39,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have 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:23:39,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:23:39,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:23:39,860 INFO L307 CegarLoopForPetriNet]: 93 programPoint places, -13 predicate places. [2023-11-30 00:23:39,860 INFO L500 AbstractCegarLoop]: Abstraction has has 80 places, 113 transitions, 688 flow [2023-11-30 00:23:39,860 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:23:39,860 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:39,860 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] [2023-11-30 00:23:39,860 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 00:23:39,862 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-30 00:23:39,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1339197561, now seen corresponding path program 1 times [2023-11-30 00:23:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:39,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261262937] [2023-11-30 00:23:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:39,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:23:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:39,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:23:39,911 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:23:39,913 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2023-11-30 00:23:39,913 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-30 00:23:39,913 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-30 00:23:39,914 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-30 00:23:39,915 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-30 00:23:39,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 00:23:39,916 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 00:23:39,916 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:23:39,916 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 00:23:39,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:39,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 127 transitions, 272 flow [2023-11-30 00:23:39,967 INFO L124 PetriNetUnfolderBase]: 10/164 cut-off events. [2023-11-30 00:23:39,967 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 00:23:39,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 164 events. 10/164 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 438 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2023-11-30 00:23:39,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 127 transitions, 272 flow [2023-11-30 00:23:39,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 127 transitions, 272 flow [2023-11-30 00:23:39,974 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:39,978 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;@2d3985d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:39,978 INFO L363 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-30 00:23:39,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:39,983 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-11-30 00:23:39,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:23:39,986 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:39,986 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:39,986 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:39,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1640105963, now seen corresponding path program 1 times [2023-11-30 00:23:39,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663096347] [2023-11-30 00:23:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:40,016 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:23:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663096347] [2023-11-30 00:23:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663096347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:23:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235264210] [2023-11-30 00:23:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:40,017 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:23:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:23:40,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:23:40,019 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 127 [2023-11-30 00:23:40,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 272 flow. Second operand has 2 states, 2 states have (on average 96.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:23:40,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:40,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 127 [2023-11-30 00:23:40,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:40,072 INFO L124 PetriNetUnfolderBase]: 42/496 cut-off events. [2023-11-30 00:23:40,072 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-30 00:23:40,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 496 events. 42/496 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2819 event pairs, 42 based on Foata normal form. 91/504 useless extension candidates. Maximal degree in co-relation 390. Up to 82 conditions per place. [2023-11-30 00:23:40,077 INFO L140 encePairwiseOnDemand]: 107/127 looper letters, 9 selfloop transitions, 0 changer transitions 0/93 dead transitions. [2023-11-30 00:23:40,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 222 flow [2023-11-30 00:23:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:23:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:23:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 219 transitions. [2023-11-30 00:23:40,079 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8622047244094488 [2023-11-30 00:23:40,079 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 219 transitions. [2023-11-30 00:23:40,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 219 transitions. [2023-11-30 00:23:40,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:40,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 219 transitions. [2023-11-30 00:23:40,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have 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:23:40,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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:23:40,081 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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:23:40,082 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -26 predicate places. [2023-11-30 00:23:40,082 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 222 flow [2023-11-30 00:23:40,082 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:23:40,083 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:40,083 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:40,083 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 00:23:40,083 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:40,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 558891887, now seen corresponding path program 1 times [2023-11-30 00:23:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046756641] [2023-11-30 00:23:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:40,117 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:23:40,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046756641] [2023-11-30 00:23:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046756641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:40,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257688220] [2023-11-30 00:23:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:40,118 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:40,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:40,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:40,119 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2023-11-30 00:23:40,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have 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:23:40,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:40,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2023-11-30 00:23:40,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:41,079 INFO L124 PetriNetUnfolderBase]: 4413/9526 cut-off events. [2023-11-30 00:23:41,079 INFO L125 PetriNetUnfolderBase]: For 2850/2888 co-relation queries the response was YES. [2023-11-30 00:23:41,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18520 conditions, 9526 events. 4413/9526 cut-off events. For 2850/2888 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 83994 event pairs, 3358 based on Foata normal form. 0/7432 useless extension candidates. Maximal degree in co-relation 8148. Up to 6015 conditions per place. [2023-11-30 00:23:41,172 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 55 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2023-11-30 00:23:41,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 119 transitions, 426 flow [2023-11-30 00:23:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-11-30 00:23:41,174 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6902887139107612 [2023-11-30 00:23:41,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-11-30 00:23:41,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-11-30 00:23:41,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:41,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-11-30 00:23:41,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have 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:23:41,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:41,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:41,178 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -24 predicate places. [2023-11-30 00:23:41,178 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 119 transitions, 426 flow [2023-11-30 00:23:41,178 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have 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:23:41,178 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:41,179 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] [2023-11-30 00:23:41,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 00:23:41,179 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:41,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash 695925103, now seen corresponding path program 1 times [2023-11-30 00:23:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:41,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771257973] [2023-11-30 00:23:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:41,223 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:23:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771257973] [2023-11-30 00:23:41,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771257973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:41,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:41,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931285420] [2023-11-30 00:23:41,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:41,225 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:41,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:41,226 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2023-11-30 00:23:41,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 119 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:23:41,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:41,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2023-11-30 00:23:41,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:42,701 INFO L124 PetriNetUnfolderBase]: 5526/11422 cut-off events. [2023-11-30 00:23:42,701 INFO L125 PetriNetUnfolderBase]: For 5032/6162 co-relation queries the response was YES. [2023-11-30 00:23:42,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30232 conditions, 11422 events. 5526/11422 cut-off events. For 5032/6162 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 100647 event pairs, 3716 based on Foata normal form. 0/8980 useless extension candidates. Maximal degree in co-relation 26783. Up to 7271 conditions per place. [2023-11-30 00:23:42,827 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 80 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-11-30 00:23:42,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 145 transitions, 730 flow [2023-11-30 00:23:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-11-30 00:23:42,832 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6902887139107612 [2023-11-30 00:23:42,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-11-30 00:23:42,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-11-30 00:23:42,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:42,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-11-30 00:23:42,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have 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:23:42,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:42,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:42,836 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -22 predicate places. [2023-11-30 00:23:42,836 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 145 transitions, 730 flow [2023-11-30 00:23:42,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:23:42,836 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:42,837 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:23:42,837 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 00:23:42,837 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:42,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash -331824569, now seen corresponding path program 1 times [2023-11-30 00:23:42,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:42,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397440339] [2023-11-30 00:23:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:23:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397440339] [2023-11-30 00:23:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397440339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705348518] [2023-11-30 00:23:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:42,864 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:42,865 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2023-11-30 00:23:42,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 145 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:23:42,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:42,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2023-11-30 00:23:42,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:44,318 INFO L124 PetriNetUnfolderBase]: 7203/14578 cut-off events. [2023-11-30 00:23:44,318 INFO L125 PetriNetUnfolderBase]: For 10206/13485 co-relation queries the response was YES. [2023-11-30 00:23:44,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47343 conditions, 14578 events. 7203/14578 cut-off events. For 10206/13485 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 129475 event pairs, 3454 based on Foata normal form. 16/11709 useless extension candidates. Maximal degree in co-relation 7110. Up to 8808 conditions per place. [2023-11-30 00:23:44,613 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 122 selfloop transitions, 19 changer transitions 0/198 dead transitions. [2023-11-30 00:23:44,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 198 transitions, 1369 flow [2023-11-30 00:23:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-11-30 00:23:44,614 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6876640419947506 [2023-11-30 00:23:44,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-11-30 00:23:44,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-11-30 00:23:44,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:44,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-11-30 00:23:44,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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:23:44,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:44,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:44,618 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -20 predicate places. [2023-11-30 00:23:44,618 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 198 transitions, 1369 flow [2023-11-30 00:23:44,618 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:23:44,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:44,618 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:44,618 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 00:23:44,618 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:44,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash 498115124, now seen corresponding path program 1 times [2023-11-30 00:23:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966593485] [2023-11-30 00:23:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:44,648 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:23:44,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966593485] [2023-11-30 00:23:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966593485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:44,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529027171] [2023-11-30 00:23:44,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:44,652 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:44,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:44,653 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 127 [2023-11-30 00:23:44,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 198 transitions, 1369 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 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:23:44,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:44,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 127 [2023-11-30 00:23:44,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:46,736 INFO L124 PetriNetUnfolderBase]: 8652/18695 cut-off events. [2023-11-30 00:23:46,737 INFO L125 PetriNetUnfolderBase]: For 21540/27565 co-relation queries the response was YES. [2023-11-30 00:23:46,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70485 conditions, 18695 events. 8652/18695 cut-off events. For 21540/27565 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 181654 event pairs, 2281 based on Foata normal form. 77/15594 useless extension candidates. Maximal degree in co-relation 16781. Up to 10846 conditions per place. [2023-11-30 00:23:46,952 INFO L140 encePairwiseOnDemand]: 112/127 looper letters, 204 selfloop transitions, 40 changer transitions 0/304 dead transitions. [2023-11-30 00:23:46,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 304 transitions, 2788 flow [2023-11-30 00:23:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-11-30 00:23:46,954 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7217847769028871 [2023-11-30 00:23:46,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-11-30 00:23:46,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-11-30 00:23:46,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:46,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-11-30 00:23:46,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:23:46,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:46,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:46,956 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -18 predicate places. [2023-11-30 00:23:46,957 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 304 transitions, 2788 flow [2023-11-30 00:23:46,957 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 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:23:46,957 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:46,957 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, 1, 1, 1, 1, 1] [2023-11-30 00:23:46,957 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 00:23:46,957 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:46,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1294162898, now seen corresponding path program 1 times [2023-11-30 00:23:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476697141] [2023-11-30 00:23:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:23:47,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:47,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476697141] [2023-11-30 00:23:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476697141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:47,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:47,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 00:23:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766506494] [2023-11-30 00:23:47,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:47,021 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:47,023 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 127 [2023-11-30 00:23:47,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 304 transitions, 2788 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have 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:23:47,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:47,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 127 [2023-11-30 00:23:47,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:47,084 INFO L124 PetriNetUnfolderBase]: 63/483 cut-off events. [2023-11-30 00:23:47,084 INFO L125 PetriNetUnfolderBase]: For 2747/2863 co-relation queries the response was YES. [2023-11-30 00:23:47,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 483 events. 63/483 cut-off events. For 2747/2863 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2824 event pairs, 11 based on Foata normal form. 142/589 useless extension candidates. Maximal degree in co-relation 497. Up to 207 conditions per place. [2023-11-30 00:23:47,086 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 15 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2023-11-30 00:23:47,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 775 flow [2023-11-30 00:23:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-11-30 00:23:47,087 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7795275590551181 [2023-11-30 00:23:47,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-11-30 00:23:47,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-11-30 00:23:47,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:47,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-11-30 00:23:47,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have 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:23:47,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:47,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:47,090 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -22 predicate places. [2023-11-30 00:23:47,090 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 775 flow [2023-11-30 00:23:47,090 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have 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:23:47,091 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:47,091 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, 1, 1, 1, 1, 1] [2023-11-30 00:23:47,091 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 00:23:47,091 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:47,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1697625736, now seen corresponding path program 1 times [2023-11-30 00:23:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:47,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942957884] [2023-11-30 00:23:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:23:47,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:47,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942957884] [2023-11-30 00:23:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942957884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:47,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:47,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909719642] [2023-11-30 00:23:47,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:47,120 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:47,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:47,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:47,122 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2023-11-30 00:23:47,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 104 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have 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:23:47,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:47,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2023-11-30 00:23:47,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:47,194 INFO L124 PetriNetUnfolderBase]: 65/455 cut-off events. [2023-11-30 00:23:47,195 INFO L125 PetriNetUnfolderBase]: For 2474/2606 co-relation queries the response was YES. [2023-11-30 00:23:47,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 455 events. 65/455 cut-off events. For 2474/2606 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2549 event pairs, 19 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 549. Up to 203 conditions per place. [2023-11-30 00:23:47,197 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 47 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2023-11-30 00:23:47,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 884 flow [2023-11-30 00:23:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2023-11-30 00:23:47,199 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6062992125984252 [2023-11-30 00:23:47,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 231 transitions. [2023-11-30 00:23:47,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 231 transitions. [2023-11-30 00:23:47,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:47,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 231 transitions. [2023-11-30 00:23:47,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:23:47,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:47,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:47,203 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -21 predicate places. [2023-11-30 00:23:47,203 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 884 flow [2023-11-30 00:23:47,203 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have 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:23:47,203 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:47,203 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:23:47,204 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 00:23:47,204 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:47,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash 629904208, now seen corresponding path program 1 times [2023-11-30 00:23:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:47,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853877849] [2023-11-30 00:23:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 00:23:47,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:47,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853877849] [2023-11-30 00:23:47,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853877849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:47,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:47,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:47,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734563605] [2023-11-30 00:23:47,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:47,239 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:47,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:47,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:47,240 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2023-11-30 00:23:47,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:23:47,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:47,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2023-11-30 00:23:47,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:47,346 INFO L124 PetriNetUnfolderBase]: 65/451 cut-off events. [2023-11-30 00:23:47,346 INFO L125 PetriNetUnfolderBase]: For 3122/3302 co-relation queries the response was YES. [2023-11-30 00:23:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 451 events. 65/451 cut-off events. For 3122/3302 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2534 event pairs, 19 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 597. Up to 203 conditions per place. [2023-11-30 00:23:47,349 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 45 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2023-11-30 00:23:47,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 968 flow [2023-11-30 00:23:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2023-11-30 00:23:47,363 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6010498687664042 [2023-11-30 00:23:47,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2023-11-30 00:23:47,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2023-11-30 00:23:47,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:47,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2023-11-30 00:23:47,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:23:47,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:47,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:23:47,366 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -20 predicate places. [2023-11-30 00:23:47,366 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 968 flow [2023-11-30 00:23:47,367 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:23:47,367 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:47,367 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] [2023-11-30 00:23:47,367 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 00:23:47,367 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:23:47,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash 610150463, now seen corresponding path program 1 times [2023-11-30 00:23:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875034104] [2023-11-30 00:23:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:47,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:47,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:23:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:47,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:23:47,396 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:23:47,396 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2023-11-30 00:23:47,396 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2023-11-30 00:23:47,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2023-11-30 00:23:47,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2023-11-30 00:23:47,399 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2023-11-30 00:23:47,399 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2023-11-30 00:23:47,399 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2023-11-30 00:23:47,399 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2023-11-30 00:23:47,399 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2023-11-30 00:23:47,399 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2023-11-30 00:23:47,399 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2023-11-30 00:23:47,400 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2023-11-30 00:23:47,400 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2023-11-30 00:23:47,400 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 00:23:47,400 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:47,400 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:23:47,401 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 00:23:47,436 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:47,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 161 transitions, 350 flow [2023-11-30 00:23:47,458 INFO L124 PetriNetUnfolderBase]: 13/211 cut-off events. [2023-11-30 00:23:47,458 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 00:23:47,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 211 events. 13/211 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 638 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 172. Up to 10 conditions per place. [2023-11-30 00:23:47,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 161 transitions, 350 flow [2023-11-30 00:23:47,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 161 transitions, 350 flow [2023-11-30 00:23:47,463 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:47,463 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;@2d3985d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:47,463 INFO L363 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2023-11-30 00:23:47,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:47,465 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-11-30 00:23:47,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:23:47,465 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:47,466 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:47,466 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:23:47,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 973610252, now seen corresponding path program 1 times [2023-11-30 00:23:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492065598] [2023-11-30 00:23:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:47,481 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:23:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492065598] [2023-11-30 00:23:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492065598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:23:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227672945] [2023-11-30 00:23:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:47,482 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:23:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:23:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:23:47,483 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2023-11-30 00:23:47,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 161 transitions, 350 flow. Second operand has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:23:47,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:47,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2023-11-30 00:23:47,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:47,649 INFO L124 PetriNetUnfolderBase]: 204/1586 cut-off events. [2023-11-30 00:23:47,650 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-11-30 00:23:47,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2098 conditions, 1586 events. 204/1586 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 13109 event pairs, 204 based on Foata normal form. 341/1653 useless extension candidates. Maximal degree in co-relation 1282. Up to 325 conditions per place. [2023-11-30 00:23:47,667 INFO L140 encePairwiseOnDemand]: 135/161 looper letters, 12 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-11-30 00:23:47,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 118 transitions, 288 flow [2023-11-30 00:23:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:23:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:23:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 276 transitions. [2023-11-30 00:23:47,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2023-11-30 00:23:47,669 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 276 transitions. [2023-11-30 00:23:47,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 276 transitions. [2023-11-30 00:23:47,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:47,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 276 transitions. [2023-11-30 00:23:47,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:23:47,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have 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:23:47,672 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have 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:23:47,673 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -33 predicate places. [2023-11-30 00:23:47,673 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 118 transitions, 288 flow [2023-11-30 00:23:47,673 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:23:47,673 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:47,673 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:47,673 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 00:23:47,673 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:23:47,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1867530096, now seen corresponding path program 1 times [2023-11-30 00:23:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:47,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870335409] [2023-11-30 00:23:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:47,695 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:23:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870335409] [2023-11-30 00:23:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870335409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:47,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:47,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523587872] [2023-11-30 00:23:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:47,696 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:47,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:47,697 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 161 [2023-11-30 00:23:47,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 118 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have 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:23:47,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:47,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 161 [2023-11-30 00:23:47,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:59,955 INFO L124 PetriNetUnfolderBase]: 80937/142445 cut-off events. [2023-11-30 00:23:59,956 INFO L125 PetriNetUnfolderBase]: For 51261/51457 co-relation queries the response was YES. [2023-11-30 00:24:00,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286584 conditions, 142445 events. 80937/142445 cut-off events. For 51261/51457 co-relation queries the response was YES. Maximal size of possible extension queue 3936. Compared 1492524 event pairs, 64468 based on Foata normal form. 0/109706 useless extension candidates. Maximal degree in co-relation 125317. Up to 97787 conditions per place. [2023-11-30 00:24:01,338 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 76 selfloop transitions, 12 changer transitions 0/156 dead transitions. [2023-11-30 00:24:01,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 156 transitions, 579 flow [2023-11-30 00:24:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:24:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:24:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-30 00:24:01,339 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6873706004140787 [2023-11-30 00:24:01,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-30 00:24:01,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-30 00:24:01,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:24:01,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-30 00:24:01,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:24:01,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:24:01,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:24:01,343 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -31 predicate places. [2023-11-30 00:24:01,343 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 156 transitions, 579 flow [2023-11-30 00:24:01,343 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have 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:24:01,343 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:24:01,343 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] [2023-11-30 00:24:01,343 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 00:24:01,343 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:24:01,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:24:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1153579312, now seen corresponding path program 1 times [2023-11-30 00:24:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:24:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244691040] [2023-11-30 00:24:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:24:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:24:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:24:01,367 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:24:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:24:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244691040] [2023-11-30 00:24:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244691040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:24:01,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:24:01,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:24:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882040500] [2023-11-30 00:24:01,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:24:01,369 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:24:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:24:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:24:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:24:01,370 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 161 [2023-11-30 00:24:01,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 156 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:24:01,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:24:01,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 161 [2023-11-30 00:24:01,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:24:17,321 INFO L124 PetriNetUnfolderBase]: 101550/174588 cut-off events. [2023-11-30 00:24:17,321 INFO L125 PetriNetUnfolderBase]: For 82018/97083 co-relation queries the response was YES. [2023-11-30 00:24:18,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481919 conditions, 174588 events. 101550/174588 cut-off events. For 82018/97083 co-relation queries the response was YES. Maximal size of possible extension queue 4624. Compared 1821325 event pairs, 70479 based on Foata normal form. 1/135394 useless extension candidates. Maximal degree in co-relation 254953. Up to 120255 conditions per place. [2023-11-30 00:24:19,605 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 113 selfloop transitions, 12 changer transitions 0/194 dead transitions. [2023-11-30 00:24:19,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 194 transitions, 1018 flow [2023-11-30 00:24:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:24:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:24:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-30 00:24:19,606 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6873706004140787 [2023-11-30 00:24:19,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-30 00:24:19,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-30 00:24:19,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:24:19,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-30 00:24:19,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:24:19,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:24:19,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:24:19,609 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -29 predicate places. [2023-11-30 00:24:19,609 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 194 transitions, 1018 flow [2023-11-30 00:24:19,609 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:24:19,610 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:24:19,610 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:24:19,610 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 00:24:19,610 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:24:19,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:24:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1712934504, now seen corresponding path program 1 times [2023-11-30 00:24:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:24:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238571741] [2023-11-30 00:24:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:24:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:24:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:24:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:24:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:24:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238571741] [2023-11-30 00:24:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238571741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:24:19,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:24:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:24:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539529587] [2023-11-30 00:24:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:24:19,632 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:24:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:24:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:24:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:24:19,633 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 161 [2023-11-30 00:24:19,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 194 transitions, 1018 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:24:19,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:24:19,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 161 [2023-11-30 00:24:19,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:24:40,916 INFO L124 PetriNetUnfolderBase]: 134943/226097 cut-off events. [2023-11-30 00:24:40,916 INFO L125 PetriNetUnfolderBase]: For 150868/212950 co-relation queries the response was YES. [2023-11-30 00:24:42,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782069 conditions, 226097 events. 134943/226097 cut-off events. For 150868/212950 co-relation queries the response was YES. Maximal size of possible extension queue 5556. Compared 2333469 event pairs, 74759 based on Foata normal form. 176/177880 useless extension candidates. Maximal degree in co-relation 120891. Up to 151204 conditions per place. [2023-11-30 00:24:44,338 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 185 selfloop transitions, 28 changer transitions 0/283 dead transitions. [2023-11-30 00:24:44,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 283 transitions, 2062 flow [2023-11-30 00:24:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:24:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:24:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-11-30 00:24:44,340 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6853002070393375 [2023-11-30 00:24:44,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-11-30 00:24:44,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-11-30 00:24:44,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:24:44,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-11-30 00:24:44,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:24:44,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:24:44,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:24:44,342 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -27 predicate places. [2023-11-30 00:24:44,342 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 283 transitions, 2062 flow [2023-11-30 00:24:44,342 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:24:44,343 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:24:44,343 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:24:44,343 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 00:24:44,343 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:24:44,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:24:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2046316715, now seen corresponding path program 1 times [2023-11-30 00:24:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:24:44,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774346043] [2023-11-30 00:24:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:24:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:24:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:24:44,362 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:24:44,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:24:44,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774346043] [2023-11-30 00:24:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774346043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:24:44,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:24:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:24:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327958234] [2023-11-30 00:24:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:24:44,363 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:24:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:24:44,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:24:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:24:44,363 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 161 [2023-11-30 00:24:44,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 283 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have 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:24:44,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:24:44,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 161 [2023-11-30 00:24:44,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:29,271 INFO L124 PetriNetUnfolderBase]: 188127/338543 cut-off events. [2023-11-30 00:25:29,272 INFO L125 PetriNetUnfolderBase]: For 348357/494732 co-relation queries the response was YES. [2023-11-30 00:25:31,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354185 conditions, 338543 events. 188127/338543 cut-off events. For 348357/494732 co-relation queries the response was YES. Maximal size of possible extension queue 8981. Compared 3959689 event pairs, 50525 based on Foata normal form. 963/275613 useless extension candidates. Maximal degree in co-relation 753310. Up to 214615 conditions per place. [2023-11-30 00:25:34,916 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 330 selfloop transitions, 68 changer transitions 0/471 dead transitions. [2023-11-30 00:25:34,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 471 transitions, 4539 flow [2023-11-30 00:25:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:25:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:25:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-11-30 00:25:34,917 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7122153209109731 [2023-11-30 00:25:34,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-11-30 00:25:34,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-11-30 00:25:34,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:34,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-11-30 00:25:34,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:25:34,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:34,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:34,920 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -25 predicate places. [2023-11-30 00:25:34,920 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 471 transitions, 4539 flow [2023-11-30 00:25:34,920 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have 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:25:34,920 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:34,920 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, 1, 1, 1, 1, 1] [2023-11-30 00:25:34,920 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 00:25:34,921 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:25:34,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash 290672357, now seen corresponding path program 1 times [2023-11-30 00:25:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923448027] [2023-11-30 00:25:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:34,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:25:34,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:34,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923448027] [2023-11-30 00:25:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923448027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:34,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 00:25:34,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332517019] [2023-11-30 00:25:34,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:34,956 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:25:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:34,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:25:34,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:25:34,957 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 161 [2023-11-30 00:25:34,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 471 transitions, 4539 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:25:34,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:34,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 161 [2023-11-30 00:25:34,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:35,135 INFO L124 PetriNetUnfolderBase]: 207/1277 cut-off events. [2023-11-30 00:25:35,135 INFO L125 PetriNetUnfolderBase]: For 9349/9892 co-relation queries the response was YES. [2023-11-30 00:25:35,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5350 conditions, 1277 events. 207/1277 cut-off events. For 9349/9892 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9917 event pairs, 31 based on Foata normal form. 613/1773 useless extension candidates. Maximal degree in co-relation 1784. Up to 623 conditions per place. [2023-11-30 00:25:35,143 INFO L140 encePairwiseOnDemand]: 153/161 looper letters, 22 selfloop transitions, 12 changer transitions 0/136 dead transitions. [2023-11-30 00:25:35,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 136 transitions, 1095 flow [2023-11-30 00:25:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:25:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:25:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-30 00:25:35,144 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7743271221532091 [2023-11-30 00:25:35,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-30 00:25:35,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-30 00:25:35,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:35,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-30 00:25:35,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have 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:25:35,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,147 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -30 predicate places. [2023-11-30 00:25:35,147 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 1095 flow [2023-11-30 00:25:35,147 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:25:35,147 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:35,147 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, 1, 1, 1, 1, 1] [2023-11-30 00:25:35,147 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-30 00:25:35,148 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:25:35,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1992301113, now seen corresponding path program 1 times [2023-11-30 00:25:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813781155] [2023-11-30 00:25:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:25:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813781155] [2023-11-30 00:25:35,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813781155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:35,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:35,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:25:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340831139] [2023-11-30 00:25:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:35,175 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:25:35,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:25:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:25:35,176 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 161 [2023-11-30 00:25:35,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 1095 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:25:35,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:35,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 161 [2023-11-30 00:25:35,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:35,423 INFO L124 PetriNetUnfolderBase]: 213/1347 cut-off events. [2023-11-30 00:25:35,423 INFO L125 PetriNetUnfolderBase]: For 8196/8808 co-relation queries the response was YES. [2023-11-30 00:25:35,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6083 conditions, 1347 events. 213/1347 cut-off events. For 8196/8808 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10681 event pairs, 38 based on Foata normal form. 2/1247 useless extension candidates. Maximal degree in co-relation 2026. Up to 615 conditions per place. [2023-11-30 00:25:35,427 INFO L140 encePairwiseOnDemand]: 158/161 looper letters, 67 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2023-11-30 00:25:35,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 137 transitions, 1267 flow [2023-11-30 00:25:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:25:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:25:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-11-30 00:25:35,429 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5962732919254659 [2023-11-30 00:25:35,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-11-30 00:25:35,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-11-30 00:25:35,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:35,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-11-30 00:25:35,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 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:25:35,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,431 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -29 predicate places. [2023-11-30 00:25:35,431 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 1267 flow [2023-11-30 00:25:35,431 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:25:35,432 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:35,432 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:25:35,432 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-30 00:25:35,432 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:25:35,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1643906031, now seen corresponding path program 1 times [2023-11-30 00:25:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:35,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109767764] [2023-11-30 00:25:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 00:25:35,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:35,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109767764] [2023-11-30 00:25:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109767764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:35,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:25:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906572899] [2023-11-30 00:25:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:35,454 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:25:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:35,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:25:35,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:25:35,455 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 161 [2023-11-30 00:25:35,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 1267 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:25:35,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:35,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 161 [2023-11-30 00:25:35,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:35,626 INFO L124 PetriNetUnfolderBase]: 217/1365 cut-off events. [2023-11-30 00:25:35,626 INFO L125 PetriNetUnfolderBase]: For 10566/11063 co-relation queries the response was YES. [2023-11-30 00:25:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 1365 events. 217/1365 cut-off events. For 10566/11063 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10766 event pairs, 24 based on Foata normal form. 1/1272 useless extension candidates. Maximal degree in co-relation 2241. Up to 611 conditions per place. [2023-11-30 00:25:35,635 INFO L140 encePairwiseOnDemand]: 158/161 looper letters, 66 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2023-11-30 00:25:35,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 137 transitions, 1418 flow [2023-11-30 00:25:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:25:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:25:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-11-30 00:25:35,636 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5921325051759835 [2023-11-30 00:25:35,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-11-30 00:25:35,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-11-30 00:25:35,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:35,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-11-30 00:25:35,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have 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:25:35,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,638 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -28 predicate places. [2023-11-30 00:25:35,638 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 137 transitions, 1418 flow [2023-11-30 00:25:35,639 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:25:35,639 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:35,639 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, 1, 1, 1, 1, 1] [2023-11-30 00:25:35,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-30 00:25:35,639 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:25:35,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash -231016819, now seen corresponding path program 1 times [2023-11-30 00:25:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710848924] [2023-11-30 00:25:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 00:25:35,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:35,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710848924] [2023-11-30 00:25:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710848924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:25:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79450274] [2023-11-30 00:25:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:35,679 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:25:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:35,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:25:35,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:25:35,679 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 161 [2023-11-30 00:25:35,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 137 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have 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:25:35,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:35,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 161 [2023-11-30 00:25:35,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:35,829 INFO L124 PetriNetUnfolderBase]: 221/1306 cut-off events. [2023-11-30 00:25:35,829 INFO L125 PetriNetUnfolderBase]: For 12878/13493 co-relation queries the response was YES. [2023-11-30 00:25:35,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 1306 events. 221/1306 cut-off events. For 12878/13493 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10174 event pairs, 24 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 2431. Up to 603 conditions per place. [2023-11-30 00:25:35,834 INFO L140 encePairwiseOnDemand]: 158/161 looper letters, 67 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2023-11-30 00:25:35,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 1569 flow [2023-11-30 00:25:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:25:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:25:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-11-30 00:25:35,836 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5900621118012422 [2023-11-30 00:25:35,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-11-30 00:25:35,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-11-30 00:25:35,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:35,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-11-30 00:25:35,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have 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:25:35,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:35,838 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -27 predicate places. [2023-11-30 00:25:35,838 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 1569 flow [2023-11-30 00:25:35,838 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have 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:25:35,838 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:35,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:25:35,838 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-30 00:25:35,838 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:25:35,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2125176009, now seen corresponding path program 1 times [2023-11-30 00:25:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:35,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53715212] [2023-11-30 00:25:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-30 00:25:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53715212] [2023-11-30 00:25:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53715212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:35,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:35,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:25:35,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348347128] [2023-11-30 00:25:35,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:35,864 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:25:35,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:35,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:25:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:25:35,865 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 161 [2023-11-30 00:25:35,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 1569 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:25:35,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:35,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 161 [2023-11-30 00:25:35,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:36,032 INFO L124 PetriNetUnfolderBase]: 221/1244 cut-off events. [2023-11-30 00:25:36,032 INFO L125 PetriNetUnfolderBase]: For 15312/16844 co-relation queries the response was YES. [2023-11-30 00:25:36,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7789 conditions, 1244 events. 221/1244 cut-off events. For 15312/16844 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9629 event pairs, 9 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 2609. Up to 603 conditions per place. [2023-11-30 00:25:36,040 INFO L140 encePairwiseOnDemand]: 158/161 looper letters, 65 selfloop transitions, 3 changer transitions 0/136 dead transitions. [2023-11-30 00:25:36,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 136 transitions, 1689 flow [2023-11-30 00:25:36,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:25:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:25:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-11-30 00:25:36,041 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5859213250517599 [2023-11-30 00:25:36,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-11-30 00:25:36,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-11-30 00:25:36,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:36,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-11-30 00:25:36,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have 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:25:36,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:36,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:25:36,043 INFO L307 CegarLoopForPetriNet]: 161 programPoint places, -26 predicate places. [2023-11-30 00:25:36,043 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 136 transitions, 1689 flow [2023-11-30 00:25:36,043 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:25:36,043 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:36,043 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] [2023-11-30 00:25:36,043 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-30 00:25:36,043 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:25:36,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash -480168184, now seen corresponding path program 1 times [2023-11-30 00:25:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110107144] [2023-11-30 00:25:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:25:36,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:25:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:25:36,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:25:36,069 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2023-11-30 00:25:36,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2023-11-30 00:25:36,070 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2023-11-30 00:25:36,071 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2023-11-30 00:25:36,072 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2023-11-30 00:25:36,072 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2023-11-30 00:25:36,072 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2023-11-30 00:25:36,072 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-30 00:25:36,072 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:25:36,072 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:25:36,072 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 00:25:36,099 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:25:36,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 195 transitions, 430 flow [2023-11-30 00:25:36,122 INFO L124 PetriNetUnfolderBase]: 16/258 cut-off events. [2023-11-30 00:25:36,122 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 00:25:36,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 258 events. 16/258 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 823 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 224. Up to 12 conditions per place. [2023-11-30 00:25:36,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 195 transitions, 430 flow [2023-11-30 00:25:36,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 195 transitions, 430 flow [2023-11-30 00:25:36,127 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:25:36,127 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;@2d3985d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:25:36,127 INFO L363 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2023-11-30 00:25:36,128 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:25:36,128 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-11-30 00:25:36,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:25:36,128 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:36,128 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:25:36,129 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2023-11-30 00:25:36,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1927024685, now seen corresponding path program 1 times [2023-11-30 00:25:36,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:36,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772937896] [2023-11-30 00:25:36,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:36,139 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:25:36,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:36,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772937896] [2023-11-30 00:25:36,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772937896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:36,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:36,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:25:36,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352741432] [2023-11-30 00:25:36,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:36,140 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:25:36,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:25:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:25:36,140 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 195 [2023-11-30 00:25:36,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 430 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:25:36,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:36,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 195 [2023-11-30 00:25:36,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:36,596 INFO L124 PetriNetUnfolderBase]: 852/5025 cut-off events. [2023-11-30 00:25:36,596 INFO L125 PetriNetUnfolderBase]: For 1559/1559 co-relation queries the response was YES. [2023-11-30 00:25:36,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6915 conditions, 5025 events. 852/5025 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 53398 event pairs, 852 based on Foata normal form. 1214/5381 useless extension candidates. Maximal degree in co-relation 4172. Up to 1216 conditions per place. [2023-11-30 00:25:36,643 INFO L140 encePairwiseOnDemand]: 163/195 looper letters, 15 selfloop transitions, 0 changer transitions 0/143 dead transitions. [2023-11-30 00:25:36,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 143 transitions, 356 flow [2023-11-30 00:25:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:25:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:25:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2023-11-30 00:25:36,645 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8538461538461538 [2023-11-30 00:25:36,645 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 333 transitions. [2023-11-30 00:25:36,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 333 transitions. [2023-11-30 00:25:36,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:36,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 333 transitions. [2023-11-30 00:25:36,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:25:36,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:25:36,646 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:25:36,647 INFO L307 CegarLoopForPetriNet]: 195 programPoint places, -40 predicate places. [2023-11-30 00:25:36,647 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 356 flow [2023-11-30 00:25:36,647 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:25:36,647 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:36,647 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:25:36,647 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-30 00:25:36,647 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2023-11-30 00:25:36,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1972415567, now seen corresponding path program 1 times [2023-11-30 00:25:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104422902] [2023-11-30 00:25:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:36,665 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:25:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:36,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104422902] [2023-11-30 00:25:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104422902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:36,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:25:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729139980] [2023-11-30 00:25:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:36,666 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:25:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:25:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:25:36,667 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2023-11-30 00:25:36,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have 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:25:36,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:36,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2023-11-30 00:25:36,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand