/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 02:46:19,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 02:46:19,773 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 02:46:19,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 02:46:19,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 02:46:19,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 02:46:19,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 02:46:19,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 02:46:19,788 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 02:46:19,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 02:46:19,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 02:46:19,789 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 02:46:19,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 02:46:19,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 02:46:19,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 02:46:19,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 02:46:19,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 02:46:19,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 02:46:19,791 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 02:46:19,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 02:46:19,791 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 02:46:19,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 02:46:19,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 02:46:19,792 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 02:46:19,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 02:46:19,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:46:19,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 02:46:19,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 02:46:19,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 02:46:19,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 02:46:19,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 02:46:19,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 02:46:19,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 02:46:19,794 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 02:46:19,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 02:46:19,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 02:46:19,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 02:46:19,935 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 02:46:19,935 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 02:46:19,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2023-11-30 02:46:20,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 02:46:21,079 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 02:46:21,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2023-11-30 02:46:21,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2d5a1fd/7593275f33e441afacd57eee21fd7613/FLAG610895465 [2023-11-30 02:46:21,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2d5a1fd/7593275f33e441afacd57eee21fd7613 [2023-11-30 02:46:21,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 02:46:21,476 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 02:46:21,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 02:46:21,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 02:46:21,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 02:46:21,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c1eca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21, skipping insertion in model container [2023-11-30 02:46:21,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 02:46:21,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:46:21,628 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 02:46:21,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:46:21,658 INFO L206 MainTranslator]: Completed translation [2023-11-30 02:46:21,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21 WrapperNode [2023-11-30 02:46:21,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 02:46:21,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 02:46:21,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 02:46:21,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 02:46:21,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,691 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 299 [2023-11-30 02:46:21,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 02:46:21,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 02:46:21,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 02:46:21,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 02:46:21,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 02:46:21,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 02:46:21,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 02:46:21,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 02:46:21,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (1/1) ... [2023-11-30 02:46:21,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:46:21,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:46:21,740 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 02:46:21,750 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 02:46:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 02:46:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 02:46:21,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 02:46:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 02:46:21,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 02:46:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 02:46:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 02:46:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 02:46:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 02:46:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 02:46:21,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 02:46:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 02:46:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 02:46:21,767 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 02:46:21,832 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 02:46:21,833 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 02:46:22,242 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 02:46:22,255 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 02:46:22,255 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 02:46:22,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:46:22 BoogieIcfgContainer [2023-11-30 02:46:22,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 02:46:22,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 02:46:22,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 02:46:22,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 02:46:22,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:46:21" (1/3) ... [2023-11-30 02:46:22,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a78b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:46:22, skipping insertion in model container [2023-11-30 02:46:22,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:46:21" (2/3) ... [2023-11-30 02:46:22,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a78b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:46:22, skipping insertion in model container [2023-11-30 02:46:22,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:46:22" (3/3) ... [2023-11-30 02:46:22,263 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2023-11-30 02:46:22,274 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 02:46:22,274 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-30 02:46:22,274 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 02:46:22,406 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 02:46:22,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 354 places, 366 transitions, 746 flow [2023-11-30 02:46:22,561 INFO L124 PetriNetUnfolderBase]: 19/364 cut-off events. [2023-11-30 02:46:22,561 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 02:46:22,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 364 events. 19/364 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 664 event pairs, 0 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 236. Up to 3 conditions per place. [2023-11-30 02:46:22,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 354 places, 366 transitions, 746 flow [2023-11-30 02:46:22,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 332 places, 343 transitions, 698 flow [2023-11-30 02:46:22,592 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 02:46:22,598 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;@1095f367, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 02:46:22,599 INFO L363 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-11-30 02:46:22,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 02:46:22,608 INFO L124 PetriNetUnfolderBase]: 3/59 cut-off events. [2023-11-30 02:46:22,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 02:46:22,609 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:22,609 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:22,610 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:22,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1445971493, now seen corresponding path program 1 times [2023-11-30 02:46:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652562481] [2023-11-30 02:46:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:22,787 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 02:46:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652562481] [2023-11-30 02:46:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652562481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:22,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:46:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898128355] [2023-11-30 02:46:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:22,796 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:46:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:46:22,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:46:22,822 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 366 [2023-11-30 02:46:22,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 343 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:22,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:22,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 366 [2023-11-30 02:46:22,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:23,037 INFO L124 PetriNetUnfolderBase]: 109/1135 cut-off events. [2023-11-30 02:46:23,037 INFO L125 PetriNetUnfolderBase]: For 72/73 co-relation queries the response was YES. [2023-11-30 02:46:23,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1135 events. 109/1135 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6008 event pairs, 48 based on Foata normal form. 43/964 useless extension candidates. Maximal degree in co-relation 1014. Up to 149 conditions per place. [2023-11-30 02:46:23,050 INFO L140 encePairwiseOnDemand]: 353/366 looper letters, 19 selfloop transitions, 2 changer transitions 4/332 dead transitions. [2023-11-30 02:46:23,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 332 transitions, 718 flow [2023-11-30 02:46:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:46:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:46:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2023-11-30 02:46:23,065 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9335154826958105 [2023-11-30 02:46:23,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1025 transitions. [2023-11-30 02:46:23,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1025 transitions. [2023-11-30 02:46:23,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:23,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1025 transitions. [2023-11-30 02:46:23,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 341.6666666666667) internal successors, (1025), 3 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:23,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:23,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:23,085 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 1 predicate places. [2023-11-30 02:46:23,086 INFO L500 AbstractCegarLoop]: Abstraction has has 333 places, 332 transitions, 718 flow [2023-11-30 02:46:23,086 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:23,087 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:23,087 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:23,087 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 02:46:23,087 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:23,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1951804173, now seen corresponding path program 1 times [2023-11-30 02:46:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584117771] [2023-11-30 02:46:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:23,591 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 02:46:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584117771] [2023-11-30 02:46:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584117771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:23,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:23,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:46:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659665329] [2023-11-30 02:46:23,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:23,593 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:46:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:23,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:46:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:46:23,596 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 366 [2023-11-30 02:46:23,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 332 transitions, 718 flow. Second operand has 6 states, 6 states have (on average 253.83333333333334) internal successors, (1523), 6 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:23,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:23,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 366 [2023-11-30 02:46:23,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:26,990 INFO L124 PetriNetUnfolderBase]: 10545/29375 cut-off events. [2023-11-30 02:46:26,990 INFO L125 PetriNetUnfolderBase]: For 636/687 co-relation queries the response was YES. [2023-11-30 02:46:27,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46082 conditions, 29375 events. 10545/29375 cut-off events. For 636/687 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 312445 event pairs, 9337 based on Foata normal form. 0/23952 useless extension candidates. Maximal degree in co-relation 44587. Up to 15073 conditions per place. [2023-11-30 02:46:27,165 INFO L140 encePairwiseOnDemand]: 354/366 looper letters, 90 selfloop transitions, 10 changer transitions 4/330 dead transitions. [2023-11-30 02:46:27,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 330 transitions, 914 flow [2023-11-30 02:46:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:46:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:46:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1614 transitions. [2023-11-30 02:46:27,168 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7349726775956285 [2023-11-30 02:46:27,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1614 transitions. [2023-11-30 02:46:27,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1614 transitions. [2023-11-30 02:46:27,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:27,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1614 transitions. [2023-11-30 02:46:27,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:27,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:27,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:27,176 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 4 predicate places. [2023-11-30 02:46:27,176 INFO L500 AbstractCegarLoop]: Abstraction has has 336 places, 330 transitions, 914 flow [2023-11-30 02:46:27,177 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.83333333333334) internal successors, (1523), 6 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:27,177 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:27,177 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:27,177 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 02:46:27,177 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:27,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1128172056, now seen corresponding path program 1 times [2023-11-30 02:46:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851128102] [2023-11-30 02:46:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:27,222 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 02:46:27,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851128102] [2023-11-30 02:46:27,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851128102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:27,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:27,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:46:27,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430224276] [2023-11-30 02:46:27,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:27,224 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:46:27,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:27,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:46:27,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:46:27,225 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 366 [2023-11-30 02:46:27,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 330 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:27,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:27,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 366 [2023-11-30 02:46:27,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:30,541 INFO L124 PetriNetUnfolderBase]: 11749/32766 cut-off events. [2023-11-30 02:46:30,542 INFO L125 PetriNetUnfolderBase]: For 1396/1515 co-relation queries the response was YES. [2023-11-30 02:46:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53049 conditions, 32766 events. 11749/32766 cut-off events. For 1396/1515 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 354154 event pairs, 10341 based on Foata normal form. 0/26742 useless extension candidates. Maximal degree in co-relation 51372. Up to 16474 conditions per place. [2023-11-30 02:46:30,836 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 19 selfloop transitions, 2 changer transitions 4/329 dead transitions. [2023-11-30 02:46:30,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 329 transitions, 954 flow [2023-11-30 02:46:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:46:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:46:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1015 transitions. [2023-11-30 02:46:30,838 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.924408014571949 [2023-11-30 02:46:30,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1015 transitions. [2023-11-30 02:46:30,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1015 transitions. [2023-11-30 02:46:30,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:30,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1015 transitions. [2023-11-30 02:46:30,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:30,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:30,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:30,844 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 5 predicate places. [2023-11-30 02:46:30,844 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 329 transitions, 954 flow [2023-11-30 02:46:30,844 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:30,844 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:30,845 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:30,845 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 02:46:30,845 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:30,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash -746148377, now seen corresponding path program 1 times [2023-11-30 02:46:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150039536] [2023-11-30 02:46:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:30,890 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 02:46:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150039536] [2023-11-30 02:46:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150039536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:30,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:30,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:46:30,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575746138] [2023-11-30 02:46:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:30,892 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:46:30,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:30,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:46:30,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:46:30,894 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 366 [2023-11-30 02:46:30,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 329 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:30,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:30,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 366 [2023-11-30 02:46:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:34,085 INFO L124 PetriNetUnfolderBase]: 12076/34291 cut-off events. [2023-11-30 02:46:34,085 INFO L125 PetriNetUnfolderBase]: For 2901/3056 co-relation queries the response was YES. [2023-11-30 02:46:34,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56572 conditions, 34291 events. 12076/34291 cut-off events. For 2901/3056 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 373866 event pairs, 10888 based on Foata normal form. 0/28216 useless extension candidates. Maximal degree in co-relation 55947. Up to 17649 conditions per place. [2023-11-30 02:46:34,295 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 13 selfloop transitions, 2 changer transitions 4/328 dead transitions. [2023-11-30 02:46:34,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 328 transitions, 982 flow [2023-11-30 02:46:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:46:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:46:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions. [2023-11-30 02:46:34,298 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9353369763205829 [2023-11-30 02:46:34,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1027 transitions. [2023-11-30 02:46:34,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1027 transitions. [2023-11-30 02:46:34,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:34,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1027 transitions. [2023-11-30 02:46:34,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:34,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:34,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:34,304 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 6 predicate places. [2023-11-30 02:46:34,304 INFO L500 AbstractCegarLoop]: Abstraction has has 338 places, 328 transitions, 982 flow [2023-11-30 02:46:34,304 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:34,304 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:34,304 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:34,305 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 02:46:34,305 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:34,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash 10243285, now seen corresponding path program 1 times [2023-11-30 02:46:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:34,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113530321] [2023-11-30 02:46:34,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:34,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:34,350 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 02:46:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113530321] [2023-11-30 02:46:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113530321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:46:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487608546] [2023-11-30 02:46:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:34,352 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:46:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:46:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:46:34,353 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 366 [2023-11-30 02:46:34,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 328 transitions, 982 flow. Second operand has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:34,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:34,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 366 [2023-11-30 02:46:34,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:38,061 INFO L124 PetriNetUnfolderBase]: 12644/36278 cut-off events. [2023-11-30 02:46:38,061 INFO L125 PetriNetUnfolderBase]: For 6263/6607 co-relation queries the response was YES. [2023-11-30 02:46:38,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60769 conditions, 36278 events. 12644/36278 cut-off events. For 6263/6607 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 399596 event pairs, 11390 based on Foata normal form. 0/29812 useless extension candidates. Maximal degree in co-relation 60068. Up to 18630 conditions per place. [2023-11-30 02:46:38,300 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 13 selfloop transitions, 2 changer transitions 4/327 dead transitions. [2023-11-30 02:46:38,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 327 transitions, 1010 flow [2023-11-30 02:46:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:46:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:46:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions. [2023-11-30 02:46:38,303 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9353369763205829 [2023-11-30 02:46:38,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1027 transitions. [2023-11-30 02:46:38,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1027 transitions. [2023-11-30 02:46:38,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:38,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1027 transitions. [2023-11-30 02:46:38,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:38,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:38,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:38,307 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 7 predicate places. [2023-11-30 02:46:38,307 INFO L500 AbstractCegarLoop]: Abstraction has has 339 places, 327 transitions, 1010 flow [2023-11-30 02:46:38,308 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:38,308 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:38,308 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:38,308 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 02:46:38,308 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:38,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1092067150, now seen corresponding path program 1 times [2023-11-30 02:46:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220101875] [2023-11-30 02:46:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:38,338 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 02:46:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220101875] [2023-11-30 02:46:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220101875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:46:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135007775] [2023-11-30 02:46:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:38,339 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:46:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:38,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:46:38,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:46:38,341 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 366 [2023-11-30 02:46:38,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 327 transitions, 1010 flow. Second operand has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:38,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:38,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 366 [2023-11-30 02:46:38,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:41,800 INFO L124 PetriNetUnfolderBase]: 12440/35610 cut-off events. [2023-11-30 02:46:41,800 INFO L125 PetriNetUnfolderBase]: For 8427/8762 co-relation queries the response was YES. [2023-11-30 02:46:41,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60088 conditions, 35610 events. 12440/35610 cut-off events. For 8427/8762 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 390790 event pairs, 11194 based on Foata normal form. 0/29313 useless extension candidates. Maximal degree in co-relation 58215. Up to 18314 conditions per place. [2023-11-30 02:46:42,039 INFO L140 encePairwiseOnDemand]: 362/366 looper letters, 11 selfloop transitions, 2 changer transitions 4/328 dead transitions. [2023-11-30 02:46:42,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 328 transitions, 1051 flow [2023-11-30 02:46:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:46:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:46:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2023-11-30 02:46:42,041 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9453551912568307 [2023-11-30 02:46:42,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1038 transitions. [2023-11-30 02:46:42,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1038 transitions. [2023-11-30 02:46:42,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:42,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1038 transitions. [2023-11-30 02:46:42,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:42,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:42,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:42,046 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 7 predicate places. [2023-11-30 02:46:42,046 INFO L500 AbstractCegarLoop]: Abstraction has has 339 places, 328 transitions, 1051 flow [2023-11-30 02:46:42,046 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:42,046 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:42,047 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:42,047 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 02:46:42,047 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:42,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash -886178973, now seen corresponding path program 1 times [2023-11-30 02:46:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21862446] [2023-11-30 02:46:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:42,075 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 02:46:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21862446] [2023-11-30 02:46:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21862446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:42,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:46:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947193439] [2023-11-30 02:46:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:42,076 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:46:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:46:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:46:42,077 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 366 [2023-11-30 02:46:42,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 328 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:42,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:42,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 366 [2023-11-30 02:46:42,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:45,557 INFO L124 PetriNetUnfolderBase]: 12237/34691 cut-off events. [2023-11-30 02:46:45,557 INFO L125 PetriNetUnfolderBase]: For 9487/9998 co-relation queries the response was YES. [2023-11-30 02:46:45,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59095 conditions, 34691 events. 12237/34691 cut-off events. For 9487/9998 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 377945 event pairs, 10959 based on Foata normal form. 0/28769 useless extension candidates. Maximal degree in co-relation 58311. Up to 17981 conditions per place. [2023-11-30 02:46:45,932 INFO L140 encePairwiseOnDemand]: 362/366 looper letters, 12 selfloop transitions, 2 changer transitions 4/329 dead transitions. [2023-11-30 02:46:45,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 329 transitions, 1096 flow [2023-11-30 02:46:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:46:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:46:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2023-11-30 02:46:45,934 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9453551912568307 [2023-11-30 02:46:45,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1038 transitions. [2023-11-30 02:46:45,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1038 transitions. [2023-11-30 02:46:45,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:45,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1038 transitions. [2023-11-30 02:46:45,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:45,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:45,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:45,938 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 7 predicate places. [2023-11-30 02:46:45,938 INFO L500 AbstractCegarLoop]: Abstraction has has 339 places, 329 transitions, 1096 flow [2023-11-30 02:46:45,939 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:45,939 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:45,939 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:45,939 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 02:46:45,939 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:45,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1119093160, now seen corresponding path program 1 times [2023-11-30 02:46:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299776290] [2023-11-30 02:46:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:46,010 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 02:46:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299776290] [2023-11-30 02:46:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299776290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:46,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:46:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:46:46,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958861173] [2023-11-30 02:46:46,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:46,011 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 02:46:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 02:46:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 02:46:46,012 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 366 [2023-11-30 02:46:46,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 329 transitions, 1096 flow. Second operand has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:46,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:46,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 366 [2023-11-30 02:46:46,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:49,931 INFO L124 PetriNetUnfolderBase]: 12237/34739 cut-off events. [2023-11-30 02:46:49,932 INFO L125 PetriNetUnfolderBase]: For 12007/12514 co-relation queries the response was YES. [2023-11-30 02:46:50,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59388 conditions, 34739 events. 12237/34739 cut-off events. For 12007/12514 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 378076 event pairs, 10960 based on Foata normal form. 0/28815 useless extension candidates. Maximal degree in co-relation 57319. Up to 17999 conditions per place. [2023-11-30 02:46:50,111 INFO L140 encePairwiseOnDemand]: 352/366 looper letters, 52 selfloop transitions, 12 changer transitions 4/347 dead transitions. [2023-11-30 02:46:50,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 347 transitions, 1296 flow [2023-11-30 02:46:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 02:46:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 02:46:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2023-11-30 02:46:50,114 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8765027322404372 [2023-11-30 02:46:50,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2023-11-30 02:46:50,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2023-11-30 02:46:50,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:50,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2023-11-30 02:46:50,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:50,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:50,120 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:50,120 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 11 predicate places. [2023-11-30 02:46:50,120 INFO L500 AbstractCegarLoop]: Abstraction has has 343 places, 347 transitions, 1296 flow [2023-11-30 02:46:50,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:50,121 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:50,121 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:46:50,121 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 02:46:50,121 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:50,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash -698977606, now seen corresponding path program 1 times [2023-11-30 02:46:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234235289] [2023-11-30 02:46:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 02:46:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:50,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234235289] [2023-11-30 02:46:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234235289] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 02:46:50,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369182526] [2023-11-30 02:46:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:50,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 02:46:50,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:46:50,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 02:46:50,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 02:46:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:50,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-30 02:46:50,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 02:46:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 02:46:50,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 02:46:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 02:46:50,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369182526] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 02:46:50,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 02:46:50,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-11-30 02:46:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095910656] [2023-11-30 02:46:50,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 02:46:50,584 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 02:46:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 02:46:50,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-30 02:46:50,587 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 366 [2023-11-30 02:46:50,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 347 transitions, 1296 flow. Second operand has 15 states, 15 states have (on average 310.93333333333334) internal successors, (4664), 15 states have internal predecessors, (4664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:50,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:50,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 366 [2023-11-30 02:46:50,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:46:55,365 INFO L124 PetriNetUnfolderBase]: 12237/34753 cut-off events. [2023-11-30 02:46:55,366 INFO L125 PetriNetUnfolderBase]: For 14681/15192 co-relation queries the response was YES. [2023-11-30 02:46:55,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59679 conditions, 34753 events. 12237/34753 cut-off events. For 14681/15192 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 377907 event pairs, 10959 based on Foata normal form. 0/28831 useless extension candidates. Maximal degree in co-relation 58533. Up to 18007 conditions per place. [2023-11-30 02:46:55,646 INFO L140 encePairwiseOnDemand]: 346/366 looper letters, 64 selfloop transitions, 26 changer transitions 4/371 dead transitions. [2023-11-30 02:46:55,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 371 transitions, 1604 flow [2023-11-30 02:46:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 02:46:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 02:46:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3458 transitions. [2023-11-30 02:46:55,652 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8589170392449081 [2023-11-30 02:46:55,652 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3458 transitions. [2023-11-30 02:46:55,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3458 transitions. [2023-11-30 02:46:55,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:46:55,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3458 transitions. [2023-11-30 02:46:55,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 314.3636363636364) internal successors, (3458), 11 states have internal predecessors, (3458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:55,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 366.0) internal successors, (4392), 12 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:55,806 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 366.0) internal successors, (4392), 12 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:55,807 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 21 predicate places. [2023-11-30 02:46:55,807 INFO L500 AbstractCegarLoop]: Abstraction has has 353 places, 371 transitions, 1604 flow [2023-11-30 02:46:55,808 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 310.93333333333334) internal successors, (4664), 15 states have internal predecessors, (4664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:55,808 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:46:55,808 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:55,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 02:46:56,008 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 02:46:56,009 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:46:56,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:46:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1416605946, now seen corresponding path program 2 times [2023-11-30 02:46:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:46:56,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423964566] [2023-11-30 02:46:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:46:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:46:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:46:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-30 02:46:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:46:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423964566] [2023-11-30 02:46:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423964566] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 02:46:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398993678] [2023-11-30 02:46:56,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 02:46:56,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 02:46:56,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:46:56,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 02:46:56,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 02:46:56,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 02:46:56,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 02:46:56,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-30 02:46:56,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 02:46:56,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 02:46:56,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 02:46:56,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 02:46:56,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-30 02:46:56,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 02:46:56,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-30 02:46:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-30 02:46:56,660 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 02:46:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398993678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:46:56,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 02:46:56,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2023-11-30 02:46:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743920480] [2023-11-30 02:46:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:46:56,661 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 02:46:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:46:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 02:46:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-30 02:46:56,663 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 366 [2023-11-30 02:46:56,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 371 transitions, 1604 flow. Second operand has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:46:56,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:46:56,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 366 [2023-11-30 02:46:56,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:00,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][245], [thread2Thread1of1ForFork1InUse, 368#true, thread1Thread1of1ForFork0NotInUse, 361#true, 376#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 292#thread2Err4ASSERT_VIOLATIONDATA_RACEtrue, 386#(= |#race~isNullB~0| 0), 382#(= |#race~isNullA~0| 0), 398#true, 372#true, 315#L89-7true, 357#true, 388#true]) [2023-11-30 02:47:00,720 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2023-11-30 02:47:00,720 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 02:47:00,720 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 02:47:00,720 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 02:47:00,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][245], [368#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 361#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 376#true, 386#(= |#race~isNullB~0| 0), 382#(= |#race~isNullA~0| 0), 181#L67-10true, 398#true, 372#true, 315#L89-7true, 357#true, 388#true]) [2023-11-30 02:47:00,720 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2023-11-30 02:47:00,720 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 02:47:00,720 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 02:47:00,721 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 02:47:00,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][245], [thread2Thread1of1ForFork1InUse, 368#true, thread1Thread1of1ForFork0NotInUse, 361#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 376#true, 386#(= |#race~isNullB~0| 0), 382#(= |#race~isNullA~0| 0), 398#true, 372#true, 315#L89-7true, 11#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 357#true, 388#true]) [2023-11-30 02:47:00,845 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2023-11-30 02:47:00,845 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 02:47:00,845 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:00,845 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:00,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][245], [368#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 361#true, 376#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 386#(= |#race~isNullB~0| 0), 5#L67-21true, 382#(= |#race~isNullA~0| 0), 398#true, 372#true, 315#L89-7true, 357#true, 388#true]) [2023-11-30 02:47:00,845 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2023-11-30 02:47:00,845 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 02:47:00,845 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:00,845 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:00,934 INFO L124 PetriNetUnfolderBase]: 12083/27502 cut-off events. [2023-11-30 02:47:00,934 INFO L125 PetriNetUnfolderBase]: For 27706/38298 co-relation queries the response was YES. [2023-11-30 02:47:01,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68641 conditions, 27502 events. 12083/27502 cut-off events. For 27706/38298 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 258260 event pairs, 2701 based on Foata normal form. 65/23757 useless extension candidates. Maximal degree in co-relation 66170. Up to 17777 conditions per place. [2023-11-30 02:47:01,131 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 286 selfloop transitions, 5 changer transitions 4/562 dead transitions. [2023-11-30 02:47:01,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 562 transitions, 2950 flow [2023-11-30 02:47:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 02:47:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 02:47:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2167 transitions. [2023-11-30 02:47:01,152 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8458235753317721 [2023-11-30 02:47:01,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2167 transitions. [2023-11-30 02:47:01,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2167 transitions. [2023-11-30 02:47:01,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:01,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2167 transitions. [2023-11-30 02:47:01,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 309.57142857142856) internal successors, (2167), 7 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:01,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 366.0) internal successors, (2928), 8 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:01,173 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 366.0) internal successors, (2928), 8 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:01,174 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 26 predicate places. [2023-11-30 02:47:01,175 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 562 transitions, 2950 flow [2023-11-30 02:47:01,175 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:01,175 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:01,176 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:01,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 02:47:01,381 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-30 02:47:01,381 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:01,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash -357707272, now seen corresponding path program 1 times [2023-11-30 02:47:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098193508] [2023-11-30 02:47:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-30 02:47:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098193508] [2023-11-30 02:47:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098193508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:47:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:47:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:47:01,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495502166] [2023-11-30 02:47:01,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:47:01,454 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:47:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:01,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:47:01,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:47:01,456 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 366 [2023-11-30 02:47:01,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 562 transitions, 2950 flow. Second operand has 3 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:01,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:01,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 366 [2023-11-30 02:47:01,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:05,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][409], [thread2Thread1of1ForFork1InUse, 368#true, thread1Thread1of1ForFork0NotInUse, 361#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 376#true, 386#(= |#race~isNullB~0| 0), 382#(= |#race~isNullA~0| 0), 398#true, 372#true, 315#L89-7true, 1916#(= |#race~scoreA~0| 0), 11#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 357#true, 388#true]) [2023-11-30 02:47:05,560 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2023-11-30 02:47:05,560 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:05,560 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 02:47:05,560 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:05,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][409], [368#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 361#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 376#true, 386#(= |#race~isNullB~0| 0), 5#L67-21true, 382#(= |#race~isNullA~0| 0), 398#true, 372#true, 315#L89-7true, 1916#(= |#race~scoreA~0| 0), 357#true, 388#true]) [2023-11-30 02:47:05,561 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2023-11-30 02:47:05,561 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:05,561 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 02:47:05,561 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 02:47:05,673 INFO L124 PetriNetUnfolderBase]: 12011/29238 cut-off events. [2023-11-30 02:47:05,673 INFO L125 PetriNetUnfolderBase]: For 27263/34010 co-relation queries the response was YES. [2023-11-30 02:47:05,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71318 conditions, 29238 events. 12011/29238 cut-off events. For 27263/34010 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 286119 event pairs, 3003 based on Foata normal form. 5/25741 useless extension candidates. Maximal degree in co-relation 68399. Up to 17733 conditions per place. [2023-11-30 02:47:05,867 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 19 selfloop transitions, 2 changer transitions 4/563 dead transitions. [2023-11-30 02:47:05,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 563 transitions, 3059 flow [2023-11-30 02:47:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:47:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:47:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2023-11-30 02:47:05,870 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.936247723132969 [2023-11-30 02:47:05,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2023-11-30 02:47:05,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2023-11-30 02:47:05,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:05,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2023-11-30 02:47:05,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:05,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:05,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:05,873 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 24 predicate places. [2023-11-30 02:47:05,873 INFO L500 AbstractCegarLoop]: Abstraction has has 356 places, 563 transitions, 3059 flow [2023-11-30 02:47:05,873 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:05,873 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:05,874 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:05,874 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 02:47:05,874 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:05,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1586718532, now seen corresponding path program 1 times [2023-11-30 02:47:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:05,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407174637] [2023-11-30 02:47:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-30 02:47:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407174637] [2023-11-30 02:47:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407174637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 02:47:06,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442969449] [2023-11-30 02:47:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:06,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 02:47:06,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:47:06,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 02:47:06,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 02:47:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:06,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-30 02:47:06,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 02:47:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-30 02:47:06,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 02:47:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-30 02:47:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442969449] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 02:47:06,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 02:47:06,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-11-30 02:47:06,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337299174] [2023-11-30 02:47:06,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 02:47:06,488 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-30 02:47:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-30 02:47:06,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2023-11-30 02:47:06,492 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 366 [2023-11-30 02:47:06,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 563 transitions, 3059 flow. Second operand has 22 states, 22 states have (on average 311.1363636363636) internal successors, (6845), 22 states have internal predecessors, (6845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:06,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:06,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 366 [2023-11-30 02:47:06,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:11,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][449], [368#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 361#true, 376#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 386#(= |#race~isNullB~0| 0), 1918#true, 382#(= |#race~isNullA~0| 0), 398#true, 372#true, 315#L89-7true, 11#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 1916#(= |#race~scoreA~0| 0), 357#true, 388#true]) [2023-11-30 02:47:11,324 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-30 02:47:11,324 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2023-11-30 02:47:11,324 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-30 02:47:11,324 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2023-11-30 02:47:11,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([981] thread1EXIT-->L89-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem27#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_6|} AuxVars[] AssignedVars[][449], [368#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 361#true, 1912#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 376#true, 386#(= |#race~isNullB~0| 0), 1918#true, 5#L67-21true, 382#(= |#race~isNullA~0| 0), 398#true, 372#true, 315#L89-7true, 1916#(= |#race~scoreA~0| 0), 357#true, 388#true]) [2023-11-30 02:47:11,325 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-30 02:47:11,325 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2023-11-30 02:47:11,325 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-30 02:47:11,325 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2023-11-30 02:47:11,448 INFO L124 PetriNetUnfolderBase]: 12011/29298 cut-off events. [2023-11-30 02:47:11,448 INFO L125 PetriNetUnfolderBase]: For 34238/40985 co-relation queries the response was YES. [2023-11-30 02:47:11,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71788 conditions, 29298 events. 12011/29298 cut-off events. For 34238/40985 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 285945 event pairs, 3003 based on Foata normal form. 5/25801 useless extension candidates. Maximal degree in co-relation 68500. Up to 17757 conditions per place. [2023-11-30 02:47:11,643 INFO L140 encePairwiseOnDemand]: 346/366 looper letters, 95 selfloop transitions, 38 changer transitions 4/603 dead transitions. [2023-11-30 02:47:11,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 603 transitions, 3669 flow [2023-11-30 02:47:11,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 02:47:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 02:47:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5334 transitions. [2023-11-30 02:47:11,649 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8572806171648988 [2023-11-30 02:47:11,649 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5334 transitions. [2023-11-30 02:47:11,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5334 transitions. [2023-11-30 02:47:11,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:11,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5334 transitions. [2023-11-30 02:47:11,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 313.7647058823529) internal successors, (5334), 17 states have internal predecessors, (5334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:11,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 366.0) internal successors, (6588), 18 states have internal predecessors, (6588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:11,663 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 366.0) internal successors, (6588), 18 states have internal predecessors, (6588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:11,663 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 40 predicate places. [2023-11-30 02:47:11,663 INFO L500 AbstractCegarLoop]: Abstraction has has 372 places, 603 transitions, 3669 flow [2023-11-30 02:47:11,664 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 311.1363636363636) internal successors, (6845), 22 states have internal predecessors, (6845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:11,664 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:11,665 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:11,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-30 02:47:11,869 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 02:47:11,870 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:11,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash -92199172, now seen corresponding path program 2 times [2023-11-30 02:47:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056210328] [2023-11-30 02:47:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:47:12,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:12,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056210328] [2023-11-30 02:47:12,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056210328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:47:12,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:47:12,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:47:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718604261] [2023-11-30 02:47:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:47:12,730 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:47:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:47:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:47:12,732 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 366 [2023-11-30 02:47:12,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 603 transitions, 3669 flow. Second operand has 6 states, 6 states have (on average 268.5) internal successors, (1611), 6 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:12,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:12,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 366 [2023-11-30 02:47:12,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:19,158 INFO L124 PetriNetUnfolderBase]: 15168/34249 cut-off events. [2023-11-30 02:47:19,159 INFO L125 PetriNetUnfolderBase]: For 28323/38934 co-relation queries the response was YES. [2023-11-30 02:47:19,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103220 conditions, 34249 events. 15168/34249 cut-off events. For 28323/38934 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 330035 event pairs, 2947 based on Foata normal form. 41/30042 useless extension candidates. Maximal degree in co-relation 101228. Up to 19260 conditions per place. [2023-11-30 02:47:19,426 INFO L140 encePairwiseOnDemand]: 359/366 looper letters, 812 selfloop transitions, 21 changer transitions 4/1113 dead transitions. [2023-11-30 02:47:19,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1113 transitions, 8501 flow [2023-11-30 02:47:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:47:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:47:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1812 transitions. [2023-11-30 02:47:19,428 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.825136612021858 [2023-11-30 02:47:19,428 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1812 transitions. [2023-11-30 02:47:19,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1812 transitions. [2023-11-30 02:47:19,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:19,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1812 transitions. [2023-11-30 02:47:19,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:19,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:19,442 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:19,443 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 43 predicate places. [2023-11-30 02:47:19,444 INFO L500 AbstractCegarLoop]: Abstraction has has 375 places, 1113 transitions, 8501 flow [2023-11-30 02:47:19,444 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 268.5) internal successors, (1611), 6 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:19,444 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:19,445 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:19,445 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 02:47:19,445 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:19,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1204695002, now seen corresponding path program 1 times [2023-11-30 02:47:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791989764] [2023-11-30 02:47:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:47:19,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:19,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791989764] [2023-11-30 02:47:19,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791989764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:47:19,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:47:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:47:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738832678] [2023-11-30 02:47:19,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:47:19,543 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:47:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:47:19,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:47:19,544 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 366 [2023-11-30 02:47:19,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1113 transitions, 8501 flow. Second operand has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:19,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:19,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 366 [2023-11-30 02:47:19,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:25,674 INFO L124 PetriNetUnfolderBase]: 14910/32142 cut-off events. [2023-11-30 02:47:25,674 INFO L125 PetriNetUnfolderBase]: For 30061/38262 co-relation queries the response was YES. [2023-11-30 02:47:25,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100795 conditions, 32142 events. 14910/32142 cut-off events. For 30061/38262 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 297929 event pairs, 2597 based on Foata normal form. 11/28695 useless extension candidates. Maximal degree in co-relation 98630. Up to 19042 conditions per place. [2023-11-30 02:47:25,919 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 31 selfloop transitions, 2 changer transitions 4/1117 dead transitions. [2023-11-30 02:47:25,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1117 transitions, 8745 flow [2023-11-30 02:47:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:47:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:47:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2023-11-30 02:47:25,921 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.936247723132969 [2023-11-30 02:47:25,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2023-11-30 02:47:25,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2023-11-30 02:47:25,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:25,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2023-11-30 02:47:25,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:25,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:25,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:25,925 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 41 predicate places. [2023-11-30 02:47:25,925 INFO L500 AbstractCegarLoop]: Abstraction has has 373 places, 1117 transitions, 8745 flow [2023-11-30 02:47:25,925 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:25,925 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:25,925 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:25,925 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 02:47:25,925 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:25,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1884398530, now seen corresponding path program 1 times [2023-11-30 02:47:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:25,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094454788] [2023-11-30 02:47:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:47:26,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:26,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094454788] [2023-11-30 02:47:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094454788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:47:26,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:47:26,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:47:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015435819] [2023-11-30 02:47:26,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:47:26,563 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:47:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:47:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:47:26,564 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 366 [2023-11-30 02:47:26,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1117 transitions, 8745 flow. Second operand has 6 states, 6 states have (on average 268.6666666666667) internal successors, (1612), 6 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:26,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:26,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 366 [2023-11-30 02:47:26,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:34,705 INFO L124 PetriNetUnfolderBase]: 17202/37698 cut-off events. [2023-11-30 02:47:34,705 INFO L125 PetriNetUnfolderBase]: For 32969/34110 co-relation queries the response was YES. [2023-11-30 02:47:34,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134378 conditions, 37698 events. 17202/37698 cut-off events. For 32969/34110 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 362138 event pairs, 4156 based on Foata normal form. 0/33995 useless extension candidates. Maximal degree in co-relation 132041. Up to 20108 conditions per place. [2023-11-30 02:47:35,161 INFO L140 encePairwiseOnDemand]: 359/366 looper letters, 1298 selfloop transitions, 101 changer transitions 4/1677 dead transitions. [2023-11-30 02:47:35,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 1677 transitions, 16341 flow [2023-11-30 02:47:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:47:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:47:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1819 transitions. [2023-11-30 02:47:35,164 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8283242258652095 [2023-11-30 02:47:35,164 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1819 transitions. [2023-11-30 02:47:35,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1819 transitions. [2023-11-30 02:47:35,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:35,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1819 transitions. [2023-11-30 02:47:35,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 303.1666666666667) internal successors, (1819), 6 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:35,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:35,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:35,169 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 44 predicate places. [2023-11-30 02:47:35,169 INFO L500 AbstractCegarLoop]: Abstraction has has 376 places, 1677 transitions, 16341 flow [2023-11-30 02:47:35,169 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 268.6666666666667) internal successors, (1612), 6 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:35,170 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:35,170 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:35,170 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 02:47:35,170 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:35,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 467610402, now seen corresponding path program 1 times [2023-11-30 02:47:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337367059] [2023-11-30 02:47:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:47:35,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:35,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337367059] [2023-11-30 02:47:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337367059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:47:35,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:47:35,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:47:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044435610] [2023-11-30 02:47:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:47:35,619 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:47:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:35,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:47:35,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:47:35,620 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 366 [2023-11-30 02:47:35,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 1677 transitions, 16341 flow. Second operand has 6 states, 6 states have (on average 269.5) internal successors, (1617), 6 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:35,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:35,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 366 [2023-11-30 02:47:35,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:44,408 INFO L124 PetriNetUnfolderBase]: 16411/36036 cut-off events. [2023-11-30 02:47:44,408 INFO L125 PetriNetUnfolderBase]: For 40020/42518 co-relation queries the response was YES. [2023-11-30 02:47:44,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150249 conditions, 36036 events. 16411/36036 cut-off events. For 40020/42518 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 345086 event pairs, 3977 based on Foata normal form. 0/32928 useless extension candidates. Maximal degree in co-relation 147808. Up to 18888 conditions per place. [2023-11-30 02:47:44,686 INFO L140 encePairwiseOnDemand]: 359/366 looper letters, 1792 selfloop transitions, 101 changer transitions 4/2179 dead transitions. [2023-11-30 02:47:44,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 2179 transitions, 25199 flow [2023-11-30 02:47:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:47:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:47:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1800 transitions. [2023-11-30 02:47:44,689 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.819672131147541 [2023-11-30 02:47:44,689 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1800 transitions. [2023-11-30 02:47:44,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1800 transitions. [2023-11-30 02:47:44,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:44,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1800 transitions. [2023-11-30 02:47:44,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:44,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:44,694 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:44,694 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 47 predicate places. [2023-11-30 02:47:44,694 INFO L500 AbstractCegarLoop]: Abstraction has has 379 places, 2179 transitions, 25199 flow [2023-11-30 02:47:44,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 269.5) internal successors, (1617), 6 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:44,694 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:44,694 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:44,694 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 02:47:44,695 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:44,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash -5400604, now seen corresponding path program 1 times [2023-11-30 02:47:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:44,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214451798] [2023-11-30 02:47:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:47:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214451798] [2023-11-30 02:47:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214451798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:47:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:47:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:47:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039760737] [2023-11-30 02:47:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:47:45,223 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:47:45,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:45,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:47:45,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:47:45,224 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 366 [2023-11-30 02:47:45,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 2179 transitions, 25199 flow. Second operand has 6 states, 6 states have (on average 269.6666666666667) internal successors, (1618), 6 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:45,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:45,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 366 [2023-11-30 02:47:45,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:47:55,044 INFO L124 PetriNetUnfolderBase]: 15097/33861 cut-off events. [2023-11-30 02:47:55,044 INFO L125 PetriNetUnfolderBase]: For 44389/47907 co-relation queries the response was YES. [2023-11-30 02:47:55,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160110 conditions, 33861 events. 15097/33861 cut-off events. For 44389/47907 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 326593 event pairs, 3320 based on Foata normal form. 16/31542 useless extension candidates. Maximal degree in co-relation 150167. Up to 17425 conditions per place. [2023-11-30 02:47:55,371 INFO L140 encePairwiseOnDemand]: 359/366 looper letters, 2266 selfloop transitions, 181 changer transitions 4/2733 dead transitions. [2023-11-30 02:47:55,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 2733 transitions, 36893 flow [2023-11-30 02:47:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:47:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:47:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1807 transitions. [2023-11-30 02:47:55,373 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8228597449908925 [2023-11-30 02:47:55,373 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1807 transitions. [2023-11-30 02:47:55,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1807 transitions. [2023-11-30 02:47:55,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:47:55,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1807 transitions. [2023-11-30 02:47:55,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 301.1666666666667) internal successors, (1807), 6 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:55,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:55,378 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:55,384 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 50 predicate places. [2023-11-30 02:47:55,384 INFO L500 AbstractCegarLoop]: Abstraction has has 382 places, 2733 transitions, 36893 flow [2023-11-30 02:47:55,384 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 269.6666666666667) internal successors, (1618), 6 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:55,384 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:47:55,384 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:55,384 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 02:47:55,384 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:47:55,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:47:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1139427392, now seen corresponding path program 1 times [2023-11-30 02:47:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:47:55,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486910973] [2023-11-30 02:47:55,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:47:55,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:47:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:47:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:47:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:47:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486910973] [2023-11-30 02:47:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486910973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:47:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:47:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:47:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433756764] [2023-11-30 02:47:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:47:55,929 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:47:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:47:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:47:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:47:55,931 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 366 [2023-11-30 02:47:55,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 2733 transitions, 36893 flow. Second operand has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:47:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:47:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 366 [2023-11-30 02:47:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:48:07,520 INFO L124 PetriNetUnfolderBase]: 15088/33635 cut-off events. [2023-11-30 02:48:07,520 INFO L125 PetriNetUnfolderBase]: For 59171/63293 co-relation queries the response was YES. [2023-11-30 02:48:07,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176856 conditions, 33635 events. 15088/33635 cut-off events. For 59171/63293 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 322883 event pairs, 3418 based on Foata normal form. 8/31399 useless extension candidates. Maximal degree in co-relation 166874. Up to 17367 conditions per place. [2023-11-30 02:48:07,865 INFO L140 encePairwiseOnDemand]: 361/366 looper letters, 2484 selfloop transitions, 72 changer transitions 4/2875 dead transitions. [2023-11-30 02:48:07,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 2875 transitions, 43993 flow [2023-11-30 02:48:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:48:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:48:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1775 transitions. [2023-11-30 02:48:07,868 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.808287795992714 [2023-11-30 02:48:07,868 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1775 transitions. [2023-11-30 02:48:07,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1775 transitions. [2023-11-30 02:48:07,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:48:07,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1775 transitions. [2023-11-30 02:48:07,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 295.8333333333333) internal successors, (1775), 6 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:07,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:07,872 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:07,873 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 54 predicate places. [2023-11-30 02:48:07,873 INFO L500 AbstractCegarLoop]: Abstraction has has 386 places, 2875 transitions, 43993 flow [2023-11-30 02:48:07,873 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:07,873 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:48:07,873 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:48:07,873 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 02:48:07,873 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:48:07,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:48:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -775010272, now seen corresponding path program 1 times [2023-11-30 02:48:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:48:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433549784] [2023-11-30 02:48:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:48:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:48:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:48:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:48:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:48:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433549784] [2023-11-30 02:48:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433549784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:48:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:48:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:48:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861254776] [2023-11-30 02:48:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:48:07,934 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:48:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:48:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:48:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:48:07,935 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 366 [2023-11-30 02:48:07,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 2875 transitions, 43993 flow. Second operand has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:07,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:48:07,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 366 [2023-11-30 02:48:07,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:48:18,854 INFO L124 PetriNetUnfolderBase]: 15092/33560 cut-off events. [2023-11-30 02:48:18,854 INFO L125 PetriNetUnfolderBase]: For 70902/74968 co-relation queries the response was YES. [2023-11-30 02:48:19,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177357 conditions, 33560 events. 15092/33560 cut-off events. For 70902/74968 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 321258 event pairs, 3418 based on Foata normal form. 16/31411 useless extension candidates. Maximal degree in co-relation 167253. Up to 17371 conditions per place. [2023-11-30 02:48:19,282 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 53 selfloop transitions, 2 changer transitions 4/2875 dead transitions. [2023-11-30 02:48:19,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 2875 transitions, 44142 flow [2023-11-30 02:48:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:48:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:48:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2023-11-30 02:48:19,286 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9462659380692168 [2023-11-30 02:48:19,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2023-11-30 02:48:19,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2023-11-30 02:48:19,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:48:19,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2023-11-30 02:48:19,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:19,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:19,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:19,290 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 55 predicate places. [2023-11-30 02:48:19,290 INFO L500 AbstractCegarLoop]: Abstraction has has 387 places, 2875 transitions, 44142 flow [2023-11-30 02:48:19,290 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:19,290 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:48:19,290 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:48:19,290 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 02:48:19,290 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:48:19,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:48:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1910695759, now seen corresponding path program 1 times [2023-11-30 02:48:19,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:48:19,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481419688] [2023-11-30 02:48:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:48:19,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:48:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:48:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:48:19,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:48:19,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481419688] [2023-11-30 02:48:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481419688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:48:19,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:48:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:48:19,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050702209] [2023-11-30 02:48:19,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:48:19,358 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:48:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:48:19,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:48:19,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:48:19,359 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 366 [2023-11-30 02:48:19,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 2875 transitions, 44142 flow. Second operand has 3 states, 3 states have (on average 343.6666666666667) internal successors, (1031), 3 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:19,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:48:19,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 366 [2023-11-30 02:48:19,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:48:31,026 INFO L124 PetriNetUnfolderBase]: 15581/34129 cut-off events. [2023-11-30 02:48:31,026 INFO L125 PetriNetUnfolderBase]: For 78699/82723 co-relation queries the response was YES. [2023-11-30 02:48:31,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182090 conditions, 34129 events. 15581/34129 cut-off events. For 78699/82723 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 323761 event pairs, 3703 based on Foata normal form. 0/32029 useless extension candidates. Maximal degree in co-relation 178790. Up to 17648 conditions per place. [2023-11-30 02:48:31,385 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 54 selfloop transitions, 2 changer transitions 4/2876 dead transitions. [2023-11-30 02:48:31,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 2876 transitions, 44338 flow [2023-11-30 02:48:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:48:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:48:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2023-11-30 02:48:31,386 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9453551912568307 [2023-11-30 02:48:31,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1038 transitions. [2023-11-30 02:48:31,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1038 transitions. [2023-11-30 02:48:31,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:48:31,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1038 transitions. [2023-11-30 02:48:31,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:31,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:31,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:31,395 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 56 predicate places. [2023-11-30 02:48:31,395 INFO L500 AbstractCegarLoop]: Abstraction has has 388 places, 2876 transitions, 44338 flow [2023-11-30 02:48:31,396 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.6666666666667) internal successors, (1031), 3 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:31,396 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:48:31,396 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:48:31,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 02:48:31,396 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:48:31,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:48:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash 758969686, now seen corresponding path program 1 times [2023-11-30 02:48:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:48:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856196978] [2023-11-30 02:48:31,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:48:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:48:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:48:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:48:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:48:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856196978] [2023-11-30 02:48:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856196978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:48:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:48:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:48:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861834] [2023-11-30 02:48:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:48:31,487 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:48:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:48:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:48:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:48:31,488 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 366 [2023-11-30 02:48:31,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 2876 transitions, 44338 flow. Second operand has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:31,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:48:31,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 366 [2023-11-30 02:48:31,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:48:42,446 INFO L124 PetriNetUnfolderBase]: 15581/34124 cut-off events. [2023-11-30 02:48:42,446 INFO L125 PetriNetUnfolderBase]: For 84665/88809 co-relation queries the response was YES. [2023-11-30 02:48:42,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182421 conditions, 34124 events. 15581/34124 cut-off events. For 84665/88809 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 323639 event pairs, 3703 based on Foata normal form. 0/32029 useless extension candidates. Maximal degree in co-relation 179052. Up to 17648 conditions per place. [2023-11-30 02:48:42,812 INFO L140 encePairwiseOnDemand]: 364/366 looper letters, 53 selfloop transitions, 1 changer transitions 4/2875 dead transitions. [2023-11-30 02:48:42,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 2875 transitions, 44442 flow [2023-11-30 02:48:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:48:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:48:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2023-11-30 02:48:42,813 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9480874316939891 [2023-11-30 02:48:42,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1041 transitions. [2023-11-30 02:48:42,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1041 transitions. [2023-11-30 02:48:42,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:48:42,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1041 transitions. [2023-11-30 02:48:42,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.0) internal successors, (1041), 3 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:42,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:42,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:42,815 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 57 predicate places. [2023-11-30 02:48:42,816 INFO L500 AbstractCegarLoop]: Abstraction has has 389 places, 2875 transitions, 44442 flow [2023-11-30 02:48:42,816 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:42,816 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:48:42,816 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:48:42,816 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 02:48:42,816 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-11-30 02:48:42,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:48:42,816 INFO L85 PathProgramCache]: Analyzing trace with hash -774548554, now seen corresponding path program 1 times [2023-11-30 02:48:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:48:42,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432799656] [2023-11-30 02:48:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:48:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:48:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:48:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-30 02:48:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:48:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432799656] [2023-11-30 02:48:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432799656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:48:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:48:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:48:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350913763] [2023-11-30 02:48:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:48:42,878 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:48:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:48:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:48:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:48:42,878 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 366 [2023-11-30 02:48:42,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 2875 transitions, 44442 flow. Second operand has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:42,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:48:42,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 366 [2023-11-30 02:48:42,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:48:54,403 INFO L124 PetriNetUnfolderBase]: 15581/34119 cut-off events. [2023-11-30 02:48:54,403 INFO L125 PetriNetUnfolderBase]: For 90904/95048 co-relation queries the response was YES. [2023-11-30 02:48:54,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183111 conditions, 34119 events. 15581/34119 cut-off events. For 90904/95048 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 323410 event pairs, 3703 based on Foata normal form. 5/32029 useless extension candidates. Maximal degree in co-relation 179682. Up to 17648 conditions per place. [2023-11-30 02:48:54,639 INFO L140 encePairwiseOnDemand]: 364/366 looper letters, 0 selfloop transitions, 0 changer transitions 2874/2874 dead transitions. [2023-11-30 02:48:54,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 2874 transitions, 44544 flow [2023-11-30 02:48:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:48:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:48:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2023-11-30 02:48:54,640 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9471766848816029 [2023-11-30 02:48:54,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1040 transitions. [2023-11-30 02:48:54,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1040 transitions. [2023-11-30 02:48:54,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:48:54,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1040 transitions. [2023-11-30 02:48:54,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:54,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:54,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:54,643 INFO L307 CegarLoopForPetriNet]: 332 programPoint places, 58 predicate places. [2023-11-30 02:48:54,643 INFO L500 AbstractCegarLoop]: Abstraction has has 390 places, 2874 transitions, 44544 flow [2023-11-30 02:48:54,643 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:48:54,650 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-chromosome-opt-symm.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 02:48:54,737 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2023-11-30 02:48:54,738 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2023-11-30 02:48:54,739 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2023-11-30 02:48:54,740 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2023-11-30 02:48:54,741 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2023-11-30 02:48:54,741 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2023-11-30 02:48:54,741 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2023-11-30 02:48:54,741 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2023-11-30 02:48:54,741 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2023-11-30 02:48:54,741 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2023-11-30 02:48:54,741 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2023-11-30 02:48:54,741 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 02:48:54,741 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:48:54,745 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 02:48:54,745 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 02:48:54,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:48:54 BasicIcfg [2023-11-30 02:48:54,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 02:48:54,753 INFO L158 Benchmark]: Toolchain (without parser) took 153276.75ms. Allocated memory was 381.7MB in the beginning and 15.0GB in the end (delta: 14.6GB). Free memory was 345.9MB in the beginning and 10.4GB in the end (delta: -10.0GB). Peak memory consumption was 4.7GB. Max. memory is 16.0GB. [2023-11-30 02:48:54,753 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 381.7MB. Free memory is still 337.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 02:48:54,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.09ms. Allocated memory is still 381.7MB. Free memory was 345.9MB in the beginning and 333.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 02:48:54,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.24ms. Allocated memory is still 381.7MB. Free memory was 333.3MB in the beginning and 330.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 02:48:54,754 INFO L158 Benchmark]: Boogie Preprocessor took 26.38ms. Allocated memory is still 381.7MB. Free memory was 330.1MB in the beginning and 327.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:48:54,754 INFO L158 Benchmark]: RCFGBuilder took 537.70ms. Allocated memory is still 381.7MB. Free memory was 326.7MB in the beginning and 294.8MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-11-30 02:48:54,754 INFO L158 Benchmark]: TraceAbstraction took 152494.59ms. Allocated memory was 381.7MB in the beginning and 15.0GB in the end (delta: 14.6GB). Free memory was 294.0MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 4.7GB. Max. memory is 16.0GB. [2023-11-30 02:48:54,755 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 381.7MB. Free memory is still 337.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 182.09ms. Allocated memory is still 381.7MB. Free memory was 345.9MB in the beginning and 333.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.24ms. Allocated memory is still 381.7MB. Free memory was 333.3MB in the beginning and 330.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.38ms. Allocated memory is still 381.7MB. Free memory was 330.1MB in the beginning and 327.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 537.70ms. Allocated memory is still 381.7MB. Free memory was 326.7MB in the beginning and 294.8MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 152494.59ms. Allocated memory was 381.7MB in the beginning and 15.0GB in the end (delta: 14.6GB). Free memory was 294.0MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 4.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 508 locations, 56 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 152.3s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 145.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1228 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1228 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3339 IncrementalHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 728 mSolverCounterUnsat, 570 mSDtfsCounter, 3339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1029 GetRequests, 914 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44544occurred in iteration=22, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 4892 NumberOfCodeBlocks, 4802 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5221 ConstructedInterpolants, 0 QuantifiedInterpolants, 7791 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1131 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 3487/3682 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 02:48:54,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...