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.r355-tall-171683759000540.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 ShieldPPPt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759000540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 14:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 11 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19K May 18 16:43 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 ShieldPPPt-PT-001B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717004508168

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:41:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 17:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:41:49] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-29 17:41:49] [INFO ] Transformed 81 places.
[2024-05-29 17:41:49] [INFO ] Transformed 74 transitions.
[2024-05-29 17:41:49] [INFO ] Found NUPN structural information;
[2024-05-29 17:41:49] [INFO ] Parsed PT model containing 81 places and 74 transitions and 184 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldPPPt-PT-001B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 65
Applied a total of 18 rules in 25 ms. Remains 72 /81 variables (removed 9) and now considering 65/74 (removed 9) transitions.
// Phase 1: matrix 65 rows 72 cols
[2024-05-29 17:41:49] [INFO ] Computed 12 invariants in 10 ms
[2024-05-29 17:41:49] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 17:41:49] [INFO ] Invariant cache hit.
[2024-05-29 17:41:49] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-29 17:41:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 9 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:41:51] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 65/137 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1766 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/137 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 64/157 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 161 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1726 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 13/13 constraints]
After SMT, in 3529ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3544ms
Starting structural reductions in LTL mode, iteration 1 : 72/81 places, 65/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3901 ms. Remains : 72/81 places, 65/74 transitions.
Support contains 18 out of 72 places after structural reductions.
[2024-05-29 17:41:53] [INFO ] Flatten gal took : 20 ms
[2024-05-29 17:41:53] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:41:53] [INFO ] Input system was already deterministic with 65 transitions.
RANDOM walk for 2323 steps (0 resets) in 85 ms. (27 steps per ms) remains 0/17 properties
Computed a total of 17 stabilizing places and 17 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(G((p0||X(p1)))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 68 transition count 61
Applied a total of 8 rules in 6 ms. Remains 68 /72 variables (removed 4) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 68 cols
[2024-05-29 17:41:54] [INFO ] Computed 12 invariants in 3 ms
[2024-05-29 17:41:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 17:41:54] [INFO ] Invariant cache hit.
[2024-05-29 17:41:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-29 17:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/129 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 60/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:41:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:41:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/129 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 150 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2313 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 10/10 constraints]
After SMT, in 3433ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3435ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 61/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3542 ms. Remains : 68/72 places, 61/65 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-00 finished in 3884 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)))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 71 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 55 transition count 48
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 32 place count 55 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 48 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 47 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 47 transition count 40
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 80 place count 31 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 86 place count 28 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 27 transition count 23
Applied a total of 87 rules in 22 ms. Remains 27 /72 variables (removed 45) and now considering 23/65 (removed 42) transitions.
// Phase 1: matrix 23 rows 27 cols
[2024-05-29 17:41:58] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 17:41:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 17:41:58] [INFO ] Invariant cache hit.
[2024-05-29 17:41:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-29 17:41:58] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-29 17:41:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 39 constraints, problems are : Problem set: 0 solved, 19 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 58 constraints, problems are : Problem set: 0 solved, 19 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 312ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/72 places, 23/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 413 ms. Remains : 27/72 places, 23/65 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-01
Stuttering criterion allowed to conclude after 933 steps with 0 reset in 14 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-01 finished in 483 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||X(G(p1)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 68 transition count 61
Applied a total of 8 rules in 10 ms. Remains 68 /72 variables (removed 4) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 68 cols
[2024-05-29 17:41:58] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 17:41:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 17:41:58] [INFO ] Invariant cache hit.
[2024-05-29 17:41:58] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-29 17:41:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:41:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:41:59] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/129 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 60/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/129 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 150 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 10/10 constraints]
After SMT, in 3360ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3364ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 61/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3459 ms. Remains : 68/72 places, 61/65 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-02 finished in 3578 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((F(p0)&&G((F(G(p1))&&F(p2))))))'
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 70 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 69 transition count 62
Applied a total of 6 rules in 6 ms. Remains 69 /72 variables (removed 3) and now considering 62/65 (removed 3) transitions.
// Phase 1: matrix 62 rows 69 cols
[2024-05-29 17:42:02] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 17:42:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 17:42:02] [INFO ] Invariant cache hit.
[2024-05-29 17:42:02] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-29 17:42:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 61/148 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 17:42:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
[2024-05-29 17:42:03] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:42:03] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 17:42:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 17:42:04] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 153 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 11/11 constraints]
After SMT, in 3105ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3106ms
Starting structural reductions in LTL mode, iteration 1 : 69/72 places, 62/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3229 ms. Remains : 69/72 places, 62/65 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-05
Stuttering criterion allowed to conclude after 838 steps with 5 reset in 7 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-05 finished in 3540 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(F((p0||G(F(p1))))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 71 transition count 47
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 54 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 53 transition count 45
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 37 place count 53 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 47 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 46 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 46 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 46 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 45 transition count 37
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 83 place count 30 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 28 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 27 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 26 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 89 place count 26 transition count 19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 24 transition count 19
Applied a total of 93 rules in 19 ms. Remains 24 /72 variables (removed 48) and now considering 19/65 (removed 46) transitions.
// Phase 1: matrix 19 rows 24 cols
[2024-05-29 17:42:05] [INFO ] Computed 11 invariants in 1 ms
[2024-05-29 17:42:05] [INFO ] Implicit Places using invariants in 64 ms returned [6, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/72 places, 19/65 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 5 ms. Remains 21 /22 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-29 17:42:05] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 17:42:05] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 17:42:05] [INFO ] Invariant cache hit.
[2024-05-29 17:42:05] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/72 places, 18/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 21/72 places, 18/65 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-06
Product exploration explored 100000 steps with 3188 reset in 234 ms.
Stack based approach found an accepted trace after 12736 steps with 394 reset with depth 78 and stack size 60 in 20 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-06 finished in 497 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)||(p0&&F(!p1)))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 68 transition count 61
Applied a total of 8 rules in 4 ms. Remains 68 /72 variables (removed 4) and now considering 61/65 (removed 4) transitions.
// Phase 1: matrix 61 rows 68 cols
[2024-05-29 17:42:06] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 17:42:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 17:42:06] [INFO ] Invariant cache hit.
[2024-05-29 17:42:06] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-29 17:42:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:42:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:42:06] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:42:06] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:42:06] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:42:06] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/129 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 60/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:07] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:08] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/129 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 150 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 10/10 constraints]
After SMT, in 3255ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3256ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 61/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3339 ms. Remains : 68/72 places, 61/65 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-001B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-001B-LTLFireability-09 finished in 3679 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)||X(p1)))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 68 transition count 61
Applied a total of 8 rules in 5 ms. Remains 68 /72 variables (removed 4) and now considering 61/65 (removed 4) transitions.
[2024-05-29 17:42:09] [INFO ] Invariant cache hit.
[2024-05-29 17:42:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 17:42:09] [INFO ] Invariant cache hit.
[2024-05-29 17:42:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-29 17:42:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/129 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 60/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 17:42:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/129 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 150 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2182 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 10/10 constraints]
After SMT, in 3221ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3221ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 61/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3332 ms. Remains : 68/72 places, 61/65 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-10 finished in 3499 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((F(!p0)&&F(G(p1)))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 71 transition count 48
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 55 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 54 transition count 46
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 35 place count 54 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 47 place count 48 transition count 40
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 46 transition count 38
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 46 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 46 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 45 transition count 37
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 81 place count 31 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 29 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 29 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 28 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 27 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 88 place count 27 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 25 transition count 20
Applied a total of 92 rules in 18 ms. Remains 25 /72 variables (removed 47) and now considering 20/65 (removed 45) transitions.
// Phase 1: matrix 20 rows 25 cols
[2024-05-29 17:42:13] [INFO ] Computed 11 invariants in 2 ms
[2024-05-29 17:42:13] [INFO ] Implicit Places using invariants in 31 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/72 places, 20/65 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 19
Applied a total of 2 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 22 cols
[2024-05-29 17:42:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 17:42:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 17:42:13] [INFO ] Invariant cache hit.
[2024-05-29 17:42:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/72 places, 19/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 22/72 places, 19/65 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-13
Stuttering criterion allowed to conclude after 14207 steps with 678 reset in 27 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-13 finished in 272 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)&&X(p1)&&(X(p2) U ((!p0&&X(p2))||X(G(p2))))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 70 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 63
Applied a total of 4 rules in 2 ms. Remains 70 /72 variables (removed 2) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 70 cols
[2024-05-29 17:42:13] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 17:42:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 17:42:13] [INFO ] Invariant cache hit.
[2024-05-29 17:42:13] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-29 17:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/133 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 91 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 17:42:15] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 63/133 variables, 70/92 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 62/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 17:42:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:42:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 156 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 12/12 constraints]
After SMT, in 2696ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2698ms
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 63/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2802 ms. Remains : 70/72 places, 63/65 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-14 finished in 3060 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)))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 71 transition count 47
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 54 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 53 transition count 45
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 37 place count 53 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 47 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 45 transition count 37
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 45 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 45 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 44 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 83 place count 30 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 28 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 28 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 27 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 26 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 90 place count 26 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 94 place count 24 transition count 19
Applied a total of 94 rules in 11 ms. Remains 24 /72 variables (removed 48) and now considering 19/65 (removed 46) transitions.
// Phase 1: matrix 19 rows 24 cols
[2024-05-29 17:42:16] [INFO ] Computed 11 invariants in 0 ms
[2024-05-29 17:42:16] [INFO ] Implicit Places using invariants in 24 ms returned [5, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/72 places, 19/65 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 4 place count 20 transition count 17
Applied a total of 4 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 20 cols
[2024-05-29 17:42:16] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 17:42:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 17:42:16] [INFO ] Invariant cache hit.
[2024-05-29 17:42:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/72 places, 17/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 20/72 places, 17/65 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-15
Product exploration explored 100000 steps with 37 reset in 115 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-15 finished in 251 ms.
All properties solved by simple procedures.
Total runtime 27563 ms.
ITS solved all properties within timeout

BK_STOP 1717004536922

--------------------
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 LTLFireability -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="ShieldPPPt-PT-001B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPt-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759000540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-001B.tgz
mv ShieldPPPt-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;