About the Execution of GreatSPN+red for SafeBus-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
521.115 | 86663.00 | 119436.00 | 399.70 | FTFFTFFTFFTTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078400411.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SafeBus-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078400411
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 8.5K Apr 12 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 14:37 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 5.2K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 12 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 154K Apr 12 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 95K 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 SafeBus-PT-03-LTLCardinality-00
FORMULA_NAME SafeBus-PT-03-LTLCardinality-01
FORMULA_NAME SafeBus-PT-03-LTLCardinality-02
FORMULA_NAME SafeBus-PT-03-LTLCardinality-03
FORMULA_NAME SafeBus-PT-03-LTLCardinality-04
FORMULA_NAME SafeBus-PT-03-LTLCardinality-05
FORMULA_NAME SafeBus-PT-03-LTLCardinality-06
FORMULA_NAME SafeBus-PT-03-LTLCardinality-07
FORMULA_NAME SafeBus-PT-03-LTLCardinality-08
FORMULA_NAME SafeBus-PT-03-LTLCardinality-09
FORMULA_NAME SafeBus-PT-03-LTLCardinality-10
FORMULA_NAME SafeBus-PT-03-LTLCardinality-11
FORMULA_NAME SafeBus-PT-03-LTLCardinality-12
FORMULA_NAME SafeBus-PT-03-LTLCardinality-13
FORMULA_NAME SafeBus-PT-03-LTLCardinality-14
FORMULA_NAME SafeBus-PT-03-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716855600134
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:20:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:20:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:20:01] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-28 00:20:01] [INFO ] Transformed 57 places.
[2024-05-28 00:20:01] [INFO ] Transformed 91 transitions.
[2024-05-28 00:20:01] [INFO ] Found NUPN structural information;
[2024-05-28 00:20:01] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 3 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SafeBus-PT-03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-28 00:20:01] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-28 00:20:01] [INFO ] Computed 17 invariants in 11 ms
[2024-05-28 00:20:02] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 00:20:02] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-28 00:20:02] [INFO ] Invariant cache hit.
[2024-05-28 00:20:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:02] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-28 00:20:02] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-28 00:20:02] [INFO ] Invariant cache hit.
[2024-05-28 00:20:02] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-28 00:20:02] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 20 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 10/81 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-28 00:20:03] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/83 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-28 00:20:04] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/84 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-28 00:20:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 68/122 variables, 54/139 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 152 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3166 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 14/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-28 00:20:05] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 00:20:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:20:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 00:20:05] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/89 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/89 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/143 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/156 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 79/235 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/235 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/235 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 235 constraints, problems are : Problem set: 9 solved, 79 unsolved in 1965 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 18/18 constraints]
After SMT, in 5255ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 5271ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5665 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 46 out of 54 places after structural reductions.
[2024-05-28 00:20:07] [INFO ] Flatten gal took : 28 ms
[2024-05-28 00:20:07] [INFO ] Flatten gal took : 12 ms
[2024-05-28 00:20:07] [INFO ] Input system was already deterministic with 82 transitions.
RANDOM walk for 40000 steps (8 resets) in 1102 ms. (36 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2024-05-28 00:20:08] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-28 00:20:08] [INFO ] Computed 17 invariants in 4 ms
[2024-05-28 00:20:08] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/18 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/29 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/51 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 00:20:08] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:20:08] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/51 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 1/52 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/52 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/52 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/119 variables, 52/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/119 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/119 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/122 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/122 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/122 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/122 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/18 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/29 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/51 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 00:20:08] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 00:20:08] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 5 ms to minimize.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 51/122 variables, and 70 constraints, problems are : Problem set: 1 solved, 0 unsolved in 107 ms.
Refiners :[Domain max(s): 51/54 constraints, Positive P Invariants (semi-flows): 5/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/54 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 275ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SafeBus-PT-03-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SafeBus-PT-03-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:08] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:08] [INFO ] Invariant cache hit.
[2024-05-28 00:20:08] [INFO ] Implicit Places using invariants in 63 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-00 finished in 355 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||X(X(F(p1))))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:09] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:09] [INFO ] Invariant cache hit.
[2024-05-28 00:20:09] [INFO ] Implicit Places using invariants in 62 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-03
Product exploration explored 100000 steps with 13211 reset in 271 ms.
Product exploration explored 100000 steps with 13120 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 105 steps (0 resets) in 8 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 00:20:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 51 cols
[2024-05-28 00:20:10] [INFO ] Computed 14 invariants in 3 ms
[2024-05-28 00:20:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 00:20:10] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-28 00:20:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 00:20:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:20:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 00:20:10] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-28 00:20:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 00:20:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:10] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:20:10] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 6 ms.
[2024-05-28 00:20:10] [INFO ] Added : 13 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:10] [INFO ] Invariant cache hit.
[2024-05-28 00:20:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 00:20:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:10] [INFO ] Invariant cache hit.
[2024-05-28 00:20:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:11] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:11] [INFO ] Invariant cache hit.
[2024-05-28 00:20:11] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:20:11] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 00:20:12] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-05-28 00:20:12] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 68/119 variables, 51/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 144 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2500 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/119 variables, 51/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 79/223 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 223 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1405 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
After SMT, in 3952ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3953ms
Finished structural reductions in LTL mode , in 1 iterations and 4114 ms. Remains : 51/51 places, 82/82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 292 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 00:20:15] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:15] [INFO ] Invariant cache hit.
[2024-05-28 00:20:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 00:20:15] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-28 00:20:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 00:20:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:20:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 00:20:16] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-28 00:20:16] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 00:20:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:16] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:20:16] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 00:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-28 00:20:16] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 5 ms.
[2024-05-28 00:20:16] [INFO ] Added : 32 causal constraints over 8 iterations in 81 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13181 reset in 108 ms.
Product exploration explored 100000 steps with 13139 reset in 138 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 16 ms. Remains 51 /51 variables (removed 0) and now considering 91/82 (removed -9) transitions.
[2024-05-28 00:20:17] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-28 00:20:17] [INFO ] Flow matrix only has 77 transitions (discarded 14 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-28 00:20:17] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 00:20:17] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 00:20:17] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 10/75 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 77/128 variables, 51/126 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 13/139 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/139 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/139 constraints. Problems are: Problem set: 6 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 139 constraints, problems are : Problem set: 6 solved, 82 unsolved in 1824 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 6 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/52 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/58 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 10/68 constraints. Problems are: Problem set: 6 solved, 82 unsolved
[2024-05-28 00:20:19] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-28 00:20:19] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/70 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/70 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 3/51 variables, 2/72 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 3/75 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 2/77 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/77 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 77/128 variables, 51/128 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 13/141 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 82/223 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/128 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 223 constraints, problems are : Problem set: 6 solved, 82 unsolved in 2017 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/88 constraints, Known Traps: 12/12 constraints]
After SMT, in 3883ms problems are : Problem set: 6 solved, 82 unsolved
Search for dead transitions found 6 dead transitions in 3890ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 51/51 places, 85/82 transitions.
Graph (complete) has 343 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 48 /51 variables (removed 3) and now considering 85/85 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/51 places, 85/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3926 ms. Remains : 48/51 places, 85/82 transitions.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:20] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 51 cols
[2024-05-28 00:20:20] [INFO ] Computed 14 invariants in 4 ms
[2024-05-28 00:20:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 00:20:20] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:20] [INFO ] Invariant cache hit.
[2024-05-28 00:20:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:21] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:21] [INFO ] Invariant cache hit.
[2024-05-28 00:20:21] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 5 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:20:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 00:20:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:22] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 68/119 variables, 51/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 144 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2553 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/119 variables, 51/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 79/223 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 223 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1547 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
After SMT, in 4135ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4136ms
Finished structural reductions in LTL mode , in 1 iterations and 4292 ms. Remains : 51/51 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-03 finished in 16217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1))||F(p2))))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:25] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-28 00:20:25] [INFO ] Computed 17 invariants in 3 ms
[2024-05-28 00:20:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 00:20:25] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:25] [INFO ] Invariant cache hit.
[2024-05-28 00:20:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:25] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:25] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:25] [INFO ] Invariant cache hit.
[2024-05-28 00:20:25] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 00:20:25] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 00:20:26] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:26] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 00:20:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 00:20:26] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:26] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 00:20:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 00:20:26] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/122 variables, 54/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2493 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:28] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 00:20:28] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 79/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 234 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1821 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 17/17 constraints]
After SMT, in 4343ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4344ms
Finished structural reductions in LTL mode , in 1 iterations and 4487 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-03-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-03-LTLCardinality-04 finished in 4884 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&&(p1||G(p2))))))'
Support contains 19 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:30] [INFO ] Invariant cache hit.
[2024-05-28 00:20:30] [INFO ] Implicit Places using invariants in 57 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 213 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 1 ms.
FORMULA SafeBus-PT-03-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-05 finished in 410 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) U p1)&&(X(F(p2)) U G(p0))))'
Support contains 17 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:30] [INFO ] Invariant cache hit.
[2024-05-28 00:20:30] [INFO ] Implicit Places using invariants in 56 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-06
Product exploration explored 100000 steps with 9464 reset in 183 ms.
Stack based approach found an accepted trace after 29074 steps with 2789 reset with depth 48 and stack size 48 in 53 ms.
FORMULA SafeBus-PT-03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-06 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:31] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:31] [INFO ] Invariant cache hit.
[2024-05-28 00:20:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 00:20:31] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:31] [INFO ] Invariant cache hit.
[2024-05-28 00:20:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:31] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-28 00:20:31] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:31] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:31] [INFO ] Invariant cache hit.
[2024-05-28 00:20:31] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 00:20:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-28 00:20:32] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 00:20:32] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 00:20:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 00:20:32] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/122 variables, 54/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2538 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:20:34] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 79/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 234 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1937 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 17/17 constraints]
After SMT, in 4505ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4508ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4680 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-07
Product exploration explored 100000 steps with 5148 reset in 140 ms.
Product exploration explored 100000 steps with 5179 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 13 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:36] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:36] [INFO ] Invariant cache hit.
[2024-05-28 00:20:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 00:20:36] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:36] [INFO ] Invariant cache hit.
[2024-05-28 00:20:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:37] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-28 00:20:37] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:37] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:37] [INFO ] Invariant cache hit.
[2024-05-28 00:20:37] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 00:20:37] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 00:20:38] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 00:20:38] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/122 variables, 54/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2533 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:39] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 00:20:39] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 79/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 234 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1807 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 17/17 constraints]
After SMT, in 4368ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4370ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4540 ms. Remains : 54/54 places, 82/82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 69 steps (0 resets) in 7 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5141 reset in 138 ms.
Product exploration explored 100000 steps with 5046 reset in 144 ms.
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:42] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:42] [INFO ] Invariant cache hit.
[2024-05-28 00:20:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 00:20:42] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:42] [INFO ] Invariant cache hit.
[2024-05-28 00:20:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:42] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-28 00:20:42] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:42] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:42] [INFO ] Invariant cache hit.
[2024-05-28 00:20:42] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:42] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 00:20:43] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/122 variables, 54/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2520 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:45] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 00:20:45] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 79/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 234 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1824 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 17/17 constraints]
After SMT, in 4376ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4549 ms. Remains : 54/54 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-07 finished in 15955 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(((p0&&F(G(!p1))) U (G((p0&&F(G(!p1))))||(p0&&X((!p1&&F(G(!p1))))))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:47] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:47] [INFO ] Invariant cache hit.
[2024-05-28 00:20:47] [INFO ] Implicit Places using invariants in 271 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 272 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 114 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-08 finished in 634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:47] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:47] [INFO ] Invariant cache hit.
[2024-05-28 00:20:47] [INFO ] Implicit Places using invariants in 64 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 82
Applied a total of 12 rules in 10 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:47] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2024-05-28 00:20:47] [INFO ] Computed 14 invariants in 2 ms
[2024-05-28 00:20:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 00:20:47] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:47] [INFO ] Invariant cache hit.
[2024-05-28 00:20:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:47] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/54 places, 82/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 45/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-11
Product exploration explored 100000 steps with 7045 reset in 109 ms.
Product exploration explored 100000 steps with 7017 reset in 114 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 29 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 82/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:48] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:48] [INFO ] Invariant cache hit.
[2024-05-28 00:20:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 00:20:48] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:48] [INFO ] Invariant cache hit.
[2024-05-28 00:20:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:48] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-28 00:20:48] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:48] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:48] [INFO ] Invariant cache hit.
[2024-05-28 00:20:48] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-28 00:20:49] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/113 variables, 45/117 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 130 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2160 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/113 variables, 45/117 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 79/209 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 209 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1573 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 13/13 constraints]
After SMT, in 3770ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3773ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3931 ms. Remains : 45/45 places, 82/82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7067 reset in 111 ms.
Product exploration explored 100000 steps with 7054 reset in 113 ms.
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:53] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:53] [INFO ] Invariant cache hit.
[2024-05-28 00:20:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 00:20:53] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:53] [INFO ] Invariant cache hit.
[2024-05-28 00:20:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:53] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-28 00:20:53] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:53] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:53] [INFO ] Invariant cache hit.
[2024-05-28 00:20:53] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:53] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:20:53] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 00:20:53] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 00:20:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 00:20:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:20:53] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 00:20:53] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 00:20:54] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:20:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 00:20:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-28 00:20:54] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:20:54] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/113 variables, 45/117 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 130 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2140 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/113 variables, 45/117 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 79/209 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 209 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1550 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 13/13 constraints]
After SMT, in 3722ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3723ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3884 ms. Remains : 45/45 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-11 finished in 9524 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(F(p0))||G(p1))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:57] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-28 00:20:57] [INFO ] Computed 17 invariants in 1 ms
[2024-05-28 00:20:57] [INFO ] Implicit Places using invariants in 60 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 51 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 47 transition count 82
Applied a total of 8 rules in 6 ms. Remains 47 /51 variables (removed 4) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:57] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 47 cols
[2024-05-28 00:20:57] [INFO ] Computed 14 invariants in 2 ms
[2024-05-28 00:20:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 00:20:57] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:57] [INFO ] Invariant cache hit.
[2024-05-28 00:20:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:57] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/54 places, 82/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 47/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-13
Product exploration explored 100000 steps with 1376 reset in 127 ms.
Product exploration explored 100000 steps with 1376 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 360 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 62 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 393 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:20:58] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:58] [INFO ] Invariant cache hit.
[2024-05-28 00:20:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 00:20:58] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:58] [INFO ] Invariant cache hit.
[2024-05-28 00:20:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:20:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-28 00:20:59] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-28 00:20:59] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:20:59] [INFO ] Invariant cache hit.
[2024-05-28 00:20:59] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 00:20:59] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:21:00] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-28 00:21:00] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:21:00] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/115 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2360 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/115 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 79/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/115 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 216 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1542 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 16/16 constraints]
After SMT, in 3937ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3938ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4144 ms. Remains : 47/47 places, 82/82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 68 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 350 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1341 reset in 132 ms.
Product exploration explored 100000 steps with 1445 reset in 138 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:21:04] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:21:04] [INFO ] Invariant cache hit.
[2024-05-28 00:21:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 00:21:04] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:21:04] [INFO ] Invariant cache hit.
[2024-05-28 00:21:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:21:04] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-28 00:21:04] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-28 00:21:04] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:21:04] [INFO ] Invariant cache hit.
[2024-05-28 00:21:04] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:21:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 00:21:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:21:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 00:21:04] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 00:21:04] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 00:21:04] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-28 00:21:04] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-28 00:21:05] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/115 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2242 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/115 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 79/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/115 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 216 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1519 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 16/16 constraints]
After SMT, in 3793ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3794ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3946 ms. Remains : 47/47 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-13 finished in 11067 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||X(G(p1))))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:21:08] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-28 00:21:08] [INFO ] Computed 17 invariants in 1 ms
[2024-05-28 00:21:08] [INFO ] Implicit Places using invariants in 78 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 109 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-15 finished in 216 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||X(X(F(p1))))))))'
Found a Shortening insensitive property : SafeBus-PT-03-LTLCardinality-03
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 00:21:08] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-28 00:21:08] [INFO ] Invariant cache hit.
[2024-05-28 00:21:08] [INFO ] Implicit Places using invariants in 59 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 85
Applied a total of 6 rules in 3 ms. Remains 48 /51 variables (removed 3) and now considering 85/82 (removed -3) transitions.
[2024-05-28 00:21:08] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2024-05-28 00:21:08] [INFO ] Computed 14 invariants in 2 ms
[2024-05-28 00:21:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 00:21:08] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:08] [INFO ] Invariant cache hit.
[2024-05-28 00:21:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:21:09] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 48/54 places, 85/82 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 217 ms. Remains : 48/54 places, 85/82 transitions.
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-03
Product exploration explored 100000 steps with 14679 reset in 151 ms.
Product exploration explored 100000 steps with 14733 reset in 153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 00:21:10] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:10] [INFO ] Invariant cache hit.
[2024-05-28 00:21:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-28 00:21:10] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-28 00:21:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 00:21:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:21:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-28 00:21:10] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-28 00:21:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 00:21:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:21:10] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-28 00:21:10] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 8 ms.
[2024-05-28 00:21:10] [INFO ] Added : 10 causal constraints over 2 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-28 00:21:10] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:10] [INFO ] Invariant cache hit.
[2024-05-28 00:21:10] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 00:21:10] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:10] [INFO ] Invariant cache hit.
[2024-05-28 00:21:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:21:10] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-28 00:21:10] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:10] [INFO ] Invariant cache hit.
[2024-05-28 00:21:10] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 00:21:10] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 00:21:10] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 00:21:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:21:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 00:21:10] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:21:10] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:21:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 00:21:11] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 00:21:11] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 00:21:11] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 00:21:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 00:21:11] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 00:21:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 71/119 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2337 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 82/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 218 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1629 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 13/13 constraints]
After SMT, in 4000ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4002ms
Finished structural reductions in LTL mode , in 1 iterations and 4151 ms. Remains : 48/48 places, 85/85 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 220 steps (0 resets) in 5 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 00:21:15] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:15] [INFO ] Invariant cache hit.
[2024-05-28 00:21:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-28 00:21:15] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-28 00:21:15] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 00:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:21:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-28 00:21:15] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-28 00:21:15] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 00:21:15] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:21:15] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-28 00:21:15] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 6 ms.
[2024-05-28 00:21:15] [INFO ] Added : 10 causal constraints over 2 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14697 reset in 118 ms.
Product exploration explored 100000 steps with 14654 reset in 119 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-28 00:21:16] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-28 00:21:16] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:16] [INFO ] Invariant cache hit.
[2024-05-28 00:21:16] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:21:16] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 00:21:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:21:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 00:21:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 00:21:17] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 71/119 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2297 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 82/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 218 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1659 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 13/13 constraints]
After SMT, in 3996ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3997ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4018 ms. Remains : 48/48 places, 85/85 transitions.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-28 00:21:20] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:20] [INFO ] Invariant cache hit.
[2024-05-28 00:21:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 00:21:20] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:20] [INFO ] Invariant cache hit.
[2024-05-28 00:21:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 00:21:20] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-28 00:21:20] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-05-28 00:21:20] [INFO ] Invariant cache hit.
[2024-05-28 00:21:20] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 00:21:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 00:21:21] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 00:21:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 00:21:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 00:21:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 00:21:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 71/119 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2270 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 82/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 218 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1645 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 13/13 constraints]
After SMT, in 3948ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3949ms
Finished structural reductions in LTL mode , in 1 iterations and 4104 ms. Remains : 48/48 places, 85/85 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-03 finished in 15904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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(F(p0))||G(p1))))'
[2024-05-28 00:21:24] [INFO ] Flatten gal took : 13 ms
[2024-05-28 00:21:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 00:21:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 82 transitions and 457 arcs took 4 ms.
Total runtime 83377 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SafeBus-PT-03
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 54
TRANSITIONS: 82
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2504
MODEL NAME: /home/mcc/execution/414/model
54 places, 82 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SafeBus-PT-03-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-PT-03-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-PT-03-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-PT-03-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716855686797
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SafeBus-PT-03, 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 r333-tall-171679078400411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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 '
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 ;