fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r153-tall-171631150900007
Last Updated
July 7, 2024

About the Execution of 2023-gold for DatabaseWithMutex-COL-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12596.947 3600000.00 7248670.00 15515.30 FFFFFFFFTFFF?TFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631150900007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DatabaseWithMutex-COL-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631150900007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.9K Apr 11 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 21K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-00
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-01
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-02
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-03
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-04
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-05
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-06
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-07
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-08
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-09
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716405840969

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-04
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-22 19:24:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 19:24:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:24:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-22 19:24:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 19:24:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 430 ms
[2024-05-22 19:24:03] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 140 PT places and 128.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 19:24:03] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2024-05-22 19:24:03] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10002 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 11 cols
[2024-05-22 19:24:03] [INFO ] Computed 4 invariants in 7 ms
[2024-05-22 19:24:03] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-05-22 19:24:03] [INFO ] Flatten gal took : 15 ms
[2024-05-22 19:24:03] [INFO ] Flatten gal took : 3 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-22 19:24:03] [INFO ] Unfolded HLPN to a Petri net with 140 places and 128 transitions 416 arcs in 11 ms.
[2024-05-22 19:24:03] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 140 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 19:24:03] [INFO ] Computed 28 invariants in 6 ms
[2024-05-22 19:24:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 19:24:03] [INFO ] Invariant cache hit.
[2024-05-22 19:24:03] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-22 19:24:03] [INFO ] Invariant cache hit.
[2024-05-22 19:24:04] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 140 out of 140 places after structural reductions.
[2024-05-22 19:24:04] [INFO ] Flatten gal took : 36 ms
[2024-05-22 19:24:04] [INFO ] Flatten gal took : 14 ms
[2024-05-22 19:24:04] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 19:24:04] [INFO ] Invariant cache hit.
[2024-05-22 19:24:04] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 48 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:24:04] [INFO ] Invariant cache hit.
[2024-05-22 19:24:04] [INFO ] Implicit Places using invariants in 101 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 104 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 124/140 places, 128/128 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 370 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 2 (ADD s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123)), p1:(OR (LEQ 2 (ADD s108 s109 s110 s111 s112 s113 s114 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 6 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-02 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Applied a total of 132 rules in 17 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-22 19:24:05] [INFO ] Computed 24 invariants in 2 ms
[2024-05-22 19:24:05] [INFO ] Implicit Places using invariants in 136 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2024-05-22 19:24:05] [INFO ] Actually due to overlaps returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 139 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/140 places, 64/128 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 56 transition count 48
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 40 transition count 48
Applied a total of 32 rules in 5 ms. Remains 40 /56 variables (removed 16) and now considering 48/64 (removed 16) transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-22 19:24:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 19:24:05] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 19:24:05] [INFO ] Invariant cache hit.
[2024-05-22 19:24:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/140 places, 48/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 40/140 places, 48/128 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11762 reset in 331 ms.
Stack based approach found an accepted trace after 80 steps with 9 reset with depth 8 and stack size 8 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-03 finished in 633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Applied a total of 132 rules in 11 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-22 19:24:05] [INFO ] Computed 24 invariants in 3 ms
[2024-05-22 19:24:06] [INFO ] Implicit Places using invariants in 75 ms returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 75 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/140 places, 64/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 56/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 184 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-04 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 19:24:06] [INFO ] Computed 28 invariants in 3 ms
[2024-05-22 19:24:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 19:24:06] [INFO ] Invariant cache hit.
[2024-05-22 19:24:06] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-22 19:24:06] [INFO ] Invariant cache hit.
[2024-05-22 19:24:06] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 (ADD s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103)) (LEQ 1 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-06 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:24:06] [INFO ] Invariant cache hit.
[2024-05-22 19:24:06] [INFO ] Implicit Places using invariants in 65 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 68 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123) (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7039 reset in 175 ms.
Stack based approach found an accepted trace after 303 steps with 20 reset with depth 19 and stack size 19 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-07 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0) U p1)))))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:24:07] [INFO ] Invariant cache hit.
[2024-05-22 19:24:07] [INFO ] Implicit Places using invariants in 75 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 77 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 (ADD s16 s17 s18 s19)), p0:(LEQ 3 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 165 reset in 153 ms.
Stack based approach found an accepted trace after 441 steps with 1 reset with depth 306 and stack size 306 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-10 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U X(G(p2)))))'
Support contains 40 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:24:07] [INFO ] Invariant cache hit.
[2024-05-22 19:24:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 19:24:07] [INFO ] Invariant cache hit.
[2024-05-22 19:24:07] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-22 19:24:07] [INFO ] Invariant cache hit.
[2024-05-22 19:24:07] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND p2 (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(LEQ 2 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35)), p1:(GT (ADD s104 s105 s106 s107) (ADD s16 s17 s18 s19)), p0:(LEQ (ADD s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-11 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p0) U p1) U (p2||F(p3))))))'
Support contains 80 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:24:07] [INFO ] Invariant cache hit.
[2024-05-22 19:24:07] [INFO ] Implicit Places using invariants in 59 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 61 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 (ADD s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71)), p3:(LEQ 2 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 5564 reset in 432 ms.
Product exploration explored 100000 steps with 5496 reset in 393 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) p1 p0)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))))]
Knowledge based reduction with 13 factoid took 230 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Finished random walk after 11 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) p1 p0)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))))), (F (AND p0 (NOT p3) (NOT p1))), (F (AND p2 (NOT p3) (NOT p1))), (F (NOT (AND p0 (NOT p2) (NOT p3) p1))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (AND p0 (NOT p2) (NOT p3) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 13 factoid took 465 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
// Phase 1: matrix 128 rows 124 cols
[2024-05-22 19:24:10] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 19:24:10] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 19:24:10] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 19:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 19:24:10] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-22 19:24:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 19:24:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 19:24:10] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 19:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 19:24:11] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-22 19:24:11] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
[2024-05-22 19:24:11] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:24:11] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 19:24:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 176 ms
[2024-05-22 19:24:11] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 19:24:11] [INFO ] Added : 106 causal constraints over 22 iterations in 289 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 80 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:24:11] [INFO ] Invariant cache hit.
[2024-05-22 19:24:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 19:24:11] [INFO ] Invariant cache hit.
[2024-05-22 19:24:11] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-22 19:24:11] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 19:24:11] [INFO ] Invariant cache hit.
[2024-05-22 19:24:11] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (AND (NOT p2) (NOT p3))), (X (AND p0 (NOT p2) (NOT p3) p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))))]
Knowledge based reduction with 13 factoid took 239 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Finished random walk after 55 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (AND (NOT p2) (NOT p3))), (X (AND p0 (NOT p2) (NOT p3) p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))))), (F (AND p0 (NOT p3) (NOT p1))), (F (AND p2 (NOT p3) (NOT p1))), (F (NOT (AND p0 (NOT p2) (NOT p3) p1))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (AND p0 (NOT p2) (NOT p3) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 13 factoid took 495 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
[2024-05-22 19:24:13] [INFO ] Invariant cache hit.
[2024-05-22 19:24:13] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 19:24:13] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 19:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 19:24:13] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-22 19:24:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 19:24:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 19:24:13] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 19:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 19:24:13] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-22 19:24:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 19:24:13] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 19:24:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 19:24:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 19:24:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 189 ms
[2024-05-22 19:24:13] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 19:24:14] [INFO ] Added : 81 causal constraints over 17 iterations in 212 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 5540 reset in 359 ms.
Product exploration explored 100000 steps with 5498 reset in 343 ms.
Built C files in :
/tmp/ltsmin9842773941599627536
[2024-05-22 19:24:15] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-22 19:24:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:24:15] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-22 19:24:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:24:15] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-22 19:24:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:24:15] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9842773941599627536
Running compilation step : cd /tmp/ltsmin9842773941599627536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin9842773941599627536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9842773941599627536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5233887701157473772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 80 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:24:30] [INFO ] Invariant cache hit.
[2024-05-22 19:24:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 19:24:30] [INFO ] Invariant cache hit.
[2024-05-22 19:24:30] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-22 19:24:30] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-22 19:24:30] [INFO ] Invariant cache hit.
[2024-05-22 19:24:30] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 124/124 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin16496303616332097562
[2024-05-22 19:24:30] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-22 19:24:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:24:30] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-22 19:24:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:24:30] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-22 19:24:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:24:30] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16496303616332097562
Running compilation step : cd /tmp/ltsmin16496303616332097562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin16496303616332097562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16496303616332097562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7898999231166712955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 19:24:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 19:24:45] [INFO ] Flatten gal took : 8 ms
[2024-05-22 19:24:45] [INFO ] Time to serialize gal into /tmp/LTL4877190078143001645.gal : 3 ms
[2024-05-22 19:24:45] [INFO ] Time to serialize properties into /tmp/LTL9449198459223220230.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4877190078143001645.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13546392978655873023.hoa' '-atoms' '/tmp/LTL9449198459223220230.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9449198459223220230.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13546392978655873023.hoa
Detected timeout of ITS tools.
[2024-05-22 19:25:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 19:25:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 19:25:00] [INFO ] Time to serialize gal into /tmp/LTL1475261529138381330.gal : 1 ms
[2024-05-22 19:25:00] [INFO ] Time to serialize properties into /tmp/LTL12858948430879757618.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1475261529138381330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12858948430879757618.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMut...1248
Formula 0 simplified : GF((G!"(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMutex_...1240
Detected timeout of ITS tools.
[2024-05-22 19:25:15] [INFO ] Flatten gal took : 6 ms
[2024-05-22 19:25:15] [INFO ] Applying decomposition
[2024-05-22 19:25:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11686735194414668918.txt' '-o' '/tmp/graph11686735194414668918.bin' '-w' '/tmp/graph11686735194414668918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11686735194414668918.bin' '-l' '-1' '-v' '-w' '/tmp/graph11686735194414668918.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:25:15] [INFO ] Decomposing Gal with order
[2024-05-22 19:25:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:25:15] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 19:25:15] [INFO ] Flatten gal took : 34 ms
[2024-05-22 19:25:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2024-05-22 19:25:15] [INFO ] Time to serialize gal into /tmp/LTL11701201620746395003.gal : 3 ms
[2024-05-22 19:25:15] [INFO ] Time to serialize properties into /tmp/LTL8834700725643560462.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11701201620746395003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8834700725643560462.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((gu4.WaitMutex_0+gu4.WaitMutex_1)+(gu4.WaitMutex_2+gu4.WaitMutex_3))+((gu4.WaitMutex_4+gu4.WaitMutex_5)+(gu4.WaitMutex...1632
Formula 0 simplified : GF((G!"(((((gu4.WaitMutex_0+gu4.WaitMutex_1)+(gu4.WaitMutex_2+gu4.WaitMutex_3))+((gu4.WaitMutex_4+gu4.WaitMutex_5)+(gu4.WaitMutex_6+...1624
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5701309722125380389
[2024-05-22 19:25:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5701309722125380389
Running compilation step : cd /tmp/ltsmin5701309722125380389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin5701309722125380389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5701309722125380389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-12 finished in 98207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1||G(p2)))))'
Support contains 44 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 19:25:46] [INFO ] Computed 28 invariants in 2 ms
[2024-05-22 19:25:46] [INFO ] Implicit Places using invariants in 171 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 173 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107)), p1:(LEQ (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 26 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-13 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(F(p1)))) U (p0 U G(p2)))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:25:46] [INFO ] Invariant cache hit.
[2024-05-22 19:25:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 19:25:47] [INFO ] Invariant cache hit.
[2024-05-22 19:25:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-22 19:25:47] [INFO ] Invariant cache hit.
[2024-05-22 19:25:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 2 (ADD s104 s105 s106 s107)), p0:(LEQ (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24158 reset in 230 ms.
Product exploration explored 100000 steps with 24174 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Finished random walk after 9695 steps, including 2 resets, run visited all 11 properties in 38 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 p2))), (F p1), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 11 factoid took 515 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 19:25:49] [INFO ] Invariant cache hit.
[2024-05-22 19:25:49] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 19:25:49] [INFO ] Invariant cache hit.
[2024-05-22 19:25:49] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-22 19:25:49] [INFO ] Invariant cache hit.
[2024-05-22 19:25:49] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 140/140 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (OR p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :10
Finished Best-First random walk after 3101 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=443 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (OR p0 p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 p2))), (F p1), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 11 factoid took 504 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 24156 reset in 219 ms.
Product exploration explored 100000 steps with 24109 reset in 236 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 140 transition count 136
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 140 transition count 136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 140 transition count 136
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 14 ms. Remains 140 /140 variables (removed 0) and now considering 136/128 (removed -8) transitions.
[2024-05-22 19:25:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 136 rows 140 cols
[2024-05-22 19:25:52] [INFO ] Computed 28 invariants in 2 ms
[2024-05-22 19:25:52] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/140 places, 136/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 140/140 places, 136/128 transitions.
Built C files in :
/tmp/ltsmin6348912522578065222
[2024-05-22 19:25:52] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6348912522578065222
Running compilation step : cd /tmp/ltsmin6348912522578065222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin6348912522578065222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6348912522578065222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3410621324171603968.hoa' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-15 finished in 6317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p0) U p1) U (p2||F(p3))))))'
[2024-05-22 19:25:53] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 19:25:53] [INFO ] Applying decomposition
[2024-05-22 19:25:53] [INFO ] Flatten gal took : 8 ms
Built C files in :
/tmp/ltsmin6295332166128992655
[2024-05-22 19:25:53] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-22 19:25:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:25:53] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-22 19:25:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:25:53] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-22 19:25:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:25:53] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6295332166128992655
Running compilation step : cd /tmp/ltsmin6295332166128992655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16235895652402174840.txt' '-o' '/tmp/graph16235895652402174840.bin' '-w' '/tmp/graph16235895652402174840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16235895652402174840.bin' '-l' '-1' '-v' '-w' '/tmp/graph16235895652402174840.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:25:53] [INFO ] Decomposing Gal with order
[2024-05-22 19:25:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:25:53] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 19:25:53] [INFO ] Flatten gal took : 37 ms
[2024-05-22 19:25:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 19:25:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality1885305474421542022.gal : 26 ms
[2024-05-22 19:25:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality13589687726350029413.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1885305474421542022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13589687726350029413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((gi0.gu7.WaitMutex_0+gi0.gu7.WaitMutex_1)+(gi0.gu7.WaitMutex_2+gi0.gu7.WaitMutex_3))+((gi0.gu7.WaitMutex_4+gi0.gu7.Wai...1632
Formula 0 simplified : GF((G!"(((((gi0.gu7.WaitMutex_0+gi0.gu7.WaitMutex_1)+(gi0.gu7.WaitMutex_2+gi0.gu7.WaitMutex_3))+((gi0.gu7.WaitMutex_4+gi0.gu7.WaitMu...1624
Compilation finished in 459 ms.
Running link step : cd /tmp/ltsmin6295332166128992655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin6295332166128992655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 132, guards 128
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.075: LTL layer: formula: <>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))
pins2lts-mc-linux64( 7/ 8), 0.075: "<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.075: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.167: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.180: There are 133 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.180: State length is 141, there are 151 groups
pins2lts-mc-linux64( 0/ 8), 0.180: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.180: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.180: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.180: Visible groups: 0 / 151, labels: 4 / 133
pins2lts-mc-linux64( 0/ 8), 0.180: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.180: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.306: [Blue] ~20 levels ~960 states ~2256 transitions
pins2lts-mc-linux64( 3/ 8), 0.333: [Blue] ~28 levels ~1920 states ~5272 transitions
pins2lts-mc-linux64( 3/ 8), 0.405: [Blue] ~28 levels ~3840 states ~9680 transitions
pins2lts-mc-linux64( 3/ 8), 0.483: [Blue] ~28 levels ~7680 states ~16984 transitions
pins2lts-mc-linux64( 3/ 8), 0.723: [Blue] ~28 levels ~15360 states ~35888 transitions
pins2lts-mc-linux64( 3/ 8), 1.134: [Blue] ~28 levels ~30720 states ~68632 transitions
pins2lts-mc-linux64( 3/ 8), 1.960: [Blue] ~28 levels ~61440 states ~166488 transitions
pins2lts-mc-linux64( 3/ 8), 4.224: [Blue] ~28 levels ~122880 states ~344824 transitions
pins2lts-mc-linux64( 3/ 8), 8.381: [Blue] ~28 levels ~245760 states ~681576 transitions
pins2lts-mc-linux64( 6/ 8), 14.295: [Blue] ~40 levels ~491520 states ~1550880 transitions
pins2lts-mc-linux64( 3/ 8), 18.498: [Blue] ~40 levels ~983040 states ~3162152 transitions
pins2lts-mc-linux64( 3/ 8), 25.629: [Blue] ~40 levels ~1966080 states ~9262280 transitions
pins2lts-mc-linux64( 3/ 8), 40.433: [Blue] ~40 levels ~3932160 states ~22648968 transitions
pins2lts-mc-linux64( 3/ 8), 70.441: [Blue] ~51 levels ~7864320 states ~38044560 transitions
pins2lts-mc-linux64( 6/ 8), 129.497: [Blue] ~40 levels ~15728640 states ~99837216 transitions
pins2lts-mc-linux64( 4/ 8), 251.694: [Blue] ~40 levels ~31457280 states ~211349240 transitions
pins2lts-mc-linux64( 4/ 8), 494.173: [Blue] ~40 levels ~62914560 states ~424839032 transitions
pins2lts-mc-linux64( 4/ 8), 998.397: [Blue] ~40 levels ~125829120 states ~849885472 transitions
pins2lts-mc-linux64( 7/ 8), 1158.912: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1159.023:
pins2lts-mc-linux64( 0/ 8), 1159.023: Explored 134228164 states 811968997 transitions, fanout: 6.049
pins2lts-mc-linux64( 0/ 8), 1159.023: Total exploration time 1158.820 sec (1158.740 sec minimum, 1158.774 sec on average)
pins2lts-mc-linux64( 0/ 8), 1159.023: States per second: 115832, Transitions per second: 700686
pins2lts-mc-linux64( 0/ 8), 1159.023:
pins2lts-mc-linux64( 0/ 8), 1159.023: State space has 134217444 states, 18754737 are accepting
pins2lts-mc-linux64( 0/ 8), 1159.023: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1159.023: blue states: 134228164 (100.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1159.023: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1159.023: all-red states: 134208362 (99.99%), bogus 12035 (0.01%)
pins2lts-mc-linux64( 0/ 8), 1159.023:
pins2lts-mc-linux64( 0/ 8), 1159.023: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1159.023:
pins2lts-mc-linux64( 0/ 8), 1159.023: Queue width: 8B, total height: 397, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1159.023: Tree memory: 1182.6MB, 9.2 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 1159.023: Tree fill ratio (roots/leafs): 99.0%/61.0%
pins2lts-mc-linux64( 0/ 8), 1159.023: Stored 130 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1159.023: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1159.023: Est. total memory use: 1182.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6295332166128992655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6295332166128992655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((<>(!(LTLAPp0==true)) U (LTLAPp1==true)) U ((LTLAPp2==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 19:46:30] [INFO ] Applying decomposition
[2024-05-22 19:46:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 19:46:30] [INFO ] Decomposing Gal with order
[2024-05-22 19:46:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:46:30] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-22 19:46:30] [INFO ] Flatten gal took : 14 ms
[2024-05-22 19:46:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 19:46:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality13417848963341656229.gal : 2 ms
[2024-05-22 19:46:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality8938791364882667129.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13417848963341656229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8938791364882667129.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((((gsitefile0.WaitMutex_0+gsitefile1.WaitMutex_1)+(gsitefile2.WaitMutex_2+gsitefile3.WaitMutex_3))+((gsitefile4.WaitMute...2158
Formula 0 simplified : GF((G!"(((((gsitefile0.WaitMutex_0+gsitefile1.WaitMutex_1)+(gsitefile2.WaitMutex_2+gsitefile3.WaitMutex_3))+((gsitefile4.WaitMutex_4...2150
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 20:07:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 20:07:06] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-22 20:07:06] [INFO ] Transformed 140 places.
[2024-05-22 20:07:06] [INFO ] Transformed 128 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 20:07:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality16736641781791864540.gal : 6 ms
[2024-05-22 20:07:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality12395784831625537657.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16736641781791864540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12395784831625537657.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(((F("(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMut...1248
Formula 0 simplified : GF((G!"(((((WaitMutex_0+WaitMutex_1)+(WaitMutex_2+WaitMutex_3))+((WaitMutex_4+WaitMutex_5)+(WaitMutex_6+WaitMutex_7)))+(((WaitMutex_...1240
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4809336 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037644 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-COL-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DatabaseWithMutex-COL-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631150900007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-04.tgz
mv DatabaseWithMutex-COL-04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;