/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/parallel-parallel-sum-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:09:49,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:09:49,146 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:09:49,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:09:49,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:09:49,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:09:49,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:09:49,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:09:49,172 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:09:49,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:09:49,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:09:49,175 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:09:49,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:09:49,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:09:49,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:09:49,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:09:49,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:09:49,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:09:49,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:09:49,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:09:49,177 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:09:49,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:09:49,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:09:49,178 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:09:49,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:09:49,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:09:49,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:09:49,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:09:49,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:09:49,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:09:49,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:09:49,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:09:49,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:09:49,181 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:09:49,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:09:49,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:09:49,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:09:49,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:09:49,388 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:09:49,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2023-11-30 03:09:50,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:09:50,472 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:09:50,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2023-11-30 03:09:50,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2adebde/4cdab8e04d644b3b84bcc0f02d1687ab/FLAG489187dec [2023-11-30 03:09:50,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2adebde/4cdab8e04d644b3b84bcc0f02d1687ab [2023-11-30 03:09:50,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:09:50,489 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:09:50,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:09:50,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:09:50,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:09:50,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698a6cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50, skipping insertion in model container [2023-11-30 03:09:50,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,509 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:09:50,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:09:50,629 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:09:50,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:09:50,663 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:09:50,663 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:09:50,667 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:09:50,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50 WrapperNode [2023-11-30 03:09:50,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:09:50,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:09:50,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:09:50,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:09:50,673 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:09:50" (1/1) ... [2023-11-30 03:09:50,681 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:09:50" (1/1) ... [2023-11-30 03:09:50,704 INFO L138 Inliner]: procedures = 27, calls = 69, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 558 [2023-11-30 03:09:50,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:09:50,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:09:50,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:09:50,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:09:50,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:09:50,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:09:50,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:09:50,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:09:50,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (1/1) ... [2023-11-30 03:09:50,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:09:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:09:50,805 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:09:50,830 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:09:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:09:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:09:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:09:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:09:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:09:50,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:09:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:09:50,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:09:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:09:50,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:09:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:09:50,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:09:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:09:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:09:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:09:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:09:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:09:50,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:09:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:09:50,851 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:09:50,976 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:09:50,978 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:09:51,610 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:09:51,833 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:09:51,834 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-30 03:09:51,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:09:51 BoogieIcfgContainer [2023-11-30 03:09:51,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:09:51,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:09:51,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:09:51,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:09:51,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:09:50" (1/3) ... [2023-11-30 03:09:51,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb4d94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:09:51, skipping insertion in model container [2023-11-30 03:09:51,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:09:50" (2/3) ... [2023-11-30 03:09:51,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb4d94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:09:51, skipping insertion in model container [2023-11-30 03:09:51,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:09:51" (3/3) ... [2023-11-30 03:09:51,841 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2023-11-30 03:09:51,853 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:09:51,853 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2023-11-30 03:09:51,854 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:09:51,923 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 03:09:51,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 419 transitions, 866 flow [2023-11-30 03:09:52,019 INFO L124 PetriNetUnfolderBase]: 20/415 cut-off events. [2023-11-30 03:09:52,019 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:09:52,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 415 events. 20/415 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 512 event pairs, 0 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 308. Up to 2 conditions per place. [2023-11-30 03:09:52,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 412 places, 419 transitions, 866 flow [2023-11-30 03:09:52,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 381 places, 386 transitions, 796 flow [2023-11-30 03:09:52,036 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:09:52,040 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;@3ae33e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:09:52,041 INFO L363 AbstractCegarLoop]: Starting to check reachability of 122 error locations. [2023-11-30 03:09:52,044 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:09:52,044 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2023-11-30 03:09:52,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:09:52,044 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:52,045 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:09:52,045 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:52,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash 524621875, now seen corresponding path program 1 times [2023-11-30 03:09:52,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:52,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132757522] [2023-11-30 03:09:52,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:52,199 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:09:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132757522] [2023-11-30 03:09:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132757522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573334742] [2023-11-30 03:09:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:52,206 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:52,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:52,226 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 419 [2023-11-30 03:09:52,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 386 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have 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:09:52,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:52,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 419 [2023-11-30 03:09:52,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:52,602 INFO L124 PetriNetUnfolderBase]: 483/1580 cut-off events. [2023-11-30 03:09:52,602 INFO L125 PetriNetUnfolderBase]: For 276/284 co-relation queries the response was YES. [2023-11-30 03:09:52,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1580 events. 483/1580 cut-off events. For 276/284 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9275 event pairs, 262 based on Foata normal form. 347/1761 useless extension candidates. Maximal degree in co-relation 1968. Up to 647 conditions per place. [2023-11-30 03:09:52,614 INFO L140 encePairwiseOnDemand]: 363/419 looper letters, 28 selfloop transitions, 2 changer transitions 4/332 dead transitions. [2023-11-30 03:09:52,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 332 transitions, 748 flow [2023-11-30 03:09:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1080 transitions. [2023-11-30 03:09:52,628 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8591885441527446 [2023-11-30 03:09:52,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1080 transitions. [2023-11-30 03:09:52,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1080 transitions. [2023-11-30 03:09:52,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:52,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1080 transitions. [2023-11-30 03:09:52,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have 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:09:52,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:52,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:52,645 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -43 predicate places. [2023-11-30 03:09:52,646 INFO L500 AbstractCegarLoop]: Abstraction has has 338 places, 332 transitions, 748 flow [2023-11-30 03:09:52,646 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have 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:09:52,647 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:52,647 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:09:52,647 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:09:52,647 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:52,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash 242826490, now seen corresponding path program 1 times [2023-11-30 03:09:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:52,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868616872] [2023-11-30 03:09:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:52,730 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:09:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868616872] [2023-11-30 03:09:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868616872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:52,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539996672] [2023-11-30 03:09:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:52,733 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:52,735 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 419 [2023-11-30 03:09:52,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 332 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have 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:09:52,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:52,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 419 [2023-11-30 03:09:52,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:52,962 INFO L124 PetriNetUnfolderBase]: 483/1579 cut-off events. [2023-11-30 03:09:52,962 INFO L125 PetriNetUnfolderBase]: For 480/664 co-relation queries the response was YES. [2023-11-30 03:09:52,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3032 conditions, 1579 events. 483/1579 cut-off events. For 480/664 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9281 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 2562. Up to 647 conditions per place. [2023-11-30 03:09:52,977 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 25 selfloop transitions, 2 changer transitions 4/331 dead transitions. [2023-11-30 03:09:52,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 331 transitions, 800 flow [2023-11-30 03:09:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1033 transitions. [2023-11-30 03:09:52,979 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8217979315831344 [2023-11-30 03:09:52,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1033 transitions. [2023-11-30 03:09:52,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1033 transitions. [2023-11-30 03:09:52,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:52,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1033 transitions. [2023-11-30 03:09:52,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have 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:09:52,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:52,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:52,984 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -42 predicate places. [2023-11-30 03:09:52,985 INFO L500 AbstractCegarLoop]: Abstraction has has 339 places, 331 transitions, 800 flow [2023-11-30 03:09:52,985 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have 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:09:52,985 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:52,985 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:09:52,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:09:52,986 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:52,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash 784501546, now seen corresponding path program 1 times [2023-11-30 03:09:52,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:52,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994404208] [2023-11-30 03:09:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:53,056 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:09:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994404208] [2023-11-30 03:09:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994404208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579776214] [2023-11-30 03:09:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:53,058 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:53,059 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 419 [2023-11-30 03:09:53,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 331 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:53,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:53,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 419 [2023-11-30 03:09:53,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:53,334 INFO L124 PetriNetUnfolderBase]: 483/1578 cut-off events. [2023-11-30 03:09:53,334 INFO L125 PetriNetUnfolderBase]: For 835/1195 co-relation queries the response was YES. [2023-11-30 03:09:53,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3671 conditions, 1578 events. 483/1578 cut-off events. For 835/1195 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9228 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 3156. Up to 647 conditions per place. [2023-11-30 03:09:53,346 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 19 selfloop transitions, 2 changer transitions 4/330 dead transitions. [2023-11-30 03:09:53,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 330 transitions, 840 flow [2023-11-30 03:09:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2023-11-30 03:09:53,348 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8313444709626094 [2023-11-30 03:09:53,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:53,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have 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:09:53,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:53,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:53,353 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -41 predicate places. [2023-11-30 03:09:53,353 INFO L500 AbstractCegarLoop]: Abstraction has has 340 places, 330 transitions, 840 flow [2023-11-30 03:09:53,354 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:53,354 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:53,354 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] [2023-11-30 03:09:53,354 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:09:53,354 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:53,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1129643101, now seen corresponding path program 1 times [2023-11-30 03:09:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:53,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977164922] [2023-11-30 03:09:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:53,383 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:09:53,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977164922] [2023-11-30 03:09:53,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977164922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:53,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:53,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756737710] [2023-11-30 03:09:53,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:53,384 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:53,385 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 419 [2023-11-30 03:09:53,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 330 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:53,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:53,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 419 [2023-11-30 03:09:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:53,577 INFO L124 PetriNetUnfolderBase]: 483/1577 cut-off events. [2023-11-30 03:09:53,577 INFO L125 PetriNetUnfolderBase]: For 1341/1877 co-relation queries the response was YES. [2023-11-30 03:09:53,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 1577 events. 483/1577 cut-off events. For 1341/1877 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9266 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 3750. Up to 647 conditions per place. [2023-11-30 03:09:53,593 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 19 selfloop transitions, 2 changer transitions 4/329 dead transitions. [2023-11-30 03:09:53,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 329 transitions, 880 flow [2023-11-30 03:09:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2023-11-30 03:09:53,595 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8313444709626094 [2023-11-30 03:09:53,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:53,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have 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:09:53,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:53,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:53,600 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -40 predicate places. [2023-11-30 03:09:53,600 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 329 transitions, 880 flow [2023-11-30 03:09:53,600 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:53,600 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:53,600 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] [2023-11-30 03:09:53,601 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:09:53,601 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:53,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1770838467, now seen corresponding path program 1 times [2023-11-30 03:09:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199288388] [2023-11-30 03:09:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:53,653 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:09:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199288388] [2023-11-30 03:09:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199288388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:53,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:53,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:53,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542969311] [2023-11-30 03:09:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:53,654 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:53,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:53,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:53,679 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 419 [2023-11-30 03:09:53,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 329 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:53,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:53,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 419 [2023-11-30 03:09:53,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:53,885 INFO L124 PetriNetUnfolderBase]: 483/1576 cut-off events. [2023-11-30 03:09:53,885 INFO L125 PetriNetUnfolderBase]: For 1998/2710 co-relation queries the response was YES. [2023-11-30 03:09:53,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4949 conditions, 1576 events. 483/1576 cut-off events. For 1998/2710 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9220 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 4344. Up to 647 conditions per place. [2023-11-30 03:09:53,903 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 19 selfloop transitions, 2 changer transitions 4/328 dead transitions. [2023-11-30 03:09:53,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 328 transitions, 920 flow [2023-11-30 03:09:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2023-11-30 03:09:53,905 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8313444709626094 [2023-11-30 03:09:53,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:53,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2023-11-30 03:09:53,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have 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:09:53,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:53,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:53,912 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -39 predicate places. [2023-11-30 03:09:53,912 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 328 transitions, 920 flow [2023-11-30 03:09:53,913 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:53,913 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:53,913 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] [2023-11-30 03:09:53,913 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:09:53,913 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:53,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash 341658862, now seen corresponding path program 1 times [2023-11-30 03:09:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031098344] [2023-11-30 03:09:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:53,970 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:09:53,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:53,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031098344] [2023-11-30 03:09:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031098344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:53,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570467786] [2023-11-30 03:09:53,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:53,971 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:53,973 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 419 [2023-11-30 03:09:53,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 328 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:53,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:53,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 419 [2023-11-30 03:09:53,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:54,240 INFO L124 PetriNetUnfolderBase]: 483/1575 cut-off events. [2023-11-30 03:09:54,240 INFO L125 PetriNetUnfolderBase]: For 2806/3694 co-relation queries the response was YES. [2023-11-30 03:09:54,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5588 conditions, 1575 events. 483/1575 cut-off events. For 2806/3694 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9183 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 4938. Up to 647 conditions per place. [2023-11-30 03:09:54,257 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 19 selfloop transitions, 2 changer transitions 4/327 dead transitions. [2023-11-30 03:09:54,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 327 transitions, 960 flow [2023-11-30 03:09:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2023-11-30 03:09:54,259 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8313444709626094 [2023-11-30 03:09:54,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2023-11-30 03:09:54,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2023-11-30 03:09:54,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:54,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2023-11-30 03:09:54,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have 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:09:54,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:54,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:54,266 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -38 predicate places. [2023-11-30 03:09:54,266 INFO L500 AbstractCegarLoop]: Abstraction has has 343 places, 327 transitions, 960 flow [2023-11-30 03:09:54,267 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:54,267 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:54,267 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] [2023-11-30 03:09:54,267 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:09:54,268 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:54,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1740439938, now seen corresponding path program 1 times [2023-11-30 03:09:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:54,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370510560] [2023-11-30 03:09:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:54,321 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:09:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:54,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370510560] [2023-11-30 03:09:54,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370510560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:54,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:54,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:54,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780957015] [2023-11-30 03:09:54,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:54,325 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:54,326 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 419 [2023-11-30 03:09:54,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 327 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have 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:09:54,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:54,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 419 [2023-11-30 03:09:54,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:54,597 INFO L124 PetriNetUnfolderBase]: 483/1574 cut-off events. [2023-11-30 03:09:54,597 INFO L125 PetriNetUnfolderBase]: For 3765/4829 co-relation queries the response was YES. [2023-11-30 03:09:54,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6242 conditions, 1574 events. 483/1574 cut-off events. For 3765/4829 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9258 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 5532. Up to 653 conditions per place. [2023-11-30 03:09:54,618 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 34 selfloop transitions, 2 changer transitions 4/326 dead transitions. [2023-11-30 03:09:54,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 326 transitions, 1030 flow [2023-11-30 03:09:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1015 transitions. [2023-11-30 03:09:54,621 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.807478122513922 [2023-11-30 03:09:54,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1015 transitions. [2023-11-30 03:09:54,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1015 transitions. [2023-11-30 03:09:54,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:54,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1015 transitions. [2023-11-30 03:09:54,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:54,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:54,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:54,625 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -37 predicate places. [2023-11-30 03:09:54,625 INFO L500 AbstractCegarLoop]: Abstraction has has 344 places, 326 transitions, 1030 flow [2023-11-30 03:09:54,626 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have 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:09:54,626 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:54,626 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] [2023-11-30 03:09:54,626 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:09:54,626 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:54,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash -991291120, now seen corresponding path program 1 times [2023-11-30 03:09:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:54,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201809202] [2023-11-30 03:09:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:54,678 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:09:54,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201809202] [2023-11-30 03:09:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201809202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:54,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:54,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691119477] [2023-11-30 03:09:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:54,679 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:54,681 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 419 [2023-11-30 03:09:54,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 326 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have 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:09:54,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:54,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 419 [2023-11-30 03:09:54,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:54,939 INFO L124 PetriNetUnfolderBase]: 483/1573 cut-off events. [2023-11-30 03:09:54,939 INFO L125 PetriNetUnfolderBase]: For 4875/6115 co-relation queries the response was YES. [2023-11-30 03:09:54,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6886 conditions, 1573 events. 483/1573 cut-off events. For 4875/6115 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9271 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 6126. Up to 653 conditions per place. [2023-11-30 03:09:54,961 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 24 selfloop transitions, 2 changer transitions 4/325 dead transitions. [2023-11-30 03:09:54,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 325 transitions, 1080 flow [2023-11-30 03:09:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1032 transitions. [2023-11-30 03:09:54,964 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8210023866348448 [2023-11-30 03:09:54,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1032 transitions. [2023-11-30 03:09:54,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1032 transitions. [2023-11-30 03:09:54,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:54,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1032 transitions. [2023-11-30 03:09:54,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:09:54,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:54,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:54,969 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -36 predicate places. [2023-11-30 03:09:54,969 INFO L500 AbstractCegarLoop]: Abstraction has has 345 places, 325 transitions, 1080 flow [2023-11-30 03:09:54,969 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have 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:09:54,969 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:54,969 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] [2023-11-30 03:09:54,969 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:09:54,970 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:54,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1979298569, now seen corresponding path program 1 times [2023-11-30 03:09:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46453190] [2023-11-30 03:09:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:54,990 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:09:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46453190] [2023-11-30 03:09:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46453190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:54,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97925862] [2023-11-30 03:09:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:54,991 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:54,992 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 419 [2023-11-30 03:09:54,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 325 transitions, 1080 flow. Second operand has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have 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:09:54,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:54,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 419 [2023-11-30 03:09:54,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:55,267 INFO L124 PetriNetUnfolderBase]: 483/1572 cut-off events. [2023-11-30 03:09:55,267 INFO L125 PetriNetUnfolderBase]: For 6136/7552 co-relation queries the response was YES. [2023-11-30 03:09:55,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7534 conditions, 1572 events. 483/1572 cut-off events. For 6136/7552 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9227 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 6720. Up to 653 conditions per place. [2023-11-30 03:09:55,284 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 28 selfloop transitions, 2 changer transitions 4/324 dead transitions. [2023-11-30 03:09:55,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 324 transitions, 1138 flow [2023-11-30 03:09:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions. [2023-11-30 03:09:55,287 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.817024661893397 [2023-11-30 03:09:55,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1027 transitions. [2023-11-30 03:09:55,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1027 transitions. [2023-11-30 03:09:55,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:55,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1027 transitions. [2023-11-30 03:09:55,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:55,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:55,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:55,291 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -35 predicate places. [2023-11-30 03:09:55,291 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 324 transitions, 1138 flow [2023-11-30 03:09:55,292 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have 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:09:55,292 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:55,292 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] [2023-11-30 03:09:55,292 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:09:55,292 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:55,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:55,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1443427438, now seen corresponding path program 1 times [2023-11-30 03:09:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:55,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027956919] [2023-11-30 03:09:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:55,312 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:09:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027956919] [2023-11-30 03:09:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027956919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395927469] [2023-11-30 03:09:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:55,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:55,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:55,314 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2023-11-30 03:09:55,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 324 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have 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:09:55,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:55,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2023-11-30 03:09:55,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:55,516 INFO L124 PetriNetUnfolderBase]: 483/1569 cut-off events. [2023-11-30 03:09:55,517 INFO L125 PetriNetUnfolderBase]: For 7541/9133 co-relation queries the response was YES. [2023-11-30 03:09:55,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8171 conditions, 1569 events. 483/1569 cut-off events. For 7541/9133 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9211 event pairs, 262 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 7314. Up to 653 conditions per place. [2023-11-30 03:09:55,536 INFO L140 encePairwiseOnDemand]: 415/419 looper letters, 23 selfloop transitions, 1 changer transitions 4/321 dead transitions. [2023-11-30 03:09:55,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 321 transitions, 1174 flow [2023-11-30 03:09:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1035 transitions. [2023-11-30 03:09:55,538 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8233890214797136 [2023-11-30 03:09:55,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1035 transitions. [2023-11-30 03:09:55,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1035 transitions. [2023-11-30 03:09:55,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:55,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1035 transitions. [2023-11-30 03:09:55,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have 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:09:55,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:55,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:55,543 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -36 predicate places. [2023-11-30 03:09:55,543 INFO L500 AbstractCegarLoop]: Abstraction has has 345 places, 321 transitions, 1174 flow [2023-11-30 03:09:55,543 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have 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:09:55,543 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:55,543 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:09:55,543 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:09:55,544 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:55,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1192102224, now seen corresponding path program 1 times [2023-11-30 03:09:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227973310] [2023-11-30 03:09:55,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:55,878 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:09:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227973310] [2023-11-30 03:09:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227973310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:55,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:09:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239437665] [2023-11-30 03:09:55,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:55,879 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:09:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:09:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:09:55,880 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 419 [2023-11-30 03:09:55,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 321 transitions, 1174 flow. Second operand has 6 states, 6 states have (on average 306.8333333333333) internal successors, (1841), 6 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have 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:09:55,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:55,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 419 [2023-11-30 03:09:55,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:56,883 INFO L124 PetriNetUnfolderBase]: 3039/5235 cut-off events. [2023-11-30 03:09:56,883 INFO L125 PetriNetUnfolderBase]: For 138062/138567 co-relation queries the response was YES. [2023-11-30 03:09:56,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41337 conditions, 5235 events. 3039/5235 cut-off events. For 138062/138567 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 31032 event pairs, 1966 based on Foata normal form. 0/4848 useless extension candidates. Maximal degree in co-relation 40179. Up to 3924 conditions per place. [2023-11-30 03:09:57,092 INFO L140 encePairwiseOnDemand]: 413/419 looper letters, 53 selfloop transitions, 5 changer transitions 4/320 dead transitions. [2023-11-30 03:09:57,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 320 transitions, 1288 flow [2023-11-30 03:09:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:09:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:09:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1889 transitions. [2023-11-30 03:09:57,097 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7513922036595068 [2023-11-30 03:09:57,097 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1889 transitions. [2023-11-30 03:09:57,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1889 transitions. [2023-11-30 03:09:57,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:57,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1889 transitions. [2023-11-30 03:09:57,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 314.8333333333333) internal successors, (1889), 6 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have 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:09:57,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:09:57,104 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:09:57,104 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -32 predicate places. [2023-11-30 03:09:57,104 INFO L500 AbstractCegarLoop]: Abstraction has has 349 places, 320 transitions, 1288 flow [2023-11-30 03:09:57,105 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 306.8333333333333) internal successors, (1841), 6 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have 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:09:57,105 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:57,105 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:09:57,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:09:57,105 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:57,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -120419652, now seen corresponding path program 1 times [2023-11-30 03:09:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518227042] [2023-11-30 03:09:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:57,138 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:09:57,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518227042] [2023-11-30 03:09:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518227042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993567146] [2023-11-30 03:09:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:57,139 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:57,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:57,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:57,141 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 419 [2023-11-30 03:09:57,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 320 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:57,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:57,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 419 [2023-11-30 03:09:57,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:58,253 INFO L124 PetriNetUnfolderBase]: 3039/5234 cut-off events. [2023-11-30 03:09:58,253 INFO L125 PetriNetUnfolderBase]: For 165567/166122 co-relation queries the response was YES. [2023-11-30 03:09:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44533 conditions, 5234 events. 3039/5234 cut-off events. For 165567/166122 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 31061 event pairs, 1966 based on Foata normal form. 0/4848 useless extension candidates. Maximal degree in co-relation 43312. Up to 3924 conditions per place. [2023-11-30 03:09:58,405 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 19 selfloop transitions, 2 changer transitions 4/319 dead transitions. [2023-11-30 03:09:58,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 319 transitions, 1328 flow [2023-11-30 03:09:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2023-11-30 03:09:58,408 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8313444709626094 [2023-11-30 03:09:58,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2023-11-30 03:09:58,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2023-11-30 03:09:58,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:58,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2023-11-30 03:09:58,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have 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:09:58,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:58,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:09:58,412 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -31 predicate places. [2023-11-30 03:09:58,413 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 319 transitions, 1328 flow [2023-11-30 03:09:58,413 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:09:58,413 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:58,413 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:09:58,413 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:09:58,413 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:09:58,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash -438528813, now seen corresponding path program 1 times [2023-11-30 03:09:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:58,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699272747] [2023-11-30 03:09:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:58,438 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:09:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699272747] [2023-11-30 03:09:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699272747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:58,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338219326] [2023-11-30 03:09:58,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:58,439 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:58,440 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 419 [2023-11-30 03:09:58,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 319 transitions, 1328 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have 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:09:58,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:58,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 419 [2023-11-30 03:09:58,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:59,769 INFO L124 PetriNetUnfolderBase]: 4327/7271 cut-off events. [2023-11-30 03:09:59,769 INFO L125 PetriNetUnfolderBase]: For 291726/298009 co-relation queries the response was YES. [2023-11-30 03:09:59,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67849 conditions, 7271 events. 4327/7271 cut-off events. For 291726/298009 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 45558 event pairs, 1386 based on Foata normal form. 0/6666 useless extension candidates. Maximal degree in co-relation 65827. Up to 5625 conditions per place. [2023-11-30 03:10:00,026 INFO L140 encePairwiseOnDemand]: 410/419 looper letters, 40 selfloop transitions, 4 changer transitions 4/330 dead transitions. [2023-11-30 03:10:00,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 330 transitions, 1811 flow [2023-11-30 03:10:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:10:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:10:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2023-11-30 03:10:00,030 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8265712012728719 [2023-11-30 03:10:00,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2023-11-30 03:10:00,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2023-11-30 03:10:00,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:00,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2023-11-30 03:10:00,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:10:00,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:00,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:00,033 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -34 predicate places. [2023-11-30 03:10:00,034 INFO L500 AbstractCegarLoop]: Abstraction has has 347 places, 330 transitions, 1811 flow [2023-11-30 03:10:00,034 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have 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:10:00,034 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:10:00,034 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:10:00,034 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:10:00,034 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:10:00,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:10:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash -519344604, now seen corresponding path program 1 times [2023-11-30 03:10:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:10:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187946183] [2023-11-30 03:10:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:10:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:10:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:10:00,060 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:10:00,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:10:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187946183] [2023-11-30 03:10:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187946183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:10:00,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:10:00,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:10:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741522474] [2023-11-30 03:10:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:10:00,061 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:10:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:10:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:10:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:10:00,062 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 419 [2023-11-30 03:10:00,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 330 transitions, 1811 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have 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:10:00,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:10:00,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 419 [2023-11-30 03:10:00,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:10:02,107 INFO L124 PetriNetUnfolderBase]: 5780/10832 cut-off events. [2023-11-30 03:10:02,107 INFO L125 PetriNetUnfolderBase]: For 380265/388617 co-relation queries the response was YES. [2023-11-30 03:10:02,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97775 conditions, 10832 events. 5780/10832 cut-off events. For 380265/388617 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 82943 event pairs, 1485 based on Foata normal form. 6/9850 useless extension candidates. Maximal degree in co-relation 95010. Up to 7517 conditions per place. [2023-11-30 03:10:02,579 INFO L140 encePairwiseOnDemand]: 413/419 looper letters, 56 selfloop transitions, 5 changer transitions 16/355 dead transitions. [2023-11-30 03:10:02,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 355 transitions, 2691 flow [2023-11-30 03:10:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:10:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:10:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1054 transitions. [2023-11-30 03:10:02,581 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8385043754972156 [2023-11-30 03:10:02,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1054 transitions. [2023-11-30 03:10:02,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1054 transitions. [2023-11-30 03:10:02,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:02,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1054 transitions. [2023-11-30 03:10:02,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 351.3333333333333) internal successors, (1054), 3 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have 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:10:02,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:02,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:02,585 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -34 predicate places. [2023-11-30 03:10:02,585 INFO L500 AbstractCegarLoop]: Abstraction has has 347 places, 355 transitions, 2691 flow [2023-11-30 03:10:02,586 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have 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:10:02,586 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:10:02,586 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:02,586 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:10:02,586 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:10:02,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:10:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash -797247167, now seen corresponding path program 1 times [2023-11-30 03:10:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:10:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627155980] [2023-11-30 03:10:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:10:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:10:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:10:02,613 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:10:02,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:10:02,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627155980] [2023-11-30 03:10:02,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627155980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:10:02,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:10:02,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:10:02,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575556041] [2023-11-30 03:10:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:10:02,614 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:10:02,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:10:02,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:10:02,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:10:02,615 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2023-11-30 03:10:02,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 355 transitions, 2691 flow. Second operand has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have 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:10:02,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:10:02,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2023-11-30 03:10:02,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:10:04,906 INFO L124 PetriNetUnfolderBase]: 6581/12539 cut-off events. [2023-11-30 03:10:04,907 INFO L125 PetriNetUnfolderBase]: For 489070/498697 co-relation queries the response was YES. [2023-11-30 03:10:04,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118583 conditions, 12539 events. 6581/12539 cut-off events. For 489070/498697 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 99072 event pairs, 1564 based on Foata normal form. 5/11411 useless extension candidates. Maximal degree in co-relation 101131. Up to 8610 conditions per place. [2023-11-30 03:10:05,159 INFO L140 encePairwiseOnDemand]: 412/419 looper letters, 83 selfloop transitions, 6 changer transitions 20/378 dead transitions. [2023-11-30 03:10:05,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 378 transitions, 3654 flow [2023-11-30 03:10:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:10:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:10:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2023-11-30 03:10:05,162 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8353221957040573 [2023-11-30 03:10:05,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2023-11-30 03:10:05,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2023-11-30 03:10:05,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:05,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2023-11-30 03:10:05,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:10:05,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:05,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:05,166 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -35 predicate places. [2023-11-30 03:10:05,166 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 378 transitions, 3654 flow [2023-11-30 03:10:05,166 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have 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:10:05,166 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:10:05,166 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:10:05,167 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:10:05,167 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:10:05,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:10:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash 419639481, now seen corresponding path program 1 times [2023-11-30 03:10:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:10:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110809292] [2023-11-30 03:10:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:10:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:10:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:10:05,194 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:10:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:10:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110809292] [2023-11-30 03:10:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110809292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:10:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:10:05,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:10:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190392074] [2023-11-30 03:10:05,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:10:05,195 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:10:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:10:05,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:10:05,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:10:05,197 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 419 [2023-11-30 03:10:05,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 378 transitions, 3654 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have 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:10:05,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:10:05,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 419 [2023-11-30 03:10:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:10:07,834 INFO L124 PetriNetUnfolderBase]: 7199/13823 cut-off events. [2023-11-30 03:10:07,834 INFO L125 PetriNetUnfolderBase]: For 491611/496641 co-relation queries the response was YES. [2023-11-30 03:10:07,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137838 conditions, 13823 events. 7199/13823 cut-off events. For 491611/496641 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 109713 event pairs, 1627 based on Foata normal form. 0/12657 useless extension candidates. Maximal degree in co-relation 107191. Up to 9434 conditions per place. [2023-11-30 03:10:08,133 INFO L140 encePairwiseOnDemand]: 413/419 looper letters, 109 selfloop transitions, 7 changer transitions 36/416 dead transitions. [2023-11-30 03:10:08,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 416 transitions, 5223 flow [2023-11-30 03:10:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:10:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:10:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1056 transitions. [2023-11-30 03:10:08,135 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8400954653937948 [2023-11-30 03:10:08,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1056 transitions. [2023-11-30 03:10:08,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1056 transitions. [2023-11-30 03:10:08,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:08,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1056 transitions. [2023-11-30 03:10:08,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have 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:10:08,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:08,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:10:08,139 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -35 predicate places. [2023-11-30 03:10:08,139 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 416 transitions, 5223 flow [2023-11-30 03:10:08,139 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have 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:10:08,139 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:10:08,140 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:08,140 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:10:08,140 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:10:08,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:10:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash -274206458, now seen corresponding path program 1 times [2023-11-30 03:10:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:10:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155573189] [2023-11-30 03:10:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:10:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:10:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:10:08,573 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:10:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:10:08,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155573189] [2023-11-30 03:10:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155573189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:10:08,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:10:08,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:10:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492135993] [2023-11-30 03:10:08,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:10:08,574 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:10:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:10:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:10:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:10:08,576 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 419 [2023-11-30 03:10:08,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 416 transitions, 5223 flow. Second operand has 6 states, 6 states have (on average 313.1666666666667) internal successors, (1879), 6 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have 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:10:08,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:10:08,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 419 [2023-11-30 03:10:08,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:10:11,305 INFO L124 PetriNetUnfolderBase]: 7199/11607 cut-off events. [2023-11-30 03:10:11,306 INFO L125 PetriNetUnfolderBase]: For 721296/725001 co-relation queries the response was YES. [2023-11-30 03:10:11,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144885 conditions, 11607 events. 7199/11607 cut-off events. For 721296/725001 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 73118 event pairs, 161 based on Foata normal form. 0/11171 useless extension candidates. Maximal degree in co-relation 105908. Up to 9265 conditions per place. [2023-11-30 03:10:11,540 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 379 selfloop transitions, 4 changer transitions 36/655 dead transitions. [2023-11-30 03:10:11,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 655 transitions, 14165 flow [2023-11-30 03:10:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:10:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:10:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1947 transitions. [2023-11-30 03:10:11,546 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7744630071599046 [2023-11-30 03:10:11,546 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1947 transitions. [2023-11-30 03:10:11,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1947 transitions. [2023-11-30 03:10:11,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:11,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1947 transitions. [2023-11-30 03:10:11,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have 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:10:11,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:11,552 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:11,552 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -31 predicate places. [2023-11-30 03:10:11,552 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 655 transitions, 14165 flow [2023-11-30 03:10:11,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 313.1666666666667) internal successors, (1879), 6 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have 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:10:11,553 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:10:11,553 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:11,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:10:11,553 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:10:11,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:10:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash 868530242, now seen corresponding path program 1 times [2023-11-30 03:10:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:10:11,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187286286] [2023-11-30 03:10:11,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:10:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:10:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:10:12,133 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:10:12,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:10:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187286286] [2023-11-30 03:10:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187286286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:10:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:10:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:10:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885863544] [2023-11-30 03:10:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:10:12,134 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:10:12,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:10:12,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:10:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:10:12,136 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 419 [2023-11-30 03:10:12,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 655 transitions, 14165 flow. Second operand has 6 states, 6 states have (on average 314.1666666666667) internal successors, (1885), 6 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have 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:10:12,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:10:12,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 419 [2023-11-30 03:10:12,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:10:15,177 INFO L124 PetriNetUnfolderBase]: 7209/11565 cut-off events. [2023-11-30 03:10:15,178 INFO L125 PetriNetUnfolderBase]: For 736570/741485 co-relation queries the response was YES. [2023-11-30 03:10:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154136 conditions, 11565 events. 7209/11565 cut-off events. For 736570/741485 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 72163 event pairs, 171 based on Foata normal form. 0/11205 useless extension candidates. Maximal degree in co-relation 112382. Up to 9197 conditions per place. [2023-11-30 03:10:15,643 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 558 selfloop transitions, 4 changer transitions 36/834 dead transitions. [2023-11-30 03:10:15,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 834 transitions, 21783 flow [2023-11-30 03:10:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:10:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:10:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1938 transitions. [2023-11-30 03:10:15,646 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7708830548926014 [2023-11-30 03:10:15,646 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1938 transitions. [2023-11-30 03:10:15,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1938 transitions. [2023-11-30 03:10:15,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:15,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1938 transitions. [2023-11-30 03:10:15,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have 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:10:15,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:15,652 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:15,653 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -27 predicate places. [2023-11-30 03:10:15,653 INFO L500 AbstractCegarLoop]: Abstraction has has 354 places, 834 transitions, 21783 flow [2023-11-30 03:10:15,653 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.1666666666667) internal successors, (1885), 6 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have 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:10:15,653 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:10:15,654 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:15,654 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:10:15,654 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:10:15,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:10:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1177707791, now seen corresponding path program 1 times [2023-11-30 03:10:15,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:10:15,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742774013] [2023-11-30 03:10:15,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:10:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:10:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:10:16,063 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:10:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:10:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742774013] [2023-11-30 03:10:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742774013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:10:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:10:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:10:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616500279] [2023-11-30 03:10:16,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:10:16,065 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:10:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:10:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:10:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:10:16,066 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 419 [2023-11-30 03:10:16,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 834 transitions, 21783 flow. Second operand has 6 states, 6 states have (on average 315.1666666666667) internal successors, (1891), 6 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have 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:10:16,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:10:16,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 419 [2023-11-30 03:10:16,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:10:19,386 INFO L124 PetriNetUnfolderBase]: 7261/11598 cut-off events. [2023-11-30 03:10:19,386 INFO L125 PetriNetUnfolderBase]: For 751916/757709 co-relation queries the response was YES. [2023-11-30 03:10:19,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164257 conditions, 11598 events. 7261/11598 cut-off events. For 751916/757709 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 72121 event pairs, 192 based on Foata normal form. 0/11283 useless extension candidates. Maximal degree in co-relation 126344. Up to 9210 conditions per place. [2023-11-30 03:10:19,647 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 677 selfloop transitions, 4 changer transitions 36/953 dead transitions. [2023-11-30 03:10:19,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 953 transitions, 27717 flow [2023-11-30 03:10:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:10:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:10:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1929 transitions. [2023-11-30 03:10:19,650 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7673031026252983 [2023-11-30 03:10:19,650 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1929 transitions. [2023-11-30 03:10:19,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1929 transitions. [2023-11-30 03:10:19,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:19,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1929 transitions. [2023-11-30 03:10:19,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 321.5) internal successors, (1929), 6 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have 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:10:19,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:19,655 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:19,656 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -23 predicate places. [2023-11-30 03:10:19,656 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 953 transitions, 27717 flow [2023-11-30 03:10:19,656 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 315.1666666666667) internal successors, (1891), 6 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have 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:10:19,656 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:10:19,656 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,656 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:10:19,656 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2023-11-30 03:10:19,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:10:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1486252576, now seen corresponding path program 1 times [2023-11-30 03:10:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:10:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118814028] [2023-11-30 03:10:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:10:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:10:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:10:20,109 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:10:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:10:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118814028] [2023-11-30 03:10:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118814028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:10:20,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:10:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:10:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813536309] [2023-11-30 03:10:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:10:20,110 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:10:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:10:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:10:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:10:20,112 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 419 [2023-11-30 03:10:20,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 953 transitions, 27717 flow. Second operand has 6 states, 6 states have (on average 316.1666666666667) internal successors, (1897), 6 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have 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:10:20,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:10:20,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 419 [2023-11-30 03:10:20,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:10:23,677 INFO L124 PetriNetUnfolderBase]: 7456/11977 cut-off events. [2023-11-30 03:10:23,677 INFO L125 PetriNetUnfolderBase]: For 771722/779001 co-relation queries the response was YES. [2023-11-30 03:10:23,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177733 conditions, 11977 events. 7456/11977 cut-off events. For 771722/779001 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 75458 event pairs, 254 based on Foata normal form. 0/11665 useless extension candidates. Maximal degree in co-relation 136642. Up to 9387 conditions per place. [2023-11-30 03:10:23,747 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 0 selfloop transitions, 0 changer transitions 1012/1012 dead transitions. [2023-11-30 03:10:23,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1012 transitions, 31607 flow [2023-11-30 03:10:23,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:10:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:10:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1920 transitions. [2023-11-30 03:10:23,750 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7637231503579952 [2023-11-30 03:10:23,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1920 transitions. [2023-11-30 03:10:23,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1920 transitions. [2023-11-30 03:10:23,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:10:23,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1920 transitions. [2023-11-30 03:10:23,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 320.0) internal successors, (1920), 6 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have 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:10:23,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:23,755 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:10:23,756 INFO L307 CegarLoopForPetriNet]: 381 programPoint places, -19 predicate places. [2023-11-30 03:10:23,756 INFO L500 AbstractCegarLoop]: Abstraction has has 362 places, 1012 transitions, 31607 flow [2023-11-30 03:10:23,756 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.1666666666667) internal successors, (1897), 6 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have 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:10:23,764 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-parallel-sum-1.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:10:23,815 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (121 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (120 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (119 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (118 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (116 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (115 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (114 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (113 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (112 of 122 remaining) [2023-11-30 03:10:23,816 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (111 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (110 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (109 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (108 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (107 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (106 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (105 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (104 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (103 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (101 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (100 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (99 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (98 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (97 of 122 remaining) [2023-11-30 03:10:23,817 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (96 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (95 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (94 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (93 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (92 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (91 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (90 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (89 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (87 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (86 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (84 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (82 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 122 remaining) [2023-11-30 03:10:23,818 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (80 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (79 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (78 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (77 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (76 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (75 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (73 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (72 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (71 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (70 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (69 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (68 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (67 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (66 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (65 of 122 remaining) [2023-11-30 03:10:23,819 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (64 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (63 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (62 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (61 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (60 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (59 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (54 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (53 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (52 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (51 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (50 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (49 of 122 remaining) [2023-11-30 03:10:23,820 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (48 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (47 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (46 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (45 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (44 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (33 of 122 remaining) [2023-11-30 03:10:23,821 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (32 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (31 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (26 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 122 remaining) [2023-11-30 03:10:23,822 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (8 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (7 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (6 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (4 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (3 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (2 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (1 of 122 remaining) [2023-11-30 03:10:23,823 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 122 remaining) [2023-11-30 03:10:23,824 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 03:10:23,824 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:10:23,828 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:10:23,828 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:10:23,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:10:23 BasicIcfg [2023-11-30 03:10:23,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:10:23,832 INFO L158 Benchmark]: Toolchain (without parser) took 33343.93ms. Allocated memory was 369.1MB in the beginning and 14.0GB in the end (delta: 13.6GB). Free memory was 329.3MB in the beginning and 11.7GB in the end (delta: -11.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-11-30 03:10:23,833 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 369.1MB. Free memory is still 325.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:10:23,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.41ms. Allocated memory is still 369.1MB. Free memory was 328.9MB in the beginning and 315.1MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 03:10:23,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.86ms. Allocated memory is still 369.1MB. Free memory was 315.1MB in the beginning and 311.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:10:23,833 INFO L158 Benchmark]: Boogie Preprocessor took 59.89ms. Allocated memory is still 369.1MB. Free memory was 311.3MB in the beginning and 307.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:10:23,833 INFO L158 Benchmark]: RCFGBuilder took 1070.21ms. Allocated memory was 369.1MB in the beginning and 471.9MB in the end (delta: 102.8MB). Free memory was 307.6MB in the beginning and 363.7MB in the end (delta: -56.1MB). Peak memory consumption was 50.7MB. Max. memory is 16.0GB. [2023-11-30 03:10:23,833 INFO L158 Benchmark]: TraceAbstraction took 31995.49ms. Allocated memory was 471.9MB in the beginning and 14.0GB in the end (delta: 13.5GB). Free memory was 363.7MB in the beginning and 11.7GB in the end (delta: -11.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-11-30 03:10:23,834 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.10ms. Allocated memory is still 369.1MB. Free memory is still 325.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 178.41ms. Allocated memory is still 369.1MB. Free memory was 328.9MB in the beginning and 315.1MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.86ms. Allocated memory is still 369.1MB. Free memory was 315.1MB in the beginning and 311.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.89ms. Allocated memory is still 369.1MB. Free memory was 311.3MB in the beginning and 307.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1070.21ms. Allocated memory was 369.1MB in the beginning and 471.9MB in the end (delta: 102.8MB). Free memory was 307.6MB in the beginning and 363.7MB in the end (delta: -56.1MB). Peak memory consumption was 50.7MB. Max. memory is 16.0GB. * TraceAbstraction took 31995.49ms. Allocated memory was 471.9MB in the beginning and 14.0GB in the end (delta: 13.5GB). Free memory was 363.7MB in the beginning and 11.7GB in the end (delta: -11.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: 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 9 procedures, 488 locations, 122 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: 31.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1392 IncrementalHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 219 mSDtfsCounter, 1392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31607occurred in iteration=20, InterpolantAutomatonStates: 75, 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.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2300 NumberOfCodeBlocks, 2300 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2280 ConstructedInterpolants, 0 QuantifiedInterpolants, 2749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 74 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:10:23,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...