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.r356-tall-171683760900363.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 itstools
Input is ShieldPPPs-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760900363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 11:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 18K 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 ShieldPPPs-PT-001B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716951354158

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 02:55:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 02:55:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:55:55] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-29 02:55:55] [INFO ] Transformed 71 places.
[2024-05-29 02:55:55] [INFO ] Transformed 66 transitions.
[2024-05-29 02:55:55] [INFO ] Found NUPN structural information;
[2024-05-29 02:55:55] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 66 transition count 61
Applied a total of 10 rules in 21 ms. Remains 66 /71 variables (removed 5) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 66 cols
[2024-05-29 02:55:55] [INFO ] Computed 12 invariants in 12 ms
[2024-05-29 02:55:55] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-29 02:55:55] [INFO ] Invariant cache hit.
[2024-05-29 02:55:56] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-29 02:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 9 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 02:55:56] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:57] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:55:57] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/127 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:55:57] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 02:55:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/127 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:58] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 99 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2501 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/127 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 159 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
After SMT, in 3567ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3581ms
Starting structural reductions in LTL mode, iteration 1 : 66/71 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3956 ms. Remains : 66/71 places, 61/66 transitions.
Support contains 20 out of 66 places after structural reductions.
[2024-05-29 02:55:59] [INFO ] Flatten gal took : 25 ms
[2024-05-29 02:55:59] [INFO ] Flatten gal took : 9 ms
[2024-05-29 02:55:59] [INFO ] Input system was already deterministic with 61 transitions.
RANDOM walk for 40000 steps (119 resets) in 681 ms. (58 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40003 steps (34 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
[2024-05-29 02:56:00] [INFO ] Invariant cache hit.
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 3/127 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, State Equation: 0/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 12 stabilizing places and 12 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(X(G(p0))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 63 transition count 58
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 58
Applied a total of 6 rules in 4 ms. Remains 63 /66 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-29 02:56:00] [INFO ] Computed 12 invariants in 4 ms
[2024-05-29 02:56:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 02:56:00] [INFO ] Invariant cache hit.
[2024-05-29 02:56:00] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-29 02:56:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 02:56:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:56:00] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:56:00] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:01] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:56:01] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:01] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:56:01] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:01] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:01] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1546 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:56:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:56:02] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
[2024-05-29 02:56:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 02:56:02] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3565ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3568ms
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 58/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3694 ms. Remains : 63/66 places, 58/61 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-01 finished in 4010 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(X(G((p0||G((X(p2)&&p1)))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 64 transition count 59
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 64 transition count 59
Applied a total of 4 rules in 5 ms. Remains 64 /66 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:56:04] [INFO ] Computed 12 invariants in 3 ms
[2024-05-29 02:56:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 02:56:04] [INFO ] Invariant cache hit.
[2024-05-29 02:56:04] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:56:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:04] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2024-05-29 02:56:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:56:04] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:56:04] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 02:56:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:56:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:05] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:06] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:56:06] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:56:06] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:56:06] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:56:06] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 149 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 15/15 constraints]
After SMT, in 2995ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2996ms
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 59/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3096 ms. Remains : 64/66 places, 59/61 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-02 finished in 3307 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(X(G(p0))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 63 transition count 58
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 58
Applied a total of 6 rules in 5 ms. Remains 63 /66 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-29 02:56:07] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 02:56:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 02:56:07] [INFO ] Invariant cache hit.
[2024-05-29 02:56:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-29 02:56:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:07] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:56:09] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 02:56:09] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 02:56:09] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:56:09] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:56:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3534ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3535ms
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 58/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3634 ms. Remains : 63/66 places, 58/61 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 52 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-05 finished in 3771 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))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 52
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 57 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 57 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 52 transition count 47
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 49 transition count 44
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 49 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 49 transition count 43
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 48 transition count 43
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 2 with 30 rules applied. Total rules applied 64 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 32 transition count 27
Applied a total of 65 rules in 30 ms. Remains 32 /66 variables (removed 34) and now considering 27/61 (removed 34) transitions.
// Phase 1: matrix 27 rows 32 cols
[2024-05-29 02:56:11] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:56:11] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 02:56:11] [INFO ] Invariant cache hit.
[2024-05-29 02:56:11] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 02:56:11] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-29 02:56:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 02:56:11] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 27/59 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 45 constraints, problems are : Problem set: 0 solved, 25 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 27/59 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 25/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 70 constraints, problems are : Problem set: 0 solved, 25 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/66 places, 27/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 532 ms. Remains : 32/66 places, 27/61 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-06 finished in 584 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(X(F(p0))))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 64 transition count 59
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 64 transition count 59
Applied a total of 4 rules in 5 ms. Remains 64 /66 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:56:12] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 02:56:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 02:56:12] [INFO ] Invariant cache hit.
[2024-05-29 02:56:12] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:56:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:12] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 02:56:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:56:12] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 02:56:12] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:12] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:13] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 83 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1390 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:14] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:56:14] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:56:14] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:56:14] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-29 02:56:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:56:14] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/123 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:56:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:56:15] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/123 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/123 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 151 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2950 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 17/17 constraints]
After SMT, in 4352ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4353ms
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 59/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4455 ms. Remains : 64/66 places, 59/61 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-07
Stuttering criterion allowed to conclude after 487 steps with 2 reset in 6 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-07 finished in 4587 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))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 51
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 56 transition count 51
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 56 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 51 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 48 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 48 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 34 place count 48 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 47 transition count 42
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 34 transition count 29
Applied a total of 61 rules in 22 ms. Remains 34 /66 variables (removed 32) and now considering 29/61 (removed 32) transitions.
// Phase 1: matrix 29 rows 34 cols
[2024-05-29 02:56:16] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:56:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 02:56:16] [INFO ] Invariant cache hit.
[2024-05-29 02:56:16] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 02:56:16] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-29 02:56:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 29/63 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 29/63 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 494ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/66 places, 29/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 589 ms. Remains : 34/66 places, 29/61 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-09
Product exploration explored 100000 steps with 7759 reset in 177 ms.
Stack based approach found an accepted trace after 8295 steps with 644 reset with depth 36 and stack size 36 in 13 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-09 finished in 836 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)||(p1&&G(F(p2))))))'
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 60
Applied a total of 2 rules in 3 ms. Remains 65 /66 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-05-29 02:56:17] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 02:56:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 02:56:17] [INFO ] Invariant cache hit.
[2024-05-29 02:56:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-29 02:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 02:56:17] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:56:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:56:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:56:17] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:56:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:56:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 02:56:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:18] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 02:56:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/125 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:56:18] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:19] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 02:56:19] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 93 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1949 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/93 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:19] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 02:56:19] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:56:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 02:56:20] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:56:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/125 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 158 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2736 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 22/22 constraints]
After SMT, in 4694ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4696ms
Starting structural reductions in LTL mode, iteration 1 : 65/66 places, 60/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4776 ms. Remains : 65/66 places, 60/61 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-13
Stuttering criterion allowed to conclude after 23645 steps with 1345 reset in 46 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-13 finished in 5133 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 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 51
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 56 transition count 51
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 56 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 51 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 48 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 48 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 34 place count 48 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 47 transition count 42
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 62 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 33 transition count 28
Applied a total of 63 rules in 8 ms. Remains 33 /66 variables (removed 33) and now considering 28/61 (removed 33) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-29 02:56:22] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:56:22] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 02:56:22] [INFO ] Invariant cache hit.
[2024-05-29 02:56:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 02:56:22] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-29 02:56:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 02:56:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:56:22] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 02:56:22] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 02:56:22] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 49 constraints, problems are : Problem set: 0 solved, 27 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 28/61 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 76 constraints, problems are : Problem set: 0 solved, 27 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints]
After SMT, in 741ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 742ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/66 places, 28/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 822 ms. Remains : 33/66 places, 28/61 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-15
Product exploration explored 100000 steps with 861 reset in 150 ms.
Product exploration explored 100000 steps with 891 reset in 158 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-29 02:56:24] [INFO ] Invariant cache hit.
[2024-05-29 02:56:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 02:56:24] [INFO ] Invariant cache hit.
[2024-05-29 02:56:24] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 02:56:24] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-29 02:56:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 02:56:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:56:24] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 02:56:24] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 02:56:24] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 49 constraints, problems are : Problem set: 0 solved, 27 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 28/61 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 76 constraints, problems are : Problem set: 0 solved, 27 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints]
After SMT, in 739ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 740ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 824 ms. Remains : 33/33 places, 28/28 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 876 reset in 103 ms.
Product exploration explored 100000 steps with 869 reset in 236 ms.
Built C files in :
/tmp/ltsmin35420963689689081
[2024-05-29 02:56:25] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2024-05-29 02:56:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:56:25] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2024-05-29 02:56:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:56:25] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2024-05-29 02:56:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:56:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin35420963689689081
Running compilation step : cd /tmp/ltsmin35420963689689081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin35420963689689081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin35420963689689081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4747713292233147469.hoa' '--buchi-type=spotba'
LTSmin run took 1203 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-15 finished in 4651 ms.
All properties solved by simple procedures.
Total runtime 31874 ms.

BK_STOP 1716951387262

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-001B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPs-PT-001B, 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 r356-tall-171683760900363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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