/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/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:24:01,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:24:02,041 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:24:02,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:24:02,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:24:02,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:24:02,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:24:02,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:24:02,069 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:24:02,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:24:02,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:24:02,070 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:24:02,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:24:02,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:24:02,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:24:02,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:24:02,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:24:02,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:24:02,072 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:24:02,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:24:02,072 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:24:02,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:24:02,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:24:02,073 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:24:02,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:24:02,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:24:02,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:24:02,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:24:02,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:24:02,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:24:02,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:24:02,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:24:02,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:24:02,075 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:24:02,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:24:02,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:24:02,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:24:02,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:24:02,255 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:24:02,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2023-11-30 03:24:03,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:24:03,359 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:24:03,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2023-11-30 03:24:03,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4a70b600/6b88b7df6f9b4246bdd53f5712784a02/FLAGea017cd15 [2023-11-30 03:24:03,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4a70b600/6b88b7df6f9b4246bdd53f5712784a02 [2023-11-30 03:24:03,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:24:03,382 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:24:03,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:24:03,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:24:03,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:24:03,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3684a077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03, skipping insertion in model container [2023-11-30 03:24:03,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,407 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:24:03,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:24:03,540 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:24:03,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:24:03,584 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:24:03,585 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:24:03,591 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:24:03,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03 WrapperNode [2023-11-30 03:24:03,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:24:03,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:24:03,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:24:03,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:24:03,598 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:24:03" (1/1) ... [2023-11-30 03:24:03,606 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:24:03" (1/1) ... [2023-11-30 03:24:03,637 INFO L138 Inliner]: procedures = 22, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-30 03:24:03,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:24:03,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:24:03,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:24:03,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:24:03,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:24:03,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:24:03,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:24:03,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:24:03,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (1/1) ... [2023-11-30 03:24:03,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:24:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:24:03,701 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:24:03,722 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:24:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:24:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:24:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:24:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:24:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:24:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:24:03,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:24:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:24:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:24:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:24:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:24:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:24:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:24:03,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:24:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:24:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:24:03,730 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:24:03,801 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:24:03,802 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:24:04,011 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:24:04,158 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:24:04,159 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 03:24:04,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:24:04 BoogieIcfgContainer [2023-11-30 03:24:04,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:24:04,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:24:04,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:24:04,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:24:04,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:24:03" (1/3) ... [2023-11-30 03:24:04,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea95bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:24:04, skipping insertion in model container [2023-11-30 03:24:04,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:24:03" (2/3) ... [2023-11-30 03:24:04,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea95bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:24:04, skipping insertion in model container [2023-11-30 03:24:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:24:04" (3/3) ... [2023-11-30 03:24:04,174 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2023-11-30 03:24:04,187 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:24:04,188 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-30 03:24:04,188 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:24:04,257 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 03:24:04,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 167 transitions, 355 flow [2023-11-30 03:24:04,383 INFO L124 PetriNetUnfolderBase]: 7/164 cut-off events. [2023-11-30 03:24:04,384 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 03:24:04,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 164 events. 7/164 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 179 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-11-30 03:24:04,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 167 transitions, 355 flow [2023-11-30 03:24:04,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 141 transitions, 300 flow [2023-11-30 03:24:04,402 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:24:04,406 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;@27cee66a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:24:04,406 INFO L363 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-11-30 03:24:04,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:24:04,409 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2023-11-30 03:24:04,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:24:04,410 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:04,410 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] [2023-11-30 03:24:04,411 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:04,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -66629710, now seen corresponding path program 1 times [2023-11-30 03:24:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22909668] [2023-11-30 03:24:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:04,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:04,546 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:24:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22909668] [2023-11-30 03:24:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22909668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:04,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:24:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253788388] [2023-11-30 03:24:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:04,559 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:24:04,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:04,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:24:04,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:24:04,584 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 167 [2023-11-30 03:24:04,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have 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:24:04,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:04,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 167 [2023-11-30 03:24:04,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:04,712 INFO L124 PetriNetUnfolderBase]: 145/437 cut-off events. [2023-11-30 03:24:04,713 INFO L125 PetriNetUnfolderBase]: For 99/163 co-relation queries the response was YES. [2023-11-30 03:24:04,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 437 events. 145/437 cut-off events. For 99/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1830 event pairs, 90 based on Foata normal form. 42/409 useless extension candidates. Maximal degree in co-relation 578. Up to 229 conditions per place. [2023-11-30 03:24:04,720 INFO L140 encePairwiseOnDemand]: 139/167 looper letters, 22 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2023-11-30 03:24:04,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 115 transitions, 296 flow [2023-11-30 03:24:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:24:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:24:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-30 03:24:04,735 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.782435129740519 [2023-11-30 03:24:04,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-30 03:24:04,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-30 03:24:04,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:04,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-30 03:24:04,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have 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:24:04,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:04,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:04,749 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -21 predicate places. [2023-11-30 03:24:04,749 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 296 flow [2023-11-30 03:24:04,750 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have 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:24:04,750 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:04,750 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:24:04,750 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:24:04,751 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:04,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash 146210054, now seen corresponding path program 1 times [2023-11-30 03:24:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:04,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322577926] [2023-11-30 03:24:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:04,798 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:24:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322577926] [2023-11-30 03:24:04,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322577926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:04,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:04,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:24:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968434139] [2023-11-30 03:24:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:04,800 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:24:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:24:04,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:24:04,801 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 167 [2023-11-30 03:24:04,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have 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:24:04,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:04,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 167 [2023-11-30 03:24:04,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:04,887 INFO L124 PetriNetUnfolderBase]: 145/436 cut-off events. [2023-11-30 03:24:04,887 INFO L125 PetriNetUnfolderBase]: For 309/1006 co-relation queries the response was YES. [2023-11-30 03:24:04,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 436 events. 145/436 cut-off events. For 309/1006 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1825 event pairs, 90 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 735. Up to 229 conditions per place. [2023-11-30 03:24:04,890 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 16 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-11-30 03:24:04,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 114 transitions, 330 flow [2023-11-30 03:24:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:24:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:24:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-30 03:24:04,893 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7564870259481038 [2023-11-30 03:24:04,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-30 03:24:04,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-30 03:24:04,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:04,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-30 03:24:04,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:24:04,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:04,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:04,896 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -20 predicate places. [2023-11-30 03:24:04,896 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 330 flow [2023-11-30 03:24:04,896 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have 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:24:04,896 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:04,896 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] [2023-11-30 03:24:04,896 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:24:04,897 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:04,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1407439090, now seen corresponding path program 1 times [2023-11-30 03:24:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101152299] [2023-11-30 03:24:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:04,961 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:24:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101152299] [2023-11-30 03:24:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101152299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:24:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920166148] [2023-11-30 03:24:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:04,962 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:24:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:24:04,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:24:04,964 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 167 [2023-11-30 03:24:04,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have 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:24:04,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:04,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 167 [2023-11-30 03:24:04,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:05,026 INFO L124 PetriNetUnfolderBase]: 122/400 cut-off events. [2023-11-30 03:24:05,026 INFO L125 PetriNetUnfolderBase]: For 469/1850 co-relation queries the response was YES. [2023-11-30 03:24:05,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 400 events. 122/400 cut-off events. For 469/1850 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1612 event pairs, 56 based on Foata normal form. 1/351 useless extension candidates. Maximal degree in co-relation 815. Up to 193 conditions per place. [2023-11-30 03:24:05,029 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 25 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2023-11-30 03:24:05,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 436 flow [2023-11-30 03:24:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:24:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:24:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-11-30 03:24:05,031 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7664670658682635 [2023-11-30 03:24:05,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-11-30 03:24:05,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-11-30 03:24:05,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:05,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-11-30 03:24:05,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:24:05,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:05,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:05,034 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -20 predicate places. [2023-11-30 03:24:05,034 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 436 flow [2023-11-30 03:24:05,034 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have 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:24:05,034 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:05,034 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:24:05,034 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:24:05,035 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:05,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -701337699, now seen corresponding path program 1 times [2023-11-30 03:24:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:05,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300953121] [2023-11-30 03:24:05,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:05,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:05,070 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:24:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:05,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300953121] [2023-11-30 03:24:05,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300953121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:05,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:05,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:24:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499614459] [2023-11-30 03:24:05,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:05,072 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:24:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:05,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:24:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:24:05,077 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 167 [2023-11-30 03:24:05,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 121 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have 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:24:05,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:05,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 167 [2023-11-30 03:24:05,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:05,145 INFO L124 PetriNetUnfolderBase]: 122/431 cut-off events. [2023-11-30 03:24:05,145 INFO L125 PetriNetUnfolderBase]: For 824/2642 co-relation queries the response was YES. [2023-11-30 03:24:05,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 431 events. 122/431 cut-off events. For 824/2642 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1761 event pairs, 56 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 974. Up to 193 conditions per place. [2023-11-30 03:24:05,148 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 24 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2023-11-30 03:24:05,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 486 flow [2023-11-30 03:24:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:24:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:24:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-30 03:24:05,150 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7564870259481038 [2023-11-30 03:24:05,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-30 03:24:05,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-30 03:24:05,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:05,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-30 03:24:05,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:24:05,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:05,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:05,154 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -19 predicate places. [2023-11-30 03:24:05,154 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 486 flow [2023-11-30 03:24:05,155 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have 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:24:05,155 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:05,155 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] [2023-11-30 03:24:05,155 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:24:05,155 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:05,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1965661171, now seen corresponding path program 1 times [2023-11-30 03:24:05,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:05,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091024152] [2023-11-30 03:24:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:05,572 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:24:05,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:05,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091024152] [2023-11-30 03:24:05,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091024152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:05,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:05,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:24:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537513258] [2023-11-30 03:24:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:05,573 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:24:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:24:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:24:05,574 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 167 [2023-11-30 03:24:05,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have 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:24:05,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:05,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 167 [2023-11-30 03:24:05,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:05,836 INFO L124 PetriNetUnfolderBase]: 996/1622 cut-off events. [2023-11-30 03:24:05,836 INFO L125 PetriNetUnfolderBase]: For 10151/11237 co-relation queries the response was YES. [2023-11-30 03:24:05,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7198 conditions, 1622 events. 996/1622 cut-off events. For 10151/11237 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7786 event pairs, 131 based on Foata normal form. 0/1333 useless extension candidates. Maximal degree in co-relation 6921. Up to 1099 conditions per place. [2023-11-30 03:24:05,850 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 90 selfloop transitions, 4 changer transitions 0/171 dead transitions. [2023-11-30 03:24:05,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 171 transitions, 1192 flow [2023-11-30 03:24:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:24:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:24:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 675 transitions. [2023-11-30 03:24:05,852 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6736526946107785 [2023-11-30 03:24:05,853 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 675 transitions. [2023-11-30 03:24:05,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 675 transitions. [2023-11-30 03:24:05,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:05,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 675 transitions. [2023-11-30 03:24:05,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have 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:24:05,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:24:05,856 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:24:05,857 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -15 predicate places. [2023-11-30 03:24:05,857 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 171 transitions, 1192 flow [2023-11-30 03:24:05,857 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have 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:24:05,857 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:05,857 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] [2023-11-30 03:24:05,858 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:24:05,858 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:05,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1860275725, now seen corresponding path program 1 times [2023-11-30 03:24:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740791036] [2023-11-30 03:24:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:06,120 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:24:06,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740791036] [2023-11-30 03:24:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740791036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:06,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:06,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:24:06,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236565148] [2023-11-30 03:24:06,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:06,124 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:24:06,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:06,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:24:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:24:06,125 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 167 [2023-11-30 03:24:06,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 171 transitions, 1192 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have 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:24:06,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:06,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 167 [2023-11-30 03:24:06,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:06,375 INFO L124 PetriNetUnfolderBase]: 1078/1716 cut-off events. [2023-11-30 03:24:06,375 INFO L125 PetriNetUnfolderBase]: For 12308/13737 co-relation queries the response was YES. [2023-11-30 03:24:06,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 1716 events. 1078/1716 cut-off events. For 12308/13737 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7962 event pairs, 159 based on Foata normal form. 0/1382 useless extension candidates. Maximal degree in co-relation 7258. Up to 1184 conditions per place. [2023-11-30 03:24:06,409 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 117 selfloop transitions, 4 changer transitions 0/198 dead transitions. [2023-11-30 03:24:06,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 198 transitions, 1766 flow [2023-11-30 03:24:06,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:24:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:24:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2023-11-30 03:24:06,430 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6606786427145709 [2023-11-30 03:24:06,430 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 662 transitions. [2023-11-30 03:24:06,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions. [2023-11-30 03:24:06,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:06,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions. [2023-11-30 03:24:06,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:24:06,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:24:06,449 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:24:06,449 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -11 predicate places. [2023-11-30 03:24:06,450 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 198 transitions, 1766 flow [2023-11-30 03:24:06,450 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have 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:24:06,450 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:06,450 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] [2023-11-30 03:24:06,450 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:24:06,450 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:06,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash 631691857, now seen corresponding path program 1 times [2023-11-30 03:24:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819630755] [2023-11-30 03:24:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:06,987 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:24:06,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:06,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819630755] [2023-11-30 03:24:06,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819630755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:06,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:06,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:24:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771877738] [2023-11-30 03:24:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:06,991 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:24:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:24:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:24:06,993 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 167 [2023-11-30 03:24:06,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 198 transitions, 1766 flow. Second operand has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have 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:24:06,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:06,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 167 [2023-11-30 03:24:06,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:07,476 INFO L124 PetriNetUnfolderBase]: 1133/1751 cut-off events. [2023-11-30 03:24:07,476 INFO L125 PetriNetUnfolderBase]: For 15365/16936 co-relation queries the response was YES. [2023-11-30 03:24:07,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10894 conditions, 1751 events. 1133/1751 cut-off events. For 15365/16936 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7874 event pairs, 237 based on Foata normal form. 0/1338 useless extension candidates. Maximal degree in co-relation 8864. Up to 1397 conditions per place. [2023-11-30 03:24:07,529 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 120 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2023-11-30 03:24:07,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 201 transitions, 2064 flow [2023-11-30 03:24:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:24:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:24:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-11-30 03:24:07,531 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6477045908183633 [2023-11-30 03:24:07,531 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-11-30 03:24:07,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-11-30 03:24:07,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:07,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-11-30 03:24:07,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have 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:24:07,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:24:07,534 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:24:07,535 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -7 predicate places. [2023-11-30 03:24:07,535 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 201 transitions, 2064 flow [2023-11-30 03:24:07,535 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have 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:24:07,535 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:07,544 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] [2023-11-30 03:24:07,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:24:07,544 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:07,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1285989200, now seen corresponding path program 1 times [2023-11-30 03:24:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:07,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892593844] [2023-11-30 03:24:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:07,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:07,612 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:24:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:07,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892593844] [2023-11-30 03:24:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892593844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:24:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178874828] [2023-11-30 03:24:07,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:07,614 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:24:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:07,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:24:07,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:24:07,615 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 167 [2023-11-30 03:24:07,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 201 transitions, 2064 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:24:07,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:07,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 167 [2023-11-30 03:24:07,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:07,958 INFO L124 PetriNetUnfolderBase]: 1166/1789 cut-off events. [2023-11-30 03:24:07,958 INFO L125 PetriNetUnfolderBase]: For 23177/24842 co-relation queries the response was YES. [2023-11-30 03:24:07,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12334 conditions, 1789 events. 1166/1789 cut-off events. For 23177/24842 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7920 event pairs, 237 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 10104. Up to 1422 conditions per place. [2023-11-30 03:24:07,980 INFO L140 encePairwiseOnDemand]: 165/167 looper letters, 106 selfloop transitions, 1 changer transitions 0/200 dead transitions. [2023-11-30 03:24:07,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 200 transitions, 2276 flow [2023-11-30 03:24:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:24:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:24:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-30 03:24:07,981 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7744510978043913 [2023-11-30 03:24:07,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-30 03:24:07,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-30 03:24:07,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:07,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-30 03:24:07,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have 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:24:07,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:07,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:07,987 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -6 predicate places. [2023-11-30 03:24:07,987 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 200 transitions, 2276 flow [2023-11-30 03:24:07,988 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:24:07,988 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:24:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:07,988 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:24:07,989 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2023-11-30 03:24:07,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:24:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash -789620188, now seen corresponding path program 1 times [2023-11-30 03:24:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:24:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377953071] [2023-11-30 03:24:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:24:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:24:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:24:08,041 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:24:08,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:24:08,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377953071] [2023-11-30 03:24:08,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377953071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:24:08,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:24:08,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:24:08,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359354630] [2023-11-30 03:24:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:24:08,042 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:24:08,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:24:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:24:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:24:08,042 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 167 [2023-11-30 03:24:08,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 200 transitions, 2276 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:24:08,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:24:08,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 167 [2023-11-30 03:24:08,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:24:08,406 INFO L124 PetriNetUnfolderBase]: 1166/1788 cut-off events. [2023-11-30 03:24:08,406 INFO L125 PetriNetUnfolderBase]: For 31478/33143 co-relation queries the response was YES. [2023-11-30 03:24:08,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13539 conditions, 1788 events. 1166/1788 cut-off events. For 31478/33143 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7922 event pairs, 237 based on Foata normal form. 1/1370 useless extension candidates. Maximal degree in co-relation 11110. Up to 1422 conditions per place. [2023-11-30 03:24:08,415 INFO L140 encePairwiseOnDemand]: 165/167 looper letters, 0 selfloop transitions, 0 changer transitions 199/199 dead transitions. [2023-11-30 03:24:08,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 199 transitions, 2486 flow [2023-11-30 03:24:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:24:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:24:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-30 03:24:08,416 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7724550898203593 [2023-11-30 03:24:08,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-30 03:24:08,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-30 03:24:08,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:24:08,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-30 03:24:08,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have 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:24:08,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:08,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:24:08,418 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -5 predicate places. [2023-11-30 03:24:08,418 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 199 transitions, 2486 flow [2023-11-30 03:24:08,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:24:08,423 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-mult-equiv.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:24:08,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2023-11-30 03:24:08,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2023-11-30 03:24:08,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 58 remaining) [2023-11-30 03:24:08,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2023-11-30 03:24:08,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2023-11-30 03:24:08,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2023-11-30 03:24:08,445 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:24:08,446 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:24:08,449 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:24:08,449 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:24:08,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:24:08 BasicIcfg [2023-11-30 03:24:08,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:24:08,454 INFO L158 Benchmark]: Toolchain (without parser) took 5072.23ms. Allocated memory was 585.1MB in the beginning and 767.6MB in the end (delta: 182.5MB). Free memory was 545.6MB in the beginning and 344.3MB in the end (delta: 201.2MB). Peak memory consumption was 384.6MB. Max. memory is 16.0GB. [2023-11-30 03:24:08,454 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 326.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:24:08,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.07ms. Allocated memory is still 585.1MB. Free memory was 545.6MB in the beginning and 533.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:24:08,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.18ms. Allocated memory is still 585.1MB. Free memory was 533.4MB in the beginning and 531.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:24:08,455 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 585.1MB. Free memory was 531.8MB in the beginning and 530.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:24:08,455 INFO L158 Benchmark]: RCFGBuilder took 485.17ms. Allocated memory is still 585.1MB. Free memory was 530.0MB in the beginning and 494.1MB in the end (delta: 35.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-11-30 03:24:08,455 INFO L158 Benchmark]: TraceAbstraction took 4292.19ms. Allocated memory was 585.1MB in the beginning and 767.6MB in the end (delta: 182.5MB). Free memory was 493.1MB in the beginning and 344.3MB in the end (delta: 148.8MB). Peak memory consumption was 332.2MB. Max. memory is 16.0GB. [2023-11-30 03:24:08,456 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 326.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 209.07ms. Allocated memory is still 585.1MB. Free memory was 545.6MB in the beginning and 533.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.18ms. Allocated memory is still 585.1MB. Free memory was 533.4MB in the beginning and 531.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 585.1MB. Free memory was 531.8MB in the beginning and 530.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 485.17ms. Allocated memory is still 585.1MB. Free memory was 530.0MB in the beginning and 494.1MB in the end (delta: 35.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 4292.19ms. Allocated memory was 585.1MB in the beginning and 767.6MB in the end (delta: 182.5MB). Free memory was 493.1MB in the beginning and 344.3MB in the end (delta: 148.8MB). Peak memory consumption was 332.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 211 locations, 58 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: 4.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 568 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 54 mSDtfsCounter, 568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2486occurred in iteration=9, InterpolantAutomatonStates: 36, 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, 1.3s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:24:08,468 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...