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.r575-smll-171734919600107.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 greatspnxred
Input is MedleyA-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 46K Jun 2 16:33 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 MedleyA-PT-14-LTLCardinality-00
FORMULA_NAME MedleyA-PT-14-LTLCardinality-01
FORMULA_NAME MedleyA-PT-14-LTLCardinality-02
FORMULA_NAME MedleyA-PT-14-LTLCardinality-03
FORMULA_NAME MedleyA-PT-14-LTLCardinality-04
FORMULA_NAME MedleyA-PT-14-LTLCardinality-05
FORMULA_NAME MedleyA-PT-14-LTLCardinality-06
FORMULA_NAME MedleyA-PT-14-LTLCardinality-07
FORMULA_NAME MedleyA-PT-14-LTLCardinality-08
FORMULA_NAME MedleyA-PT-14-LTLCardinality-09
FORMULA_NAME MedleyA-PT-14-LTLCardinality-10
FORMULA_NAME MedleyA-PT-14-LTLCardinality-11
FORMULA_NAME MedleyA-PT-14-LTLCardinality-12
FORMULA_NAME MedleyA-PT-14-LTLCardinality-13
FORMULA_NAME MedleyA-PT-14-LTLCardinality-14
FORMULA_NAME MedleyA-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717364398308

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:40:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:40:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:40:00] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 21:40:00] [INFO ] Transformed 184 places.
[2024-06-02 21:40:00] [INFO ] Transformed 178 transitions.
[2024-06-02 21:40:00] [INFO ] Found NUPN structural information;
[2024-06-02 21:40:00] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 148
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 148 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 148 transition count 142
Applied a total of 72 rules in 75 ms. Remains 148 /184 variables (removed 36) and now considering 142/178 (removed 36) transitions.
// Phase 1: matrix 142 rows 148 cols
[2024-06-02 21:40:01] [INFO ] Computed 24 invariants in 36 ms
[2024-06-02 21:40:01] [INFO ] Implicit Places using invariants in 537 ms returned [39, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 597 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/184 places, 142/178 transitions.
Applied a total of 0 rules in 14 ms. Remains 146 /146 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 715 ms. Remains : 146/184 places, 142/178 transitions.
Support contains 23 out of 146 places after structural reductions.
[2024-06-02 21:40:01] [INFO ] Flatten gal took : 57 ms
[2024-06-02 21:40:01] [INFO ] Flatten gal took : 26 ms
[2024-06-02 21:40:01] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 40000 steps (8 resets) in 1420 ms. (28 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40002 steps (8 resets) in 410 ms. (97 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
// Phase 1: matrix 142 rows 146 cols
[2024-06-02 21:40:02] [INFO ] Computed 22 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:40:02] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 12 ms to minimize.
[2024-06-02 21:40:03] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 3 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/118 variables, 12/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/146 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 142/288 variables, 146/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/288 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 170 constraints, problems are : Problem set: 1 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 40/288 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 3/15 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 535ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA MedleyA-PT-14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 24 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 34 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
// Phase 1: matrix 132 rows 136 cols
[2024-06-02 21:40:03] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:40:03] [INFO ] Implicit Places using invariants in 146 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/146 places, 132/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 135/146 places, 132/142 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 455 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-14-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLCardinality-00 finished in 1205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p1)) U p0)))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 9 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
[2024-06-02 21:40:04] [INFO ] Invariant cache hit.
[2024-06-02 21:40:04] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 21:40:04] [INFO ] Invariant cache hit.
[2024-06-02 21:40:05] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:40:06] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-02 21:40:06] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-06-02 21:40:06] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:40:07] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:40:07] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:40:07] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:40:07] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:40:07] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:40:07] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-02 21:40:08] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-06-02 21:40:08] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 11/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 132/268 variables, 136/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 169 constraints, problems are : Problem set: 3 solved, 128 unsolved in 6086 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 3 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 16/19 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/22 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 11/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 132/268 variables, 136/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 128/297 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-06-02 21:40:13] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/298 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 298 constraints, problems are : Problem set: 3 solved, 128 unsolved in 7435 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 128/131 constraints, Known Traps: 12/12 constraints]
After SMT, in 13575ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 13581ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/146 places, 129/142 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 129
Applied a total of 3 rules in 7 ms. Remains 133 /136 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 133 cols
[2024-06-02 21:40:18] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:40:18] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 21:40:18] [INFO ] Invariant cache hit.
[2024-06-02 21:40:18] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/146 places, 129/142 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14221 ms. Remains : 133/146 places, 129/142 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 33424 steps (7 resets) in 300 ms. (111 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 129/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-02 21:40:20] [INFO ] Invariant cache hit.
[2024-06-02 21:40:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:40:20] [INFO ] Invariant cache hit.
[2024-06-02 21:40:20] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-02 21:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 21:40:21] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:40:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:40:22] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-02 21:40:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-02 21:40:22] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 21:40:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:40:22] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 129/262 variables, 133/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:40:24] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 162 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8094 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/262 variables, 133/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 128/290 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 21:40:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 291 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7721 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 11/11 constraints]
After SMT, in 15845ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 15851ms
Finished structural reductions in LTL mode , in 1 iterations and 16128 ms. Remains : 133/133 places, 129/129 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/3 properties
BEST_FIRST walk for 30457 steps (6 resets) in 102 ms. (295 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-04 finished in 32622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((G(p1) U X(p0))))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 138 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 138 transition count 134
Applied a total of 16 rules in 4 ms. Remains 138 /146 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 138 cols
[2024-06-02 21:40:37] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:40:37] [INFO ] Implicit Places using invariants in 136 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/146 places, 134/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 137/146 places, 134/142 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-06 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||((G(!p0)||(!p0&&G(F(!p1))))&&X(!p2)))))'
Support contains 6 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 139 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 139 transition count 135
Applied a total of 14 rules in 5 ms. Remains 139 /146 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 139 cols
[2024-06-02 21:40:37] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:40:37] [INFO ] Implicit Places using invariants in 139 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 135/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 138/146 places, 135/142 transitions.
Stuttering acceptance computed with spot in 215 ms :[p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-08 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 145 transition count 135
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 139 transition count 135
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 139 transition count 117
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 121 transition count 117
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 114 transition count 110
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 114 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 114 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 111 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 110 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 110 transition count 106
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 110 place count 90 transition count 86
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 136 place count 77 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 76 transition count 107
Applied a total of 137 rules in 50 ms. Remains 76 /146 variables (removed 70) and now considering 107/142 (removed 35) transitions.
// Phase 1: matrix 107 rows 76 cols
[2024-06-02 21:40:38] [INFO ] Computed 22 invariants in 1 ms
[2024-06-02 21:40:38] [INFO ] Implicit Places using invariants in 92 ms returned [6, 10, 27, 47, 51, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 93 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/146 places, 107/142 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 70 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 63 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 61 transition count 104
Applied a total of 18 rules in 8 ms. Remains 61 /70 variables (removed 9) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 61 cols
[2024-06-02 21:40:38] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 21:40:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 21:40:38] [INFO ] Invariant cache hit.
[2024-06-02 21:40:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:40:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [11, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 192 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/146 places, 104/142 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 347 ms. Remains : 59/146 places, 104/142 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-09
Product exploration explored 100000 steps with 1 reset in 116 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-09 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 8 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
// Phase 1: matrix 132 rows 136 cols
[2024-06-02 21:40:38] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:40:39] [INFO ] Implicit Places using invariants in 137 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/146 places, 132/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 135/146 places, 132/142 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 0 reset in 181 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
RANDOM walk for 33419 steps (7 resets) in 70 ms. (470 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-14-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLCardinality-11 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(F(!p0)&&X(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 139 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 139 transition count 135
Applied a total of 14 rules in 5 ms. Remains 139 /146 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 139 cols
[2024-06-02 21:40:39] [INFO ] Computed 22 invariants in 1 ms
[2024-06-02 21:40:39] [INFO ] Implicit Places using invariants in 86 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 135/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 138/146 places, 135/142 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 119 ms.
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-15 finished in 320 ms.
All properties solved by simple procedures.
Total runtime 39941 ms.
ITS solved all properties within timeout

BK_STOP 1717364440256

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="MedleyA-PT-14"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-14, 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 r575-smll-171734919600107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-14.tgz
mv MedleyA-PT-14 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 ;