/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/test-easy10.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:29:15,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:29:16,058 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:29:16,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:29:16,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:29:16,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:29:16,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:29:16,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:29:16,085 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:29:16,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:29:16,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:29:16,086 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:29:16,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:29:16,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:29:16,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:29:16,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:29:16,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:29:16,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:29:16,088 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:29:16,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:29:16,106 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:29:16,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:29:16,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:29:16,107 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:29:16,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:29:16,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:29:16,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:29:16,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:29:16,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:29:16,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:29:16,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:29:16,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:29:16,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:29:16,109 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:29:16,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:29:16,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:29:16,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:29:16,397 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:29:16,397 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:29:16,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c [2023-11-30 03:29:17,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:29:17,471 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:29:17,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy10.wvr.c [2023-11-30 03:29:17,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f140a753/7c60d22c170e49d394e60b3dca917379/FLAG987a1da64 [2023-11-30 03:29:17,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f140a753/7c60d22c170e49d394e60b3dca917379 [2023-11-30 03:29:17,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:29:17,486 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:29:17,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:29:17,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:29:17,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:29:17,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d38250e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17, skipping insertion in model container [2023-11-30 03:29:17,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,505 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:29:17,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:29:17,682 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:29:17,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:29:17,717 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:29:17,717 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:29:17,722 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:29:17,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17 WrapperNode [2023-11-30 03:29:17,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:29:17,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:29:17,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:29:17,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:29:17,735 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:29:17" (1/1) ... [2023-11-30 03:29:17,742 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:29:17" (1/1) ... [2023-11-30 03:29:17,766 INFO L138 Inliner]: procedures = 23, calls = 85, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 401 [2023-11-30 03:29:17,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:29:17,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:29:17,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:29:17,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:29:17,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:29:17,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:29:17,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:29:17,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:29:17,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (1/1) ... [2023-11-30 03:29:17,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:29:17,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:29:17,847 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:29:17,855 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:29:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:29:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:29:17,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:29:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:29:17,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:29:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:29:17,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:29:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:29:17,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:29:17,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:29:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:29:17,874 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:29:17,955 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:29:17,956 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:29:18,310 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:29:18,516 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:29:18,516 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:29:18,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:29:18 BoogieIcfgContainer [2023-11-30 03:29:18,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:29:18,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:29:18,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:29:18,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:29:18,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:29:17" (1/3) ... [2023-11-30 03:29:18,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711c5ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:29:18, skipping insertion in model container [2023-11-30 03:29:18,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:17" (2/3) ... [2023-11-30 03:29:18,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711c5ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:29:18, skipping insertion in model container [2023-11-30 03:29:18,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:29:18" (3/3) ... [2023-11-30 03:29:18,523 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2023-11-30 03:29:18,535 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:29:18,535 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-11-30 03:29:18,536 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:29:18,608 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 03:29:18,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 266 transitions, 560 flow [2023-11-30 03:29:18,725 INFO L124 PetriNetUnfolderBase]: 4/262 cut-off events. [2023-11-30 03:29:18,725 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:29:18,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 262 events. 4/262 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 323 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 168. Up to 2 conditions per place. [2023-11-30 03:29:18,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 266 transitions, 560 flow [2023-11-30 03:29:18,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 234 transitions, 492 flow [2023-11-30 03:29:18,751 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:29:18,756 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;@a251408, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:29:18,756 INFO L363 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2023-11-30 03:29:18,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:29:18,759 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2023-11-30 03:29:18,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:29:18,760 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:18,760 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:29:18,760 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:18,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1826475670, now seen corresponding path program 1 times [2023-11-30 03:29:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753348695] [2023-11-30 03:29:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:18,931 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:29:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753348695] [2023-11-30 03:29:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753348695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:18,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095382768] [2023-11-30 03:29:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:18,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:18,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:18,965 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 266 [2023-11-30 03:29:18,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 234 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:18,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:18,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 266 [2023-11-30 03:29:18,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:20,647 INFO L124 PetriNetUnfolderBase]: 7777/12362 cut-off events. [2023-11-30 03:29:20,647 INFO L125 PetriNetUnfolderBase]: For 1600/1605 co-relation queries the response was YES. [2023-11-30 03:29:20,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24555 conditions, 12362 events. 7777/12362 cut-off events. For 1600/1605 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 85470 event pairs, 7776 based on Foata normal form. 1/12304 useless extension candidates. Maximal degree in co-relation 23988. Up to 10986 conditions per place. [2023-11-30 03:29:20,741 INFO L140 encePairwiseOnDemand]: 218/266 looper letters, 41 selfloop transitions, 2 changer transitions 1/188 dead transitions. [2023-11-30 03:29:20,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 188 transitions, 486 flow [2023-11-30 03:29:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-11-30 03:29:20,755 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7656641604010025 [2023-11-30 03:29:20,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-11-30 03:29:20,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-11-30 03:29:20,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:20,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-11-30 03:29:20,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have 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:29:20,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:20,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:20,774 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -43 predicate places. [2023-11-30 03:29:20,774 INFO L500 AbstractCegarLoop]: Abstraction has has 202 places, 188 transitions, 486 flow [2023-11-30 03:29:20,774 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:20,774 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:20,775 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:29:20,775 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:29:20,775 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:20,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:20,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1499574688, now seen corresponding path program 1 times [2023-11-30 03:29:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:20,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671814224] [2023-11-30 03:29:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:20,818 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:29:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671814224] [2023-11-30 03:29:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671814224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:20,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:20,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465407436] [2023-11-30 03:29:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:20,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:20,821 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 266 [2023-11-30 03:29:20,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 188 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:20,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:20,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 266 [2023-11-30 03:29:20,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:22,277 INFO L124 PetriNetUnfolderBase]: 7777/12361 cut-off events. [2023-11-30 03:29:22,277 INFO L125 PetriNetUnfolderBase]: For 1726/2321 co-relation queries the response was YES. [2023-11-30 03:29:22,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35542 conditions, 12361 events. 7777/12361 cut-off events. For 1726/2321 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 85620 event pairs, 7776 based on Foata normal form. 0/12303 useless extension candidates. Maximal degree in co-relation 34803. Up to 10986 conditions per place. [2023-11-30 03:29:22,454 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 41 selfloop transitions, 2 changer transitions 1/187 dead transitions. [2023-11-30 03:29:22,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 187 transitions, 570 flow [2023-11-30 03:29:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2023-11-30 03:29:22,456 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7092731829573935 [2023-11-30 03:29:22,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2023-11-30 03:29:22,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2023-11-30 03:29:22,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:22,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2023-11-30 03:29:22,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have 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:29:22,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:22,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:22,460 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -42 predicate places. [2023-11-30 03:29:22,460 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 187 transitions, 570 flow [2023-11-30 03:29:22,461 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:22,461 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:22,461 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:29:22,461 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:29:22,461 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:22,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 206410123, now seen corresponding path program 1 times [2023-11-30 03:29:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868931036] [2023-11-30 03:29:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:22,540 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:29:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868931036] [2023-11-30 03:29:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868931036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422336934] [2023-11-30 03:29:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:22,541 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:22,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:22,542 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 266 [2023-11-30 03:29:22,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 187 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:22,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:22,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 266 [2023-11-30 03:29:22,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:23,862 INFO L124 PetriNetUnfolderBase]: 7777/12360 cut-off events. [2023-11-30 03:29:23,862 INFO L125 PetriNetUnfolderBase]: For 1913/3098 co-relation queries the response was YES. [2023-11-30 03:29:23,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46529 conditions, 12360 events. 7777/12360 cut-off events. For 1913/3098 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 85537 event pairs, 7776 based on Foata normal form. 0/12303 useless extension candidates. Maximal degree in co-relation 45618. Up to 10986 conditions per place. [2023-11-30 03:29:23,951 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 41 selfloop transitions, 2 changer transitions 1/186 dead transitions. [2023-11-30 03:29:23,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 186 transitions, 654 flow [2023-11-30 03:29:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2023-11-30 03:29:23,953 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7092731829573935 [2023-11-30 03:29:23,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2023-11-30 03:29:23,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2023-11-30 03:29:23,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:23,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2023-11-30 03:29:24,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have 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:29:24,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:24,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:24,101 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -41 predicate places. [2023-11-30 03:29:24,101 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 186 transitions, 654 flow [2023-11-30 03:29:24,101 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:24,101 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:24,102 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:29:24,102 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:29:24,102 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:24,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -49077767, now seen corresponding path program 1 times [2023-11-30 03:29:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727935646] [2023-11-30 03:29:24,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:24,134 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:29:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:24,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727935646] [2023-11-30 03:29:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727935646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:24,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:24,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340529501] [2023-11-30 03:29:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:24,135 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:24,136 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 266 [2023-11-30 03:29:24,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 186 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:24,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:24,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 266 [2023-11-30 03:29:24,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:25,541 INFO L124 PetriNetUnfolderBase]: 7777/12359 cut-off events. [2023-11-30 03:29:25,541 INFO L125 PetriNetUnfolderBase]: For 2161/3936 co-relation queries the response was YES. [2023-11-30 03:29:25,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57515 conditions, 12359 events. 7777/12359 cut-off events. For 2161/3936 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 85517 event pairs, 7776 based on Foata normal form. 0/12303 useless extension candidates. Maximal degree in co-relation 56433. Up to 10986 conditions per place. [2023-11-30 03:29:25,647 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 40 selfloop transitions, 2 changer transitions 1/185 dead transitions. [2023-11-30 03:29:25,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 185 transitions, 736 flow [2023-11-30 03:29:25,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2023-11-30 03:29:25,649 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7080200501253133 [2023-11-30 03:29:25,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2023-11-30 03:29:25,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2023-11-30 03:29:25,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:25,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2023-11-30 03:29:25,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have 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:29:25,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:25,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:25,653 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -40 predicate places. [2023-11-30 03:29:25,653 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 185 transitions, 736 flow [2023-11-30 03:29:25,653 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have 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:29:25,653 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:25,653 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] [2023-11-30 03:29:25,654 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:29:25,654 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:25,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash 469142166, now seen corresponding path program 1 times [2023-11-30 03:29:25,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:25,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332355880] [2023-11-30 03:29:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:29:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332355880] [2023-11-30 03:29:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332355880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:25,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258899006] [2023-11-30 03:29:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:25,696 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:25,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:25,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:25,697 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 266 [2023-11-30 03:29:25,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 185 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:25,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:25,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 266 [2023-11-30 03:29:25,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:27,507 INFO L124 PetriNetUnfolderBase]: 8726/15685 cut-off events. [2023-11-30 03:29:27,507 INFO L125 PetriNetUnfolderBase]: For 9238/169277 co-relation queries the response was YES. [2023-11-30 03:29:27,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78667 conditions, 15685 events. 8726/15685 cut-off events. For 9238/169277 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 123198 event pairs, 5952 based on Foata normal form. 0/15362 useless extension candidates. Maximal degree in co-relation 67376. Up to 12326 conditions per place. [2023-11-30 03:29:27,654 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 60 selfloop transitions, 6 changer transitions 1/211 dead transitions. [2023-11-30 03:29:27,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 211 transitions, 1152 flow [2023-11-30 03:29:27,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2023-11-30 03:29:27,656 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2023-11-30 03:29:27,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 602 transitions. [2023-11-30 03:29:27,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 602 transitions. [2023-11-30 03:29:27,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:27,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 602 transitions. [2023-11-30 03:29:27,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:29:27,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:27,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:27,660 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -40 predicate places. [2023-11-30 03:29:27,660 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 211 transitions, 1152 flow [2023-11-30 03:29:27,661 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:27,661 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:27,661 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:29:27,661 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:29:27,661 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:27,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -125918499, now seen corresponding path program 1 times [2023-11-30 03:29:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:27,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549283797] [2023-11-30 03:29:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:27,684 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:29:27,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549283797] [2023-11-30 03:29:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549283797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:27,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:27,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:27,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415745614] [2023-11-30 03:29:27,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:27,685 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:27,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:27,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:27,686 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 266 [2023-11-30 03:29:27,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 211 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:27,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:27,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 266 [2023-11-30 03:29:27,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:29,850 INFO L124 PetriNetUnfolderBase]: 9643/18333 cut-off events. [2023-11-30 03:29:29,850 INFO L125 PetriNetUnfolderBase]: For 13642/213245 co-relation queries the response was YES. [2023-11-30 03:29:29,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101503 conditions, 18333 events. 9643/18333 cut-off events. For 13642/213245 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 153527 event pairs, 2498 based on Foata normal form. 0/17818 useless extension candidates. Maximal degree in co-relation 86311. Up to 13628 conditions per place. [2023-11-30 03:29:29,997 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 110 selfloop transitions, 10 changer transitions 1/263 dead transitions. [2023-11-30 03:29:29,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 263 transitions, 2050 flow [2023-11-30 03:29:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2023-11-30 03:29:29,998 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2023-11-30 03:29:29,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 602 transitions. [2023-11-30 03:29:29,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 602 transitions. [2023-11-30 03:29:29,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:29,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 602 transitions. [2023-11-30 03:29:30,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:29:30,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:30,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:30,002 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -40 predicate places. [2023-11-30 03:29:30,002 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 263 transitions, 2050 flow [2023-11-30 03:29:30,003 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:30,003 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:30,003 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:29:30,003 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:29:30,003 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:30,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2108808200, now seen corresponding path program 1 times [2023-11-30 03:29:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558652103] [2023-11-30 03:29:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:30,025 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:29:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558652103] [2023-11-30 03:29:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558652103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716233652] [2023-11-30 03:29:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:30,026 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:30,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:30,027 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 266 [2023-11-30 03:29:30,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 263 transitions, 2050 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:30,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:30,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 266 [2023-11-30 03:29:30,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:32,777 INFO L124 PetriNetUnfolderBase]: 11552/21433 cut-off events. [2023-11-30 03:29:32,777 INFO L125 PetriNetUnfolderBase]: For 19572/281815 co-relation queries the response was YES. [2023-11-30 03:29:32,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137110 conditions, 21433 events. 11552/21433 cut-off events. For 19572/281815 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 181142 event pairs, 2263 based on Foata normal form. 3/20892 useless extension candidates. Maximal degree in co-relation 108694. Up to 16290 conditions per place. [2023-11-30 03:29:32,980 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 191 selfloop transitions, 18 changer transitions 1/350 dead transitions. [2023-11-30 03:29:32,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 350 transitions, 3739 flow [2023-11-30 03:29:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2023-11-30 03:29:32,984 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7556390977443609 [2023-11-30 03:29:32,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 603 transitions. [2023-11-30 03:29:32,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 603 transitions. [2023-11-30 03:29:32,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:32,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 603 transitions. [2023-11-30 03:29:32,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have 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:29:32,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:32,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:32,987 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -40 predicate places. [2023-11-30 03:29:32,987 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 350 transitions, 3739 flow [2023-11-30 03:29:32,987 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:32,987 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:32,988 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] [2023-11-30 03:29:32,988 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:29:32,988 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:32,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 659911900, now seen corresponding path program 1 times [2023-11-30 03:29:32,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:32,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060938073] [2023-11-30 03:29:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:29:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060938073] [2023-11-30 03:29:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060938073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:33,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:33,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:33,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387390193] [2023-11-30 03:29:33,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:33,011 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:33,012 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 266 [2023-11-30 03:29:33,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 350 transitions, 3739 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:33,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:33,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 266 [2023-11-30 03:29:33,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:36,286 INFO L124 PetriNetUnfolderBase]: 14384/25398 cut-off events. [2023-11-30 03:29:36,286 INFO L125 PetriNetUnfolderBase]: For 47818/265187 co-relation queries the response was YES. [2023-11-30 03:29:36,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189803 conditions, 25398 events. 14384/25398 cut-off events. For 47818/265187 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 214913 event pairs, 1427 based on Foata normal form. 50/24683 useless extension candidates. Maximal degree in co-relation 152107. Up to 20246 conditions per place. [2023-11-30 03:29:36,700 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 334 selfloop transitions, 33 changer transitions 12/509 dead transitions. [2023-11-30 03:29:36,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 509 transitions, 7114 flow [2023-11-30 03:29:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2023-11-30 03:29:36,702 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7568922305764411 [2023-11-30 03:29:36,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 604 transitions. [2023-11-30 03:29:36,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions. [2023-11-30 03:29:36,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:36,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions. [2023-11-30 03:29:36,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have 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:29:36,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:36,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:29:36,706 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -40 predicate places. [2023-11-30 03:29:36,706 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 509 transitions, 7114 flow [2023-11-30 03:29:36,706 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:29:36,706 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:36,707 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] [2023-11-30 03:29:36,707 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:29:36,707 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:29:36,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash 781701659, now seen corresponding path program 1 times [2023-11-30 03:29:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:36,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12204612] [2023-11-30 03:29:36,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:37,286 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:29:37,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12204612] [2023-11-30 03:29:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12204612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:37,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:37,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:29:37,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327924702] [2023-11-30 03:29:37,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:37,288 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:29:37,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:37,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:29:37,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:29:37,289 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 266 [2023-11-30 03:29:37,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 509 transitions, 7114 flow. Second operand has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have 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:29:37,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:37,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 266 [2023-11-30 03:29:37,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:00,515 INFO L124 PetriNetUnfolderBase]: 113528/155468 cut-off events. [2023-11-30 03:30:00,515 INFO L125 PetriNetUnfolderBase]: For 3079846/3098978 co-relation queries the response was YES. [2023-11-30 03:30:01,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262262 conditions, 155468 events. 113528/155468 cut-off events. For 3079846/3098978 co-relation queries the response was YES. Maximal size of possible extension queue 4409. Compared 1064255 event pairs, 5497 based on Foata normal form. 7/154690 useless extension candidates. Maximal degree in co-relation 1075260. Up to 119390 conditions per place. [2023-11-30 03:30:02,995 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 1633 selfloop transitions, 4 changer transitions 13/1756 dead transitions. [2023-11-30 03:30:02,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1756 transitions, 32854 flow [2023-11-30 03:30:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1092 transitions. [2023-11-30 03:30:02,997 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2023-11-30 03:30:02,997 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1092 transitions. [2023-11-30 03:30:02,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1092 transitions. [2023-11-30 03:30:02,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:02,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1092 transitions. [2023-11-30 03:30:03,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have 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:30:03,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:30:03,008 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:30:03,008 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -36 predicate places. [2023-11-30 03:30:03,009 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 1756 transitions, 32854 flow [2023-11-30 03:30:03,009 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have 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:30:03,009 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:03,009 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] [2023-11-30 03:30:03,009 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:30:03,009 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:30:03,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1085871223, now seen corresponding path program 1 times [2023-11-30 03:30:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139062772] [2023-11-30 03:30:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:03,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:03,619 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:30:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139062772] [2023-11-30 03:30:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139062772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646403273] [2023-11-30 03:30:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:03,623 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:03,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:03,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:03,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:03,625 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 266 [2023-11-30 03:30:03,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 1756 transitions, 32854 flow. Second operand has 6 states, 6 states have (on average 160.16666666666666) internal successors, (961), 6 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have 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:30:03,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:03,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 266 [2023-11-30 03:30:03,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:41,890 INFO L124 PetriNetUnfolderBase]: 113540/154957 cut-off events. [2023-11-30 03:30:41,890 INFO L125 PetriNetUnfolderBase]: For 3105464/3173696 co-relation queries the response was YES. [2023-11-30 03:30:42,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406220 conditions, 154957 events. 113540/154957 cut-off events. For 3105464/3173696 co-relation queries the response was YES. Maximal size of possible extension queue 4409. Compared 1055570 event pairs, 5439 based on Foata normal form. 10/154707 useless extension candidates. Maximal degree in co-relation 1064245. Up to 132835 conditions per place. [2023-11-30 03:30:44,216 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 2228 selfloop transitions, 4 changer transitions 13/2351 dead transitions. [2023-11-30 03:30:44,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 2351 transitions, 49238 flow [2023-11-30 03:30:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1067 transitions. [2023-11-30 03:30:44,219 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.668546365914787 [2023-11-30 03:30:44,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1067 transitions. [2023-11-30 03:30:44,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1067 transitions. [2023-11-30 03:30:44,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:44,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1067 transitions. [2023-11-30 03:30:44,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have 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:30:44,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:30:44,223 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:30:44,223 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -32 predicate places. [2023-11-30 03:30:44,223 INFO L500 AbstractCegarLoop]: Abstraction has has 213 places, 2351 transitions, 49238 flow [2023-11-30 03:30:44,223 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 160.16666666666666) internal successors, (961), 6 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have 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:30:44,223 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:44,224 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] [2023-11-30 03:30:44,224 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:30:44,224 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:30:44,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1456160455, now seen corresponding path program 1 times [2023-11-30 03:30:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:44,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228761267] [2023-11-30 03:30:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:44,621 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:30:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228761267] [2023-11-30 03:30:44,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228761267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:44,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:44,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:44,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206549167] [2023-11-30 03:30:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:44,622 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:44,623 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 266 [2023-11-30 03:30:44,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 2351 transitions, 49238 flow. Second operand has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have 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:30:44,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:44,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 266 [2023-11-30 03:30:44,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:31:33,862 INFO L124 PetriNetUnfolderBase]: 113748/155346 cut-off events. [2023-11-30 03:31:33,863 INFO L125 PetriNetUnfolderBase]: For 3142946/3276354 co-relation queries the response was YES. [2023-11-30 03:31:34,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553234 conditions, 155346 events. 113748/155346 cut-off events. For 3142946/3276354 co-relation queries the response was YES. Maximal size of possible extension queue 4410. Compared 1057145 event pairs, 5553 based on Foata normal form. 15/155091 useless extension candidates. Maximal degree in co-relation 1174821. Up to 143657 conditions per place. [2023-11-30 03:31:36,527 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 2383 selfloop transitions, 4 changer transitions 13/2506 dead transitions. [2023-11-30 03:31:36,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 2506 transitions, 57442 flow [2023-11-30 03:31:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:31:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:31:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1042 transitions. [2023-11-30 03:31:36,552 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6528822055137845 [2023-11-30 03:31:36,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1042 transitions. [2023-11-30 03:31:36,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1042 transitions. [2023-11-30 03:31:36,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:31:36,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1042 transitions. [2023-11-30 03:31:36,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have 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:31:36,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:31:36,556 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:31:36,557 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -28 predicate places. [2023-11-30 03:31:36,557 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 2506 transitions, 57442 flow [2023-11-30 03:31:36,558 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have 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:31:36,558 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:31:36,558 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:31:36,558 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:31:36,558 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 104 more)] === [2023-11-30 03:31:36,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:31:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1752417125, now seen corresponding path program 1 times [2023-11-30 03:31:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:31:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950041727] [2023-11-30 03:31:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:31:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:31:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:31:37,163 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:31:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:31:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950041727] [2023-11-30 03:31:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950041727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:31:37,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:31:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:31:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704307959] [2023-11-30 03:31:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:31:37,164 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:31:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:31:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:31:37,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:31:37,165 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 266 [2023-11-30 03:31:37,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 2506 transitions, 57442 flow. Second operand has 6 states, 6 states have (on average 164.16666666666666) internal successors, (985), 6 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have 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:31:37,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:31:37,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 266 [2023-11-30 03:31:37,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:32:34,097 INFO L124 PetriNetUnfolderBase]: 115692/158199 cut-off events. [2023-11-30 03:32:34,112 INFO L125 PetriNetUnfolderBase]: For 3145323/3147969 co-relation queries the response was YES. [2023-11-30 03:32:34,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724619 conditions, 158199 events. 115692/158199 cut-off events. For 3145323/3147969 co-relation queries the response was YES. Maximal size of possible extension queue 4424. Compared 1078902 event pairs, 6295 based on Foata normal form. 9/157961 useless extension candidates. Maximal degree in co-relation 1299378. Up to 147089 conditions per place. [2023-11-30 03:32:35,152 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 0 selfloop transitions, 0 changer transitions 2537/2537 dead transitions. [2023-11-30 03:32:35,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 2537 transitions, 63042 flow [2023-11-30 03:32:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:32:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:32:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1017 transitions. [2023-11-30 03:32:35,154 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6372180451127819 [2023-11-30 03:32:35,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1017 transitions. [2023-11-30 03:32:35,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1017 transitions. [2023-11-30 03:32:35,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:32:35,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1017 transitions. [2023-11-30 03:32:35,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have 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:32:35,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:32:35,158 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have 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:32:35,158 INFO L307 CegarLoopForPetriNet]: 245 programPoint places, -24 predicate places. [2023-11-30 03:32:35,158 INFO L500 AbstractCegarLoop]: Abstraction has has 221 places, 2537 transitions, 63042 flow [2023-11-30 03:32:35,159 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.16666666666666) internal successors, (985), 6 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have 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:32:35,164 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/test-easy10.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:32:35,297 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (107 of 108 remaining) [2023-11-30 03:32:35,297 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (106 of 108 remaining) [2023-11-30 03:32:35,297 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (105 of 108 remaining) [2023-11-30 03:32:35,297 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (104 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (103 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (102 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (101 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (100 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (99 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (98 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (97 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (96 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (95 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (94 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (93 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (92 of 108 remaining) [2023-11-30 03:32:35,298 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (91 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (90 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (89 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (88 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (87 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (86 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (85 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (84 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (83 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (82 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (81 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (80 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (79 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (78 of 108 remaining) [2023-11-30 03:32:35,299 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (77 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (76 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (75 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (73 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (72 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (71 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (69 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (66 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 108 remaining) [2023-11-30 03:32:35,300 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (64 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (61 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (60 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (59 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (54 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (53 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (52 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (51 of 108 remaining) [2023-11-30 03:32:35,301 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (50 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (49 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (48 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (47 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (46 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (45 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (44 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 108 remaining) [2023-11-30 03:32:35,302 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (33 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (32 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (31 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (26 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 108 remaining) [2023-11-30 03:32:35,303 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 108 remaining) [2023-11-30 03:32:35,304 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (8 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (7 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (6 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (4 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (3 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (2 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (1 of 108 remaining) [2023-11-30 03:32:35,305 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 108 remaining) [2023-11-30 03:32:35,305 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:32:35,306 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:32:35,309 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:32:35,309 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:32:35,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:32:35 BasicIcfg [2023-11-30 03:32:35,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:32:35,334 INFO L158 Benchmark]: Toolchain (without parser) took 197846.46ms. Allocated memory was 543.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 496.5MB in the beginning and 11.3GB in the end (delta: -10.8GB). Peak memory consumption was 8.0GB. Max. memory is 16.0GB. [2023-11-30 03:32:35,334 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 360.7MB. Free memory is still 307.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:32:35,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.90ms. Allocated memory is still 543.2MB. Free memory was 496.1MB in the beginning and 483.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:32:35,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.30ms. Allocated memory is still 543.2MB. Free memory was 483.4MB in the beginning and 480.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:32:35,335 INFO L158 Benchmark]: Boogie Preprocessor took 58.38ms. Allocated memory is still 543.2MB. Free memory was 480.5MB in the beginning and 478.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:32:35,335 INFO L158 Benchmark]: RCFGBuilder took 691.39ms. Allocated memory is still 543.2MB. Free memory was 478.1MB in the beginning and 493.8MB in the end (delta: -15.8MB). Peak memory consumption was 55.6MB. Max. memory is 16.0GB. [2023-11-30 03:32:35,335 INFO L158 Benchmark]: TraceAbstraction took 196813.13ms. Allocated memory was 543.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 492.8MB in the beginning and 11.3GB in the end (delta: -10.8GB). Peak memory consumption was 8.0GB. Max. memory is 16.0GB. [2023-11-30 03:32:35,336 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 360.7MB. Free memory is still 307.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 235.90ms. Allocated memory is still 543.2MB. Free memory was 496.1MB in the beginning and 483.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.30ms. Allocated memory is still 543.2MB. Free memory was 483.4MB in the beginning and 480.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 58.38ms. Allocated memory is still 543.2MB. Free memory was 480.5MB in the beginning and 478.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 691.39ms. Allocated memory is still 543.2MB. Free memory was 478.1MB in the beginning and 493.8MB in the end (delta: -15.8MB). Peak memory consumption was 55.6MB. Max. memory is 16.0GB. * TraceAbstraction took 196813.13ms. Allocated memory was 543.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 492.8MB in the beginning and 11.3GB in the end (delta: -10.8GB). Peak memory consumption was 8.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: 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: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: 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: 112]: 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: 115]: 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: 121]: 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: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: 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, 351 locations, 108 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: 196.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 193.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 397 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1683 IncrementalHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 105 mSDtfsCounter, 1683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63042occurred in iteration=12, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 1200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 60 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:32:35,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...