/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/security.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:28:27,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:28:27,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:28:27,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:28:27,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:28:27,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:28:27,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:28:27,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:28:27,917 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:28:27,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:28:27,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:28:27,918 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:28:27,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:28:27,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:28:27,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:28:27,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:28:27,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:28:27,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:28:27,920 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:28:27,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:28:27,920 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:28:27,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:28:27,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:28:27,921 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:28:27,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:28:27,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:28:27,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:28:27,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:28:27,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:28:27,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:28:27,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:28:27,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:28:27,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:28:27,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:28:28,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:28:28,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:28:28,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:28:28,087 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:28:28,087 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:28:28,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/security.wvr.c [2023-11-30 03:28:29,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:28:29,271 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:28:29,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/security.wvr.c [2023-11-30 03:28:29,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9c3eb7c2/df2276442f5b401f84deff6046792aa1/FLAG7eb69a2d4 [2023-11-30 03:28:29,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9c3eb7c2/df2276442f5b401f84deff6046792aa1 [2023-11-30 03:28:29,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:28:29,295 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:28:29,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:28:29,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:28:29,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:28:29,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3433843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29, skipping insertion in model container [2023-11-30 03:28:29,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,316 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:28:29,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:28:29,433 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:28:29,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:28:29,458 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:28:29,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29 WrapperNode [2023-11-30 03:28:29,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:28:29,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:28:29,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:28:29,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:28:29,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,487 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2023-11-30 03:28:29,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:28:29,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:28:29,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:28:29,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:28:29,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:28:29,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:28:29,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:28:29,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:28:29,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (1/1) ... [2023-11-30 03:28:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:28:29,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:28:29,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:28:29,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:28:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:28:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:28:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:28:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:28:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:28:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:28:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:28:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:28:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:28:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:28:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:28:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:28:29,586 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:28:29,648 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:28:29,650 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:28:29,871 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:28:29,880 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:28:29,880 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:28:29,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:28:29 BoogieIcfgContainer [2023-11-30 03:28:29,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:28:29,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:28:29,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:28:29,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:28:29,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:28:29" (1/3) ... [2023-11-30 03:28:29,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4cf31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:28:29, skipping insertion in model container [2023-11-30 03:28:29,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:28:29" (2/3) ... [2023-11-30 03:28:29,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4cf31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:28:29, skipping insertion in model container [2023-11-30 03:28:29,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:28:29" (3/3) ... [2023-11-30 03:28:29,888 INFO L112 eAbstractionObserver]: Analyzing ICFG security.wvr.c [2023-11-30 03:28:29,900 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:28:29,900 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-11-30 03:28:29,900 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:28:29,966 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:28:29,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 165 transitions, 344 flow [2023-11-30 03:28:30,078 INFO L124 PetriNetUnfolderBase]: 3/163 cut-off events. [2023-11-30 03:28:30,079 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:28:30,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 3/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 251 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-11-30 03:28:30,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 165 transitions, 344 flow [2023-11-30 03:28:30,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 142 transitions, 296 flow [2023-11-30 03:28:30,102 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:28:30,110 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;@1aac7770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:28:30,110 INFO L363 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-11-30 03:28:30,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:28:30,114 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-30 03:28:30,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:28:30,114 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:30,115 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:28:30,115 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:30,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash -175688006, now seen corresponding path program 1 times [2023-11-30 03:28:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:30,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658845369] [2023-11-30 03:28:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:30,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:30,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658845369] [2023-11-30 03:28:30,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658845369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:30,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:30,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881892807] [2023-11-30 03:28:30,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:30,319 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:30,355 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 165 [2023-11-30 03:28:30,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:30,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 165 [2023-11-30 03:28:30,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:30,468 INFO L124 PetriNetUnfolderBase]: 18/266 cut-off events. [2023-11-30 03:28:30,468 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-30 03:28:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 266 events. 18/266 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 866 event pairs, 15 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 239. Up to 44 conditions per place. [2023-11-30 03:28:30,475 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 13 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-11-30 03:28:30,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 324 flow [2023-11-30 03:28:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-11-30 03:28:30,490 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9171717171717172 [2023-11-30 03:28:30,490 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-11-30 03:28:30,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-11-30 03:28:30,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:30,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-11-30 03:28:30,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,509 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 1 predicate places. [2023-11-30 03:28:30,509 INFO L500 AbstractCegarLoop]: Abstraction has has 148 places, 141 transitions, 324 flow [2023-11-30 03:28:30,510 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,510 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:30,510 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:28:30,511 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:28:30,511 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:30,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1724557471, now seen corresponding path program 1 times [2023-11-30 03:28:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:30,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063411095] [2023-11-30 03:28:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063411095] [2023-11-30 03:28:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063411095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:30,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146592127] [2023-11-30 03:28:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:30,580 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:30,582 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 165 [2023-11-30 03:28:30,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 141 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:30,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 165 [2023-11-30 03:28:30,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:30,616 INFO L124 PetriNetUnfolderBase]: 25/260 cut-off events. [2023-11-30 03:28:30,616 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-11-30 03:28:30,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 260 events. 25/260 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 964 event pairs, 20 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 279. Up to 51 conditions per place. [2023-11-30 03:28:30,618 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 10 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-11-30 03:28:30,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 141 transitions, 353 flow [2023-11-30 03:28:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2023-11-30 03:28:30,620 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9414141414141414 [2023-11-30 03:28:30,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2023-11-30 03:28:30,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2023-11-30 03:28:30,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:30,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2023-11-30 03:28:30,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,623 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 2 predicate places. [2023-11-30 03:28:30,623 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 141 transitions, 353 flow [2023-11-30 03:28:30,623 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,623 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:30,624 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:28:30,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:28:30,624 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:30,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2030875890, now seen corresponding path program 1 times [2023-11-30 03:28:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194172796] [2023-11-30 03:28:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194172796] [2023-11-30 03:28:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194172796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:30,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:30,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394418839] [2023-11-30 03:28:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:30,670 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:30,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:30,672 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 165 [2023-11-30 03:28:30,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 141 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:30,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 165 [2023-11-30 03:28:30,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:30,709 INFO L124 PetriNetUnfolderBase]: 33/293 cut-off events. [2023-11-30 03:28:30,709 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-11-30 03:28:30,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 293 events. 33/293 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1238 event pairs, 19 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 296. Up to 58 conditions per place. [2023-11-30 03:28:30,711 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 11 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-11-30 03:28:30,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 141 transitions, 386 flow [2023-11-30 03:28:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2023-11-30 03:28:30,712 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9414141414141414 [2023-11-30 03:28:30,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2023-11-30 03:28:30,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2023-11-30 03:28:30,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:30,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2023-11-30 03:28:30,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,715 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 3 predicate places. [2023-11-30 03:28:30,716 INFO L500 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 386 flow [2023-11-30 03:28:30,716 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,716 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:30,716 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:28:30,716 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:28:30,716 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:30,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:30,717 INFO L85 PathProgramCache]: Analyzing trace with hash -5715897, now seen corresponding path program 1 times [2023-11-30 03:28:30,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178332050] [2023-11-30 03:28:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178332050] [2023-11-30 03:28:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178332050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:30,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:30,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092326871] [2023-11-30 03:28:30,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:30,748 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:30,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:30,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:30,750 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 165 [2023-11-30 03:28:30,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:30,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 165 [2023-11-30 03:28:30,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:30,801 INFO L124 PetriNetUnfolderBase]: 54/492 cut-off events. [2023-11-30 03:28:30,801 INFO L125 PetriNetUnfolderBase]: For 479/482 co-relation queries the response was YES. [2023-11-30 03:28:30,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 492 events. 54/492 cut-off events. For 479/482 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2709 event pairs, 24 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 517. Up to 102 conditions per place. [2023-11-30 03:28:30,804 INFO L140 encePairwiseOnDemand]: 163/165 looper letters, 13 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2023-11-30 03:28:30,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 144 transitions, 454 flow [2023-11-30 03:28:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-11-30 03:28:30,805 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9515151515151515 [2023-11-30 03:28:30,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-11-30 03:28:30,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-11-30 03:28:30,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:30,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-11-30 03:28:30,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,808 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 4 predicate places. [2023-11-30 03:28:30,808 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 454 flow [2023-11-30 03:28:30,809 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,809 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:30,809 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] [2023-11-30 03:28:30,809 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:28:30,809 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:30,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1227581687, now seen corresponding path program 1 times [2023-11-30 03:28:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:30,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384691439] [2023-11-30 03:28:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384691439] [2023-11-30 03:28:30,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384691439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:30,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:30,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:30,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137959147] [2023-11-30 03:28:30,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:30,836 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:30,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:30,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:30,837 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 165 [2023-11-30 03:28:30,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:30,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 165 [2023-11-30 03:28:30,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:30,900 INFO L124 PetriNetUnfolderBase]: 67/495 cut-off events. [2023-11-30 03:28:30,901 INFO L125 PetriNetUnfolderBase]: For 866/869 co-relation queries the response was YES. [2023-11-30 03:28:30,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 495 events. 67/495 cut-off events. For 866/869 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2836 event pairs, 30 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 627. Up to 115 conditions per place. [2023-11-30 03:28:30,903 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 19 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2023-11-30 03:28:30,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 507 flow [2023-11-30 03:28:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-11-30 03:28:30,905 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2023-11-30 03:28:30,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-11-30 03:28:30,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-11-30 03:28:30,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:30,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-11-30 03:28:30,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,909 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 5 predicate places. [2023-11-30 03:28:30,909 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 507 flow [2023-11-30 03:28:30,910 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:30,910 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:30,910 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] [2023-11-30 03:28:30,910 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:28:30,910 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:30,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2012490719, now seen corresponding path program 1 times [2023-11-30 03:28:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873351798] [2023-11-30 03:28:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:31,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:31,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873351798] [2023-11-30 03:28:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873351798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:28:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767511820] [2023-11-30 03:28:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:31,205 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:28:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:28:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:28:31,206 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 165 [2023-11-30 03:28:31,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:31,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 165 [2023-11-30 03:28:31,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:31,277 INFO L124 PetriNetUnfolderBase]: 66/445 cut-off events. [2023-11-30 03:28:31,278 INFO L125 PetriNetUnfolderBase]: For 2996/3143 co-relation queries the response was YES. [2023-11-30 03:28:31,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 445 events. 66/445 cut-off events. For 2996/3143 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2508 event pairs, 32 based on Foata normal form. 32/397 useless extension candidates. Maximal degree in co-relation 601. Up to 112 conditions per place. [2023-11-30 03:28:31,281 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 22 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2023-11-30 03:28:31,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 143 transitions, 557 flow [2023-11-30 03:28:31,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:28:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:28:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2023-11-30 03:28:31,283 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8686868686868687 [2023-11-30 03:28:31,284 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2023-11-30 03:28:31,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2023-11-30 03:28:31,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:31,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2023-11-30 03:28:31,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,288 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,290 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2023-11-30 03:28:31,291 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 143 transitions, 557 flow [2023-11-30 03:28:31,291 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,291 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:31,291 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] [2023-11-30 03:28:31,291 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:28:31,291 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:31,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -224128531, now seen corresponding path program 1 times [2023-11-30 03:28:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486711042] [2023-11-30 03:28:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:31,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:31,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486711042] [2023-11-30 03:28:31,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486711042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:31,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:31,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:31,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060246231] [2023-11-30 03:28:31,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:31,336 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:31,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:31,337 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 165 [2023-11-30 03:28:31,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 143 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:31,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 165 [2023-11-30 03:28:31,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:31,390 INFO L124 PetriNetUnfolderBase]: 67/428 cut-off events. [2023-11-30 03:28:31,390 INFO L125 PetriNetUnfolderBase]: For 2110/2147 co-relation queries the response was YES. [2023-11-30 03:28:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 428 events. 67/428 cut-off events. For 2110/2147 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2371 event pairs, 44 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 647. Up to 113 conditions per place. [2023-11-30 03:28:31,393 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 19 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2023-11-30 03:28:31,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 143 transitions, 612 flow [2023-11-30 03:28:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-11-30 03:28:31,394 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9272727272727272 [2023-11-30 03:28:31,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-11-30 03:28:31,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-11-30 03:28:31,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:31,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-11-30 03:28:31,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,397 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2023-11-30 03:28:31,397 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 143 transitions, 612 flow [2023-11-30 03:28:31,398 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,398 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:31,398 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] [2023-11-30 03:28:31,398 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:28:31,398 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:31,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 760878340, now seen corresponding path program 1 times [2023-11-30 03:28:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290491384] [2023-11-30 03:28:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290491384] [2023-11-30 03:28:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290491384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:31,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:31,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482568559] [2023-11-30 03:28:31,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:31,424 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:31,425 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 165 [2023-11-30 03:28:31,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 143 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:31,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 165 [2023-11-30 03:28:31,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:31,472 INFO L124 PetriNetUnfolderBase]: 65/438 cut-off events. [2023-11-30 03:28:31,472 INFO L125 PetriNetUnfolderBase]: For 2566/2603 co-relation queries the response was YES. [2023-11-30 03:28:31,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 438 events. 65/438 cut-off events. For 2566/2603 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2428 event pairs, 26 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 657. Up to 111 conditions per place. [2023-11-30 03:28:31,476 INFO L140 encePairwiseOnDemand]: 163/165 looper letters, 19 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2023-11-30 03:28:31,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 144 transitions, 684 flow [2023-11-30 03:28:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-11-30 03:28:31,477 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-11-30 03:28:31,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-11-30 03:28:31,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-11-30 03:28:31,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:31,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-11-30 03:28:31,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,481 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2023-11-30 03:28:31,481 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 144 transitions, 684 flow [2023-11-30 03:28:31,481 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,482 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:31,482 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] [2023-11-30 03:28:31,483 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:28:31,484 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:31,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2110143892, now seen corresponding path program 1 times [2023-11-30 03:28:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:31,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108690934] [2023-11-30 03:28:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108690934] [2023-11-30 03:28:31,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108690934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:31,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:31,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:31,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815449397] [2023-11-30 03:28:31,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:31,508 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:31,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:31,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:31,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:31,510 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 165 [2023-11-30 03:28:31,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 144 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:31,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 165 [2023-11-30 03:28:31,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:31,606 INFO L124 PetriNetUnfolderBase]: 84/595 cut-off events. [2023-11-30 03:28:31,607 INFO L125 PetriNetUnfolderBase]: For 4322/4487 co-relation queries the response was YES. [2023-11-30 03:28:31,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 595 events. 84/595 cut-off events. For 4322/4487 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3800 event pairs, 44 based on Foata normal form. 2/486 useless extension candidates. Maximal degree in co-relation 916. Up to 162 conditions per place. [2023-11-30 03:28:31,610 INFO L140 encePairwiseOnDemand]: 163/165 looper letters, 21 selfloop transitions, 1 changer transitions 0/147 dead transitions. [2023-11-30 03:28:31,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 147 transitions, 808 flow [2023-11-30 03:28:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-11-30 03:28:31,611 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9494949494949495 [2023-11-30 03:28:31,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-11-30 03:28:31,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-11-30 03:28:31,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:31,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-11-30 03:28:31,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,614 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 12 predicate places. [2023-11-30 03:28:31,614 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 808 flow [2023-11-30 03:28:31,614 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,615 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:31,615 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 03:28:31,615 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:28:31,615 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:31,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1059657254, now seen corresponding path program 1 times [2023-11-30 03:28:31,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:31,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727623531] [2023-11-30 03:28:31,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:31,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727623531] [2023-11-30 03:28:31,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727623531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:31,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:31,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903121760] [2023-11-30 03:28:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:31,643 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:31,646 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 165 [2023-11-30 03:28:31,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:31,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 165 [2023-11-30 03:28:31,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:31,706 INFO L124 PetriNetUnfolderBase]: 58/574 cut-off events. [2023-11-30 03:28:31,706 INFO L125 PetriNetUnfolderBase]: For 5001/5202 co-relation queries the response was YES. [2023-11-30 03:28:31,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 574 events. 58/574 cut-off events. For 5001/5202 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3408 event pairs, 19 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 846. Up to 110 conditions per place. [2023-11-30 03:28:31,709 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 26 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2023-11-30 03:28:31,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 149 transitions, 910 flow [2023-11-30 03:28:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-11-30 03:28:31,711 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2023-11-30 03:28:31,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-11-30 03:28:31,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-11-30 03:28:31,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:31,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-11-30 03:28:31,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,714 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 12 predicate places. [2023-11-30 03:28:31,714 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 910 flow [2023-11-30 03:28:31,715 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,715 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:31,715 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:28:31,715 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:28:31,715 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:31,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash 594145846, now seen corresponding path program 1 times [2023-11-30 03:28:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190480662] [2023-11-30 03:28:31,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:31,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190480662] [2023-11-30 03:28:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190480662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440180015] [2023-11-30 03:28:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:31,747 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:31,748 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 165 [2023-11-30 03:28:31,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 910 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:31,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 165 [2023-11-30 03:28:31,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:31,847 INFO L124 PetriNetUnfolderBase]: 84/580 cut-off events. [2023-11-30 03:28:31,847 INFO L125 PetriNetUnfolderBase]: For 10006/10665 co-relation queries the response was YES. [2023-11-30 03:28:31,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 580 events. 84/580 cut-off events. For 10006/10665 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3844 event pairs, 28 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 1183. Up to 136 conditions per place. [2023-11-30 03:28:31,851 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 30 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2023-11-30 03:28:31,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 150 transitions, 1022 flow [2023-11-30 03:28:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-11-30 03:28:31,866 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2023-11-30 03:28:31,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-11-30 03:28:31,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-11-30 03:28:31,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:31,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-11-30 03:28:31,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,881 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2023-11-30 03:28:31,881 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 150 transitions, 1022 flow [2023-11-30 03:28:31,881 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,881 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:31,881 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] [2023-11-30 03:28:31,881 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:28:31,882 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:31,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1890624774, now seen corresponding path program 1 times [2023-11-30 03:28:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301624523] [2023-11-30 03:28:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301624523] [2023-11-30 03:28:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301624523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050495749] [2023-11-30 03:28:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:31,919 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:31,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:31,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:31,919 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 165 [2023-11-30 03:28:31,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 150 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:31,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:31,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 165 [2023-11-30 03:28:31,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:31,995 INFO L124 PetriNetUnfolderBase]: 86/529 cut-off events. [2023-11-30 03:28:31,995 INFO L125 PetriNetUnfolderBase]: For 11837/13288 co-relation queries the response was YES. [2023-11-30 03:28:32,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 529 events. 86/529 cut-off events. For 11837/13288 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3409 event pairs, 24 based on Foata normal form. 6/453 useless extension candidates. Maximal degree in co-relation 1316. Up to 134 conditions per place. [2023-11-30 03:28:32,002 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 31 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2023-11-30 03:28:32,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 151 transitions, 1138 flow [2023-11-30 03:28:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-11-30 03:28:32,004 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9272727272727272 [2023-11-30 03:28:32,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-11-30 03:28:32,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-11-30 03:28:32,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:32,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-11-30 03:28:32,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,008 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2023-11-30 03:28:32,008 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 151 transitions, 1138 flow [2023-11-30 03:28:32,008 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,008 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:32,008 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] [2023-11-30 03:28:32,008 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:28:32,009 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:32,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 639102400, now seen corresponding path program 1 times [2023-11-30 03:28:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:32,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034782565] [2023-11-30 03:28:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:32,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:32,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034782565] [2023-11-30 03:28:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034782565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:32,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979803229] [2023-11-30 03:28:32,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:32,035 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:32,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:32,036 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 165 [2023-11-30 03:28:32,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 151 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:32,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 165 [2023-11-30 03:28:32,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:32,107 INFO L124 PetriNetUnfolderBase]: 82/614 cut-off events. [2023-11-30 03:28:32,108 INFO L125 PetriNetUnfolderBase]: For 12987/14656 co-relation queries the response was YES. [2023-11-30 03:28:32,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 614 events. 82/614 cut-off events. For 12987/14656 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4002 event pairs, 25 based on Foata normal form. 6/539 useless extension candidates. Maximal degree in co-relation 1369. Up to 134 conditions per place. [2023-11-30 03:28:32,112 INFO L140 encePairwiseOnDemand]: 163/165 looper letters, 33 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2023-11-30 03:28:32,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 1316 flow [2023-11-30 03:28:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-11-30 03:28:32,113 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-11-30 03:28:32,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-11-30 03:28:32,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-11-30 03:28:32,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:32,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-11-30 03:28:32,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,117 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 15 predicate places. [2023-11-30 03:28:32,117 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 154 transitions, 1316 flow [2023-11-30 03:28:32,118 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,118 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:32,118 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] [2023-11-30 03:28:32,118 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:28:32,118 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:32,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1149019095, now seen corresponding path program 1 times [2023-11-30 03:28:32,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:32,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055391345] [2023-11-30 03:28:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055391345] [2023-11-30 03:28:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055391345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:32,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:32,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:32,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613039604] [2023-11-30 03:28:32,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:32,138 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:32,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:32,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:32,139 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 165 [2023-11-30 03:28:32,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 154 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:32,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 165 [2023-11-30 03:28:32,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:32,211 INFO L124 PetriNetUnfolderBase]: 90/598 cut-off events. [2023-11-30 03:28:32,211 INFO L125 PetriNetUnfolderBase]: For 16487/17896 co-relation queries the response was YES. [2023-11-30 03:28:32,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 598 events. 90/598 cut-off events. For 16487/17896 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3849 event pairs, 21 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 1405. Up to 142 conditions per place. [2023-11-30 03:28:32,216 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 35 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2023-11-30 03:28:32,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 155 transitions, 1450 flow [2023-11-30 03:28:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2023-11-30 03:28:32,218 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9414141414141414 [2023-11-30 03:28:32,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2023-11-30 03:28:32,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2023-11-30 03:28:32,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:32,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2023-11-30 03:28:32,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,220 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 16 predicate places. [2023-11-30 03:28:32,221 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 155 transitions, 1450 flow [2023-11-30 03:28:32,221 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,221 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:32,221 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] [2023-11-30 03:28:32,221 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:28:32,221 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:32,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash -706842811, now seen corresponding path program 1 times [2023-11-30 03:28:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:32,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930650269] [2023-11-30 03:28:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:32,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:32,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930650269] [2023-11-30 03:28:32,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930650269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:32,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:32,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231209132] [2023-11-30 03:28:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:32,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:32,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:32,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:32,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:32,243 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 165 [2023-11-30 03:28:32,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 155 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:32,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 165 [2023-11-30 03:28:32,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:32,340 INFO L124 PetriNetUnfolderBase]: 106/606 cut-off events. [2023-11-30 03:28:32,341 INFO L125 PetriNetUnfolderBase]: For 23044/24517 co-relation queries the response was YES. [2023-11-30 03:28:32,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2744 conditions, 606 events. 106/606 cut-off events. For 23044/24517 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4176 event pairs, 20 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 1779. Up to 158 conditions per place. [2023-11-30 03:28:32,345 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 38 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2023-11-30 03:28:32,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 158 transitions, 1660 flow [2023-11-30 03:28:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-11-30 03:28:32,346 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2023-11-30 03:28:32,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-11-30 03:28:32,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-11-30 03:28:32,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:32,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-11-30 03:28:32,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,349 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 17 predicate places. [2023-11-30 03:28:32,350 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 1660 flow [2023-11-30 03:28:32,350 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,350 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:32,350 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:28:32,350 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:28:32,350 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:32,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1615595217, now seen corresponding path program 1 times [2023-11-30 03:28:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391738640] [2023-11-30 03:28:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:32,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:32,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391738640] [2023-11-30 03:28:32,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391738640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:32,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:32,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:28:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968677416] [2023-11-30 03:28:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:32,686 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:28:32,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:32,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:28:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:28:32,687 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 165 [2023-11-30 03:28:32,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 1660 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:32,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 165 [2023-11-30 03:28:32,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:32,801 INFO L124 PetriNetUnfolderBase]: 106/585 cut-off events. [2023-11-30 03:28:32,801 INFO L125 PetriNetUnfolderBase]: For 60158/67439 co-relation queries the response was YES. [2023-11-30 03:28:32,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 585 events. 106/585 cut-off events. For 60158/67439 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4003 event pairs, 17 based on Foata normal form. 16/540 useless extension candidates. Maximal degree in co-relation 1838. Up to 158 conditions per place. [2023-11-30 03:28:32,807 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 44 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2023-11-30 03:28:32,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 157 transitions, 1752 flow [2023-11-30 03:28:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:28:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:28:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2023-11-30 03:28:32,809 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8676767676767677 [2023-11-30 03:28:32,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 859 transitions. [2023-11-30 03:28:32,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 859 transitions. [2023-11-30 03:28:32,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:32,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 859 transitions. [2023-11-30 03:28:32,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.16666666666666) internal successors, (859), 6 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,813 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 21 predicate places. [2023-11-30 03:28:32,813 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 1752 flow [2023-11-30 03:28:32,815 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,815 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:32,815 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] [2023-11-30 03:28:32,815 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:28:32,815 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:32,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash -276724239, now seen corresponding path program 1 times [2023-11-30 03:28:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:32,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740566707] [2023-11-30 03:28:32,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:32,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740566707] [2023-11-30 03:28:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740566707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:32,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:32,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146259056] [2023-11-30 03:28:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:32,857 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:32,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:32,858 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 165 [2023-11-30 03:28:32,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 157 transitions, 1752 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:32,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 165 [2023-11-30 03:28:32,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:32,927 INFO L124 PetriNetUnfolderBase]: 106/581 cut-off events. [2023-11-30 03:28:32,927 INFO L125 PetriNetUnfolderBase]: For 70368/77529 co-relation queries the response was YES. [2023-11-30 03:28:32,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 581 events. 106/581 cut-off events. For 70368/77529 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4016 event pairs, 17 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 1912. Up to 158 conditions per place. [2023-11-30 03:28:32,931 INFO L140 encePairwiseOnDemand]: 163/165 looper letters, 37 selfloop transitions, 1 changer transitions 0/156 dead transitions. [2023-11-30 03:28:32,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 156 transitions, 1824 flow [2023-11-30 03:28:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-11-30 03:28:32,933 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9454545454545454 [2023-11-30 03:28:32,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-11-30 03:28:32,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-11-30 03:28:32,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:32,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-11-30 03:28:32,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,936 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 22 predicate places. [2023-11-30 03:28:32,936 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 156 transitions, 1824 flow [2023-11-30 03:28:32,936 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,936 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:28:32,936 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] [2023-11-30 03:28:32,936 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:28:32,937 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2023-11-30 03:28:32,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:28:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash 794903812, now seen corresponding path program 1 times [2023-11-30 03:28:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:28:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27154366] [2023-11-30 03:28:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:28:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:28:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:28:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:28:32,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:28:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27154366] [2023-11-30 03:28:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27154366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:28:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:28:32,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:28:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527667952] [2023-11-30 03:28:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:28:32,971 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:28:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:28:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:28:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:28:32,973 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 165 [2023-11-30 03:28:32,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 156 transitions, 1824 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:32,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:28:32,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 165 [2023-11-30 03:28:32,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:28:33,033 INFO L124 PetriNetUnfolderBase]: 106/570 cut-off events. [2023-11-30 03:28:33,033 INFO L125 PetriNetUnfolderBase]: For 83083/90484 co-relation queries the response was YES. [2023-11-30 03:28:33,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 570 events. 106/570 cut-off events. For 83083/90484 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3903 event pairs, 19 based on Foata normal form. 4/517 useless extension candidates. Maximal degree in co-relation 1984. Up to 158 conditions per place. [2023-11-30 03:28:33,036 INFO L140 encePairwiseOnDemand]: 163/165 looper letters, 0 selfloop transitions, 0 changer transitions 155/155 dead transitions. [2023-11-30 03:28:33,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 155 transitions, 1894 flow [2023-11-30 03:28:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:28:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:28:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-11-30 03:28:33,037 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9434343434343434 [2023-11-30 03:28:33,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-11-30 03:28:33,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-11-30 03:28:33,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:28:33,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-11-30 03:28:33,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:33,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:33,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:33,039 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, 23 predicate places. [2023-11-30 03:28:33,039 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 155 transitions, 1894 flow [2023-11-30 03:28:33,040 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:28:33,045 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/security.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:28:33,077 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2023-11-30 03:28:33,077 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2023-11-30 03:28:33,078 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2023-11-30 03:28:33,079 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2023-11-30 03:28:33,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2023-11-30 03:28:33,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2023-11-30 03:28:33,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2023-11-30 03:28:33,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2023-11-30 03:28:33,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2023-11-30 03:28:33,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2023-11-30 03:28:33,080 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2023-11-30 03:28:33,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2023-11-30 03:28:33,081 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2023-11-30 03:28:33,081 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:28:33,081 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:28:33,085 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:28:33,085 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:28:33,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:28:33 BasicIcfg [2023-11-30 03:28:33,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:28:33,092 INFO L158 Benchmark]: Toolchain (without parser) took 3796.42ms. Allocated memory was 474.0MB in the beginning and 700.4MB in the end (delta: 226.5MB). Free memory was 432.6MB in the beginning and 344.4MB in the end (delta: 88.2MB). Peak memory consumption was 316.3MB. Max. memory is 16.0GB. [2023-11-30 03:28:33,092 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 333.4MB. Free memory was 285.6MB in the beginning and 285.4MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:28:33,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.56ms. Allocated memory is still 474.0MB. Free memory was 432.6MB in the beginning and 421.3MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:28:33,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.68ms. Allocated memory is still 474.0MB. Free memory was 421.3MB in the beginning and 419.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:28:33,092 INFO L158 Benchmark]: Boogie Preprocessor took 21.20ms. Allocated memory is still 474.0MB. Free memory was 419.6MB in the beginning and 417.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:28:33,093 INFO L158 Benchmark]: RCFGBuilder took 371.66ms. Allocated memory is still 474.0MB. Free memory was 417.9MB in the beginning and 401.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-11-30 03:28:33,093 INFO L158 Benchmark]: TraceAbstraction took 3208.04ms. Allocated memory was 474.0MB in the beginning and 700.4MB in the end (delta: 226.5MB). Free memory was 400.6MB in the beginning and 344.4MB in the end (delta: 56.2MB). Peak memory consumption was 284.8MB. Max. memory is 16.0GB. [2023-11-30 03:28:33,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 333.4MB. Free memory was 285.6MB in the beginning and 285.4MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 162.56ms. Allocated memory is still 474.0MB. Free memory was 432.6MB in the beginning and 421.3MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.68ms. Allocated memory is still 474.0MB. Free memory was 421.3MB in the beginning and 419.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 21.20ms. Allocated memory is still 474.0MB. Free memory was 419.6MB in the beginning and 417.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 371.66ms. Allocated memory is still 474.0MB. Free memory was 417.9MB in the beginning and 401.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 3208.04ms. Allocated memory was 474.0MB in the beginning and 700.4MB in the end (delta: 226.5MB). Free memory was 400.6MB in the beginning and 344.4MB in the end (delta: 56.2MB). Peak memory consumption was 284.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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, 247 locations, 35 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: 3.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 110 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1894occurred in iteration=18, InterpolantAutomatonStates: 60, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 931 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 1107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:28:33,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...