/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:03:48,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:03:49,022 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:03:49,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:03:49,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:03:49,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:03:49,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:03:49,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:03:49,048 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:03:49,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:03:49,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:03:49,048 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:03:49,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:03:49,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:03:49,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:03:49,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:03:49,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:03:49,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:03:49,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:03:49,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:03:49,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:03:49,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:03:49,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:03:49,054 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:03:49,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:03:49,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:03:49,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:03:49,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:03:49,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:03:49,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:03:49,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:03:49,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:03:49,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:03:49,058 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:03:49,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:03:49,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:03:49,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:03:49,253 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:03:49,254 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:03:49,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2023-11-30 03:03:50,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:03:50,496 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:03:50,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2023-11-30 03:03:50,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14360f4ab/39636f40d7b740d2bb568b425fe02dec/FLAG7168f7327 [2023-11-30 03:03:50,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14360f4ab/39636f40d7b740d2bb568b425fe02dec [2023-11-30 03:03:50,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:03:50,511 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:03:50,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:03:50,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:03:50,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:03:50,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372a4322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50, skipping insertion in model container [2023-11-30 03:03:50,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,532 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:03:50,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:03:50,667 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:03:50,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:03:50,692 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:03:50,692 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:03:50,697 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:03:50,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50 WrapperNode [2023-11-30 03:03:50,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:03:50,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:03:50,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:03:50,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:03:50,703 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:03:50" (1/1) ... [2023-11-30 03:03:50,709 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:03:50" (1/1) ... [2023-11-30 03:03:50,726 INFO L138 Inliner]: procedures = 21, calls = 49, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 203 [2023-11-30 03:03:50,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:03:50,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:03:50,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:03:50,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:03:50,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:03:50,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:03:50,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:03:50,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:03:50,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (1/1) ... [2023-11-30 03:03:50,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:03:50,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:03:50,797 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:03:50,860 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:03:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:03:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:03:50,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:03:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:03:50,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:03:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:03:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:03:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:03:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:03:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:03:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:03:50,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:03:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:03:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:03:50,872 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:03:50,937 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:03:50,939 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:03:51,322 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:03:51,424 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:03:51,424 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:03:51,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:03:51 BoogieIcfgContainer [2023-11-30 03:03:51,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:03:51,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:03:51,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:03:51,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:03:51,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:03:50" (1/3) ... [2023-11-30 03:03:51,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3ea5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:03:51, skipping insertion in model container [2023-11-30 03:03:51,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:50" (2/3) ... [2023-11-30 03:03:51,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3ea5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:03:51, skipping insertion in model container [2023-11-30 03:03:51,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:03:51" (3/3) ... [2023-11-30 03:03:51,431 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bluetooth.wvr.c [2023-11-30 03:03:51,443 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:03:51,443 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-30 03:03:51,443 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:03:51,483 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:03:51,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 228 transitions, 470 flow [2023-11-30 03:03:51,557 INFO L124 PetriNetUnfolderBase]: 9/226 cut-off events. [2023-11-30 03:03:51,557 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:03:51,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 226 events. 9/226 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 155 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 163. Up to 2 conditions per place. [2023-11-30 03:03:51,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 228 transitions, 470 flow [2023-11-30 03:03:51,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 205 transitions, 422 flow [2023-11-30 03:03:51,571 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:03:51,576 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;@10c3b5dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:03:51,576 INFO L363 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2023-11-30 03:03:51,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:03:51,580 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-30 03:03:51,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:03:51,580 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:51,581 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:51,581 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:51,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1118167368, now seen corresponding path program 1 times [2023-11-30 03:03:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279415020] [2023-11-30 03:03:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:51,753 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:03:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:51,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279415020] [2023-11-30 03:03:51,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279415020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:51,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:51,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766785358] [2023-11-30 03:03:51,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:51,762 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:51,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:51,788 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 228 [2023-11-30 03:03:51,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:51,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:51,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 228 [2023-11-30 03:03:51,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:51,920 INFO L124 PetriNetUnfolderBase]: 45/291 cut-off events. [2023-11-30 03:03:51,920 INFO L125 PetriNetUnfolderBase]: For 44/63 co-relation queries the response was YES. [2023-11-30 03:03:51,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 291 events. 45/291 cut-off events. For 44/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 639 event pairs, 31 based on Foata normal form. 6/262 useless extension candidates. Maximal degree in co-relation 233. Up to 97 conditions per place. [2023-11-30 03:03:51,924 INFO L140 encePairwiseOnDemand]: 199/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/178 dead transitions. [2023-11-30 03:03:51,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 178 transitions, 414 flow [2023-11-30 03:03:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2023-11-30 03:03:51,938 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8406432748538012 [2023-11-30 03:03:51,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 575 transitions. [2023-11-30 03:03:51,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 575 transitions. [2023-11-30 03:03:51,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:51,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 575 transitions. [2023-11-30 03:03:51,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:51,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:51,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:51,953 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -19 predicate places. [2023-11-30 03:03:51,954 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 178 transitions, 414 flow [2023-11-30 03:03:51,954 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:51,954 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:51,954 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] [2023-11-30 03:03:51,954 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:03:51,955 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:51,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash 985966371, now seen corresponding path program 1 times [2023-11-30 03:03:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:51,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138158062] [2023-11-30 03:03:51,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:51,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,014 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:03:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138158062] [2023-11-30 03:03:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138158062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554708905] [2023-11-30 03:03:52,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,017 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,019 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 228 [2023-11-30 03:03:52,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 178 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 228 [2023-11-30 03:03:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,087 INFO L124 PetriNetUnfolderBase]: 45/290 cut-off events. [2023-11-30 03:03:52,087 INFO L125 PetriNetUnfolderBase]: For 112/531 co-relation queries the response was YES. [2023-11-30 03:03:52,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 290 events. 45/290 cut-off events. For 112/531 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 639 event pairs, 31 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 313. Up to 97 conditions per place. [2023-11-30 03:03:52,091 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/177 dead transitions. [2023-11-30 03:03:52,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 177 transitions, 458 flow [2023-11-30 03:03:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-11-30 03:03:52,092 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8026315789473685 [2023-11-30 03:03:52,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,097 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -18 predicate places. [2023-11-30 03:03:52,097 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 458 flow [2023-11-30 03:03:52,097 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,097 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,097 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] [2023-11-30 03:03:52,098 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:03:52,098 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:52,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1020279135, now seen corresponding path program 1 times [2023-11-30 03:03:52,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:52,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706679823] [2023-11-30 03:03:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,168 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:03:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706679823] [2023-11-30 03:03:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706679823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91206511] [2023-11-30 03:03:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,169 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,171 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 228 [2023-11-30 03:03:52,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 228 [2023-11-30 03:03:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,226 INFO L124 PetriNetUnfolderBase]: 45/289 cut-off events. [2023-11-30 03:03:52,227 INFO L125 PetriNetUnfolderBase]: For 229/1048 co-relation queries the response was YES. [2023-11-30 03:03:52,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 289 events. 45/289 cut-off events. For 229/1048 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 641 event pairs, 31 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 393. Up to 97 conditions per place. [2023-11-30 03:03:52,228 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/176 dead transitions. [2023-11-30 03:03:52,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 176 transitions, 502 flow [2023-11-30 03:03:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-11-30 03:03:52,230 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8026315789473685 [2023-11-30 03:03:52,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,234 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -17 predicate places. [2023-11-30 03:03:52,234 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 176 transitions, 502 flow [2023-11-30 03:03:52,235 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,235 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,235 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:52,235 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:03:52,235 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:52,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1659616527, now seen corresponding path program 1 times [2023-11-30 03:03:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562016260] [2023-11-30 03:03:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,287 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:03:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562016260] [2023-11-30 03:03:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562016260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102782063] [2023-11-30 03:03:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,289 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,293 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 228 [2023-11-30 03:03:52,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 176 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 228 [2023-11-30 03:03:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,349 INFO L124 PetriNetUnfolderBase]: 45/288 cut-off events. [2023-11-30 03:03:52,349 INFO L125 PetriNetUnfolderBase]: For 395/1614 co-relation queries the response was YES. [2023-11-30 03:03:52,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 288 events. 45/288 cut-off events. For 395/1614 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 624 event pairs, 31 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 473. Up to 97 conditions per place. [2023-11-30 03:03:52,352 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/175 dead transitions. [2023-11-30 03:03:52,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 175 transitions, 546 flow [2023-11-30 03:03:52,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-11-30 03:03:52,354 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8026315789473685 [2023-11-30 03:03:52,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,358 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -16 predicate places. [2023-11-30 03:03:52,358 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 175 transitions, 546 flow [2023-11-30 03:03:52,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,359 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,359 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] [2023-11-30 03:03:52,359 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:03:52,359 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:52,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash -229085416, now seen corresponding path program 1 times [2023-11-30 03:03:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:52,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439986802] [2023-11-30 03:03:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:52,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,404 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:03:52,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439986802] [2023-11-30 03:03:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439986802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281445760] [2023-11-30 03:03:52,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,405 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,406 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 228 [2023-11-30 03:03:52,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 175 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 228 [2023-11-30 03:03:52,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,466 INFO L124 PetriNetUnfolderBase]: 45/287 cut-off events. [2023-11-30 03:03:52,466 INFO L125 PetriNetUnfolderBase]: For 610/2229 co-relation queries the response was YES. [2023-11-30 03:03:52,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 287 events. 45/287 cut-off events. For 610/2229 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 635 event pairs, 31 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 553. Up to 97 conditions per place. [2023-11-30 03:03:52,468 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/174 dead transitions. [2023-11-30 03:03:52,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 174 transitions, 590 flow [2023-11-30 03:03:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-11-30 03:03:52,469 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8026315789473685 [2023-11-30 03:03:52,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-11-30 03:03:52,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,474 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -15 predicate places. [2023-11-30 03:03:52,474 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 174 transitions, 590 flow [2023-11-30 03:03:52,475 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,475 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,475 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] [2023-11-30 03:03:52,475 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:03:52,475 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:52,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash 517910394, now seen corresponding path program 1 times [2023-11-30 03:03:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:52,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442065221] [2023-11-30 03:03:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:52,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,527 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:03:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442065221] [2023-11-30 03:03:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442065221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710297319] [2023-11-30 03:03:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,532 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,533 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 228 [2023-11-30 03:03:52,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 174 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 228 [2023-11-30 03:03:52,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,597 INFO L124 PetriNetUnfolderBase]: 45/286 cut-off events. [2023-11-30 03:03:52,597 INFO L125 PetriNetUnfolderBase]: For 874/2893 co-relation queries the response was YES. [2023-11-30 03:03:52,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 286 events. 45/286 cut-off events. For 874/2893 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 639 event pairs, 31 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 633. Up to 99 conditions per place. [2023-11-30 03:03:52,599 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 23 selfloop transitions, 2 changer transitions 6/173 dead transitions. [2023-11-30 03:03:52,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 173 transitions, 638 flow [2023-11-30 03:03:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2023-11-30 03:03:52,601 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7923976608187134 [2023-11-30 03:03:52,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 542 transitions. [2023-11-30 03:03:52,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 542 transitions. [2023-11-30 03:03:52,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 542 transitions. [2023-11-30 03:03:52,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,606 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -14 predicate places. [2023-11-30 03:03:52,606 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 173 transitions, 638 flow [2023-11-30 03:03:52,607 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,607 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,607 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:52,607 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:03:52,607 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:52,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash 703289676, now seen corresponding path program 1 times [2023-11-30 03:03:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:52,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014069608] [2023-11-30 03:03:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,663 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:03:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014069608] [2023-11-30 03:03:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014069608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452267724] [2023-11-30 03:03:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,666 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 228 [2023-11-30 03:03:52,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 173 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 228 [2023-11-30 03:03:52,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,718 INFO L124 PetriNetUnfolderBase]: 45/285 cut-off events. [2023-11-30 03:03:52,718 INFO L125 PetriNetUnfolderBase]: For 1182/3601 co-relation queries the response was YES. [2023-11-30 03:03:52,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 285 events. 45/285 cut-off events. For 1182/3601 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 629 event pairs, 31 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 713. Up to 99 conditions per place. [2023-11-30 03:03:52,720 INFO L140 encePairwiseOnDemand]: 226/228 looper letters, 18 selfloop transitions, 1 changer transitions 6/172 dead transitions. [2023-11-30 03:03:52,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 172 transitions, 672 flow [2023-11-30 03:03:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2023-11-30 03:03:52,721 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.814327485380117 [2023-11-30 03:03:52,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 557 transitions. [2023-11-30 03:03:52,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 557 transitions. [2023-11-30 03:03:52,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 557 transitions. [2023-11-30 03:03:52,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,725 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -13 predicate places. [2023-11-30 03:03:52,725 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 172 transitions, 672 flow [2023-11-30 03:03:52,726 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,726 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,726 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] [2023-11-30 03:03:52,726 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:03:52,726 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:52,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1315724614, now seen corresponding path program 1 times [2023-11-30 03:03:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:52,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165801621] [2023-11-30 03:03:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,768 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:03:52,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165801621] [2023-11-30 03:03:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165801621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449901608] [2023-11-30 03:03:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,771 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 228 [2023-11-30 03:03:52,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 172 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 228 [2023-11-30 03:03:52,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,841 INFO L124 PetriNetUnfolderBase]: 58/340 cut-off events. [2023-11-30 03:03:52,841 INFO L125 PetriNetUnfolderBase]: For 1743/5276 co-relation queries the response was YES. [2023-11-30 03:03:52,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 340 events. 58/340 cut-off events. For 1743/5276 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 961 event pairs, 10 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 882. Up to 125 conditions per place. [2023-11-30 03:03:52,843 INFO L140 encePairwiseOnDemand]: 220/228 looper letters, 25 selfloop transitions, 7 changer transitions 6/184 dead transitions. [2023-11-30 03:03:52,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 184 transitions, 946 flow [2023-11-30 03:03:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-11-30 03:03:52,845 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-30 03:03:52,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-11-30 03:03:52,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-11-30 03:03:52,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-11-30 03:03:52,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,850 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -12 predicate places. [2023-11-30 03:03:52,851 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 946 flow [2023-11-30 03:03:52,851 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,851 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,851 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:52,852 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:03:52,852 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:52,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 876074070, now seen corresponding path program 1 times [2023-11-30 03:03:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800199896] [2023-11-30 03:03:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:52,902 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:03:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800199896] [2023-11-30 03:03:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800199896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317684687] [2023-11-30 03:03:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:52,903 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:52,904 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 228 [2023-11-30 03:03:52,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 184 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:52,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 228 [2023-11-30 03:03:52,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:52,990 INFO L124 PetriNetUnfolderBase]: 95/497 cut-off events. [2023-11-30 03:03:52,990 INFO L125 PetriNetUnfolderBase]: For 3810/15861 co-relation queries the response was YES. [2023-11-30 03:03:52,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 497 events. 95/497 cut-off events. For 3810/15861 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2076 event pairs, 7 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 1998. Up to 202 conditions per place. [2023-11-30 03:03:52,994 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 49 selfloop transitions, 5 changer transitions 6/205 dead transitions. [2023-11-30 03:03:52,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 205 transitions, 1455 flow [2023-11-30 03:03:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2023-11-30 03:03:52,995 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8318713450292398 [2023-11-30 03:03:52,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2023-11-30 03:03:52,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2023-11-30 03:03:52,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:52,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2023-11-30 03:03:52,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,999 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -11 predicate places. [2023-11-30 03:03:52,999 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 205 transitions, 1455 flow [2023-11-30 03:03:52,999 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:52,999 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:52,999 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:52,999 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:03:53,000 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:53,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1840115482, now seen corresponding path program 1 times [2023-11-30 03:03:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936656301] [2023-11-30 03:03:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:53,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:53,052 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:03:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936656301] [2023-11-30 03:03:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936656301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208577147] [2023-11-30 03:03:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:53,053 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:53,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:53,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:53,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:53,054 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 228 [2023-11-30 03:03:53,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 205 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:53,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 228 [2023-11-30 03:03:53,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:53,179 INFO L124 PetriNetUnfolderBase]: 112/682 cut-off events. [2023-11-30 03:03:53,179 INFO L125 PetriNetUnfolderBase]: For 5619/23253 co-relation queries the response was YES. [2023-11-30 03:03:53,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 682 events. 112/682 cut-off events. For 5619/23253 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3796 event pairs, 3 based on Foata normal form. 3/630 useless extension candidates. Maximal degree in co-relation 2875. Up to 260 conditions per place. [2023-11-30 03:03:53,184 INFO L140 encePairwiseOnDemand]: 223/228 looper letters, 77 selfloop transitions, 13 changer transitions 6/240 dead transitions. [2023-11-30 03:03:53,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 240 transitions, 2372 flow [2023-11-30 03:03:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2023-11-30 03:03:53,185 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8347953216374269 [2023-11-30 03:03:53,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2023-11-30 03:03:53,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2023-11-30 03:03:53,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:53,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2023-11-30 03:03:53,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,188 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -10 predicate places. [2023-11-30 03:03:53,188 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 240 transitions, 2372 flow [2023-11-30 03:03:53,188 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,189 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:53,189 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:53,189 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:03:53,189 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:53,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash -688791290, now seen corresponding path program 1 times [2023-11-30 03:03:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455166962] [2023-11-30 03:03:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:53,209 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:03:53,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:53,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455166962] [2023-11-30 03:03:53,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455166962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:53,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:53,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:53,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063663826] [2023-11-30 03:03:53,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:53,210 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:53,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:53,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:53,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:53,211 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 228 [2023-11-30 03:03:53,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 240 transitions, 2372 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:53,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 228 [2023-11-30 03:03:53,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:53,300 INFO L124 PetriNetUnfolderBase]: 112/669 cut-off events. [2023-11-30 03:03:53,300 INFO L125 PetriNetUnfolderBase]: For 6216/17277 co-relation queries the response was YES. [2023-11-30 03:03:53,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 669 events. 112/669 cut-off events. For 6216/17277 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3747 event pairs, 4 based on Foata normal form. 5/620 useless extension candidates. Maximal degree in co-relation 2124. Up to 260 conditions per place. [2023-11-30 03:03:53,305 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 97 selfloop transitions, 7 changer transitions 6/253 dead transitions. [2023-11-30 03:03:53,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 253 transitions, 2896 flow [2023-11-30 03:03:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-11-30 03:03:53,306 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8216374269005848 [2023-11-30 03:03:53,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-11-30 03:03:53,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-11-30 03:03:53,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:53,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-11-30 03:03:53,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,309 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -9 predicate places. [2023-11-30 03:03:53,309 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 253 transitions, 2896 flow [2023-11-30 03:03:53,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:53,309 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:53,309 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:03:53,309 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:53,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1865162042, now seen corresponding path program 1 times [2023-11-30 03:03:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581308593] [2023-11-30 03:03:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:53,331 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:03:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581308593] [2023-11-30 03:03:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581308593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:53,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978642938] [2023-11-30 03:03:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:53,332 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:53,333 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 228 [2023-11-30 03:03:53,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 253 transitions, 2896 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:53,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 228 [2023-11-30 03:03:53,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:53,425 INFO L124 PetriNetUnfolderBase]: 112/664 cut-off events. [2023-11-30 03:03:53,425 INFO L125 PetriNetUnfolderBase]: For 7469/24600 co-relation queries the response was YES. [2023-11-30 03:03:53,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3748 conditions, 664 events. 112/664 cut-off events. For 7469/24600 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3687 event pairs, 2 based on Foata normal form. 7/619 useless extension candidates. Maximal degree in co-relation 2290. Up to 255 conditions per place. [2023-11-30 03:03:53,430 INFO L140 encePairwiseOnDemand]: 223/228 looper letters, 103 selfloop transitions, 6 changer transitions 12/260 dead transitions. [2023-11-30 03:03:53,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 260 transitions, 3335 flow [2023-11-30 03:03:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2023-11-30 03:03:53,431 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8157894736842105 [2023-11-30 03:03:53,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2023-11-30 03:03:53,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2023-11-30 03:03:53,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:53,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2023-11-30 03:03:53,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,434 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -9 predicate places. [2023-11-30 03:03:53,434 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 260 transitions, 3335 flow [2023-11-30 03:03:53,434 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,434 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:53,434 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:53,434 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:03:53,435 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:53,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 542381798, now seen corresponding path program 1 times [2023-11-30 03:03:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862749355] [2023-11-30 03:03:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:53,839 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:03:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862749355] [2023-11-30 03:03:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862749355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:03:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757485622] [2023-11-30 03:03:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:53,840 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:03:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:03:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:03:53,841 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 228 [2023-11-30 03:03:53,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 260 transitions, 3335 flow. Second operand has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:53,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:53,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 228 [2023-11-30 03:03:53,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:54,405 INFO L124 PetriNetUnfolderBase]: 1280/2573 cut-off events. [2023-11-30 03:03:54,405 INFO L125 PetriNetUnfolderBase]: For 87214/87392 co-relation queries the response was YES. [2023-11-30 03:03:54,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21907 conditions, 2573 events. 1280/2573 cut-off events. For 87214/87392 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15722 event pairs, 92 based on Foata normal form. 0/2498 useless extension candidates. Maximal degree in co-relation 21466. Up to 1427 conditions per place. [2023-11-30 03:03:54,446 INFO L140 encePairwiseOnDemand]: 223/228 looper letters, 467 selfloop transitions, 4 changer transitions 13/611 dead transitions. [2023-11-30 03:03:54,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 611 transitions, 13437 flow [2023-11-30 03:03:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:03:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:03:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1071 transitions. [2023-11-30 03:03:54,448 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7828947368421053 [2023-11-30 03:03:54,448 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1071 transitions. [2023-11-30 03:03:54,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1071 transitions. [2023-11-30 03:03:54,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:54,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1071 transitions. [2023-11-30 03:03:54,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.5) internal successors, (1071), 6 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:54,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:54,452 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:54,453 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -5 predicate places. [2023-11-30 03:03:54,453 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 611 transitions, 13437 flow [2023-11-30 03:03:54,453 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:54,453 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:54,454 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:54,454 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:03:54,454 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-30 03:03:54,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 191553269, now seen corresponding path program 1 times [2023-11-30 03:03:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:54,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102892954] [2023-11-30 03:03:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:54,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:03:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102892954] [2023-11-30 03:03:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102892954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:55,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:55,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:03:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488585354] [2023-11-30 03:03:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:55,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:03:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:03:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:03:55,244 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 228 [2023-11-30 03:03:55,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 611 transitions, 13437 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:55,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:55,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 228 [2023-11-30 03:03:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:55,739 INFO L124 PetriNetUnfolderBase]: 1284/2551 cut-off events. [2023-11-30 03:03:55,739 INFO L125 PetriNetUnfolderBase]: For 88403/88431 co-relation queries the response was YES. [2023-11-30 03:03:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24003 conditions, 2551 events. 1284/2551 cut-off events. For 88403/88431 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15388 event pairs, 92 based on Foata normal form. 0/2510 useless extension candidates. Maximal degree in co-relation 23470. Up to 1738 conditions per place. [2023-11-30 03:03:55,753 INFO L140 encePairwiseOnDemand]: 223/228 looper letters, 0 selfloop transitions, 0 changer transitions 746/746 dead transitions. [2023-11-30 03:03:55,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 746 transitions, 18463 flow [2023-11-30 03:03:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:03:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:03:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1054 transitions. [2023-11-30 03:03:55,755 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.77046783625731 [2023-11-30 03:03:55,756 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1054 transitions. [2023-11-30 03:03:55,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1054 transitions. [2023-11-30 03:03:55,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:55,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1054 transitions. [2023-11-30 03:03:55,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.66666666666666) internal successors, (1054), 6 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:55,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:55,759 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:55,760 INFO L307 CegarLoopForPetriNet]: 204 programPoint places, -1 predicate places. [2023-11-30 03:03:55,760 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 746 transitions, 18463 flow [2023-11-30 03:03:55,760 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:55,764 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-bluetooth.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (53 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (52 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (51 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (49 of 57 remaining) [2023-11-30 03:03:55,787 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (48 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (45 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (44 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (43 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (42 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (40 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (39 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (38 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (37 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 57 remaining) [2023-11-30 03:03:55,788 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (27 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (26 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (24 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (23 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (22 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 57 remaining) [2023-11-30 03:03:55,789 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (19 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (16 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (14 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (13 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (12 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (11 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (10 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (9 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 57 remaining) [2023-11-30 03:03:55,790 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 57 remaining) [2023-11-30 03:03:55,791 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 57 remaining) [2023-11-30 03:03:55,791 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 57 remaining) [2023-11-30 03:03:55,791 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 57 remaining) [2023-11-30 03:03:55,791 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 57 remaining) [2023-11-30 03:03:55,791 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 57 remaining) [2023-11-30 03:03:55,791 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (1 of 57 remaining) [2023-11-30 03:03:55,791 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 57 remaining) [2023-11-30 03:03:55,791 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:03:55,791 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:03:55,795 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:03:55,795 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:03:55,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:03:55 BasicIcfg [2023-11-30 03:03:55,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:03:55,799 INFO L158 Benchmark]: Toolchain (without parser) took 5287.78ms. Allocated memory was 522.2MB in the beginning and 752.9MB in the end (delta: 230.7MB). Free memory was 479.7MB in the beginning and 299.5MB in the end (delta: 180.2MB). Peak memory consumption was 413.0MB. Max. memory is 16.0GB. [2023-11-30 03:03:55,799 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory is still 296.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:03:55,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.49ms. Allocated memory is still 522.2MB. Free memory was 479.7MB in the beginning and 467.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:03:55,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.33ms. Allocated memory is still 522.2MB. Free memory was 467.7MB in the beginning and 465.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:03:55,800 INFO L158 Benchmark]: Boogie Preprocessor took 21.81ms. Allocated memory is still 522.2MB. Free memory was 465.6MB in the beginning and 463.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:03:55,800 INFO L158 Benchmark]: RCFGBuilder took 676.48ms. Allocated memory is still 522.2MB. Free memory was 463.5MB in the beginning and 427.3MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-11-30 03:03:55,800 INFO L158 Benchmark]: TraceAbstraction took 4371.27ms. Allocated memory was 522.2MB in the beginning and 752.9MB in the end (delta: 230.7MB). Free memory was 426.8MB in the beginning and 299.5MB in the end (delta: 127.3MB). Peak memory consumption was 358.4MB. Max. memory is 16.0GB. [2023-11-30 03:03:55,801 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory is still 296.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 185.49ms. Allocated memory is still 522.2MB. Free memory was 479.7MB in the beginning and 467.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.33ms. Allocated memory is still 522.2MB. Free memory was 467.7MB in the beginning and 465.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.81ms. Allocated memory is still 522.2MB. Free memory was 465.6MB in the beginning and 463.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 676.48ms. Allocated memory is still 522.2MB. Free memory was 463.5MB in the beginning and 427.3MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 4371.27ms. Allocated memory was 522.2MB in the beginning and 752.9MB in the end (delta: 230.7MB). Free memory was 426.8MB in the beginning and 299.5MB in the end (delta: 127.3MB). Peak memory consumption was 358.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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: 84]: 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: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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: 103]: 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: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 263 locations, 57 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.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 737 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 78 mSDtfsCounter, 737 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18463occurred in iteration=14, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1001 NumberOfCodeBlocks, 1001 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 1173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:03:55,863 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...