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.r524-tall-171679080300411.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 ltsminxred
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 r524-tall-171679080300411
=====================================================================

--------------------
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 1717225706247

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:08:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:08:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:08:27] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 07:08:27] [INFO ] Transformed 57 places.
[2024-06-01 07:08:27] [INFO ] Transformed 91 transitions.
[2024-06-01 07:08:27] [INFO ] Found NUPN structural information;
[2024-06-01 07:08:27] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 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 7 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 07:08:27] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 07:08:27] [INFO ] Computed 17 invariants in 12 ms
[2024-06-01 07:08:27] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 07:08:27] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 07:08:27] [INFO ] Invariant cache hit.
[2024-06-01 07:08:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:08:27] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-01 07:08:28] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 07:08:28] [INFO ] Invariant cache hit.
[2024-06-01 07:08:28] [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-06-01 07:08:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 8 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 15 places in 29 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-06-01 07:08:29] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/83 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 15 places in 37 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-06-01 07:08:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 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 2702 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-06-01 07:08:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 7 places in 26 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 1901 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 4705ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 4719ms
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 5043 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 46 out of 54 places after structural reductions.
[2024-06-01 07:08:32] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:08:32] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:08:32] [INFO ] Input system was already deterministic with 82 transitions.
RANDOM walk for 40000 steps (8 resets) in 589 ms. (67 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
[2024-06-01 07:08:33] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 07:08:33] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 07:08:33] [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-06-01 07:08:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 15 places in 38 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 165 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-06-01 07:08:33] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 2 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 98 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 272ms 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 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:08:33] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:33] [INFO ] Invariant cache hit.
[2024-06-01 07:08:33] [INFO ] Implicit Places using invariants in 53 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 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 59 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 186 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 2 ms.
FORMULA SafeBus-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-00 finished in 293 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 8 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:08:34] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:34] [INFO ] Invariant cache hit.
[2024-06-01 07:08:34] [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 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 67 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 267 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 13163 reset in 300 ms.
Product exploration explored 100000 steps with 13116 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 82 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 178 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 37 steps (0 resets) in 8 ms. (4 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 159 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))]
Stuttering acceptance computed with spot in 186 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-06-01 07:08:35] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 51 cols
[2024-06-01 07:08:35] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:08:35] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 07:08:35] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-06-01 07:08:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 07:08:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:08:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 07:08:35] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-06-01 07:08:35] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 07:08:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:08:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:08:35] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 5 ms.
[2024-06-01 07:08:35] [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-06-01 07:08:35] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:35] [INFO ] Invariant cache hit.
[2024-06-01 07:08:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 07:08:35] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:35] [INFO ] Invariant cache hit.
[2024-06-01 07:08:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:08:36] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-06-01 07:08:36] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:36] [INFO ] Invariant cache hit.
[2024-06-01 07:08:36] [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-06-01 07:08:36] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 24 places in 35 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-06-01 07:08:37] [INFO ] Deduced a trap composed of 10 places in 39 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 2310 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 1380 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 3718ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3719ms
Finished structural reductions in LTL mode , in 1 iterations and 3868 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 94 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 192 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 36 steps (0 resets) in 5 ms. (6 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 179 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 209 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-06-01 07:08:40] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:40] [INFO ] Invariant cache hit.
[2024-06-01 07:08:40] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 07:08:40] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-06-01 07:08:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 07:08:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:08:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 07:08:40] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-06-01 07:08:40] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 07:08:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:08:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-06-01 07:08:40] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 4 ms.
[2024-06-01 07:08:40] [INFO ] Added : 32 causal constraints over 8 iterations in 57 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 177 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 13138 reset in 106 ms.
Product exploration explored 100000 steps with 13162 reset in 164 ms.
Applying partial POR strategy [true, false, false, false, false]
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))]
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-06-01 07:08:41] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 07:08:41] [INFO ] Flow matrix only has 77 transitions (discarded 14 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-06-01 07:08:41] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 07:08:41] [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-06-01 07:08:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [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-06-01 07:08:42] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 5 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 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 1740 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-06-01 07:08:43] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 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 2059 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 3845ms problems are : Problem set: 6 solved, 82 unsolved
Search for dead transitions found 6 dead transitions in 3847ms
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.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 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 3887 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-06-01 07:08:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 51 cols
[2024-06-01 07:08:45] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:08:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 07:08:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:45] [INFO ] Invariant cache hit.
[2024-06-01 07:08:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:08:45] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-06-01 07:08:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:45] [INFO ] Invariant cache hit.
[2024-06-01 07:08:45] [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-06-01 07:08:45] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 24 places in 33 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-06-01 07:08:46] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 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 2412 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 1444 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 3891ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3893ms
Finished structural reductions in LTL mode , in 1 iterations and 4026 ms. Remains : 51/51 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-03 finished in 15617 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-06-01 07:08:49] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 07:08:49] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 07:08:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 07:08:49] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:49] [INFO ] Invariant cache hit.
[2024-06-01 07:08:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:08:49] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-06-01 07:08:49] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:49] [INFO ] Invariant cache hit.
[2024-06-01 07:08:49] [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-06-01 07:08:50] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 23 places in 30 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-06-01 07:08:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 14 places in 24 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-06-01 07:08:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 7 places in 27 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 2356 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-06-01 07:08:52] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 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 1732 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 4114ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4115ms
Finished structural reductions in LTL mode , in 1 iterations and 4266 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 173 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 88 ms.
Product exploration explored 100000 steps with 50000 reset in 92 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 127 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 4762 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 8 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:08:54] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:54] [INFO ] Invariant cache hit.
[2024-06-01 07:08:54] [INFO ] Implicit Places using invariants in 48 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 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 60 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 76 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 217 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-05 finished in 378 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 6 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:08:54] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:54] [INFO ] Invariant cache hit.
[2024-06-01 07:08:54] [INFO ] Implicit Places using invariants in 56 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 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 66 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 217 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 9418 reset in 138 ms.
Stack based approach found an accepted trace after 64303 steps with 6030 reset with depth 23 and stack size 23 in 138 ms.
FORMULA SafeBus-PT-03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-06 finished in 588 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-06-01 07:08:55] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:55] [INFO ] Invariant cache hit.
[2024-06-01 07:08:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 07:08:55] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:55] [INFO ] Invariant cache hit.
[2024-06-01 07:08:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:08:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-06-01 07:08:55] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-01 07:08:55] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:08:55] [INFO ] Invariant cache hit.
[2024-06-01 07:08:55] [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-06-01 07:08:55] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 23 places in 26 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-06-01 07:08:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:08:56] [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-06-01 07:08:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:08:56] [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 2428 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-06-01 07:08:58] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 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 1745 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 4200ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4346 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 72 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 5079 reset in 168 ms.
Product exploration explored 100000 steps with 5135 reset in 159 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 154 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 59 steps (0 resets) in 5 ms. (9 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 279 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 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 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 10 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:09:00] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:00] [INFO ] Invariant cache hit.
[2024-06-01 07:09:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 07:09:00] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:00] [INFO ] Invariant cache hit.
[2024-06-01 07:09:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:00] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-06-01 07:09:00] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-01 07:09:00] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:00] [INFO ] Invariant cache hit.
[2024-06-01 07:09:00] [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-06-01 07:09:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 23 places in 24 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-06-01 07:09:01] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 14 places in 32 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-06-01 07:09:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 7 places in 33 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 2398 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-06-01 07:09:03] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 8 places in 28 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 1752 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 4176ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4329 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 148 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))]
RANDOM walk for 52 steps (0 resets) in 7 ms. (6 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 259 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 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 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 5165 reset in 131 ms.
Product exploration explored 100000 steps with 5057 reset in 133 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-06-01 07:09:06] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:06] [INFO ] Invariant cache hit.
[2024-06-01 07:09:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 07:09:06] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:06] [INFO ] Invariant cache hit.
[2024-06-01 07:09:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-01 07:09:06] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-01 07:09:06] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:06] [INFO ] Invariant cache hit.
[2024-06-01 07:09:06] [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-06-01 07:09:06] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 23 places in 30 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-06-01 07:09:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 14 places in 37 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-06-01 07:09:07] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 7 places in 37 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 2354 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-06-01 07:09:08] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 8 places in 25 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 1774 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 4153ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4154ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4306 ms. Remains : 54/54 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-07 finished in 15162 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-06-01 07:09:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:10] [INFO ] Invariant cache hit.
[2024-06-01 07:09:10] [INFO ] Implicit Places using invariants in 56 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 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 61 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 191 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 117 ms.
Stack based approach found an accepted trace after 144 steps with 0 reset with depth 145 and stack size 145 in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-08 finished in 386 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-06-01 07:09:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:10] [INFO ] Invariant cache hit.
[2024-06-01 07:09:11] [INFO ] Implicit Places using invariants in 61 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 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 1 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 9 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:09:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2024-06-01 07:09:11] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:09:11] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 07:09:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:11] [INFO ] Invariant cache hit.
[2024-06-01 07:09:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:11] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 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 214 ms. Remains : 45/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-11
Product exploration explored 100000 steps with 7087 reset in 106 ms.
Product exploration explored 100000 steps with 7125 reset in 128 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 88 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30 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 78 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 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 7 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:09:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:11] [INFO ] Invariant cache hit.
[2024-06-01 07:09:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 07:09:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:11] [INFO ] Invariant cache hit.
[2024-06-01 07:09:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-01 07:09:12] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-01 07:09:12] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:12] [INFO ] Invariant cache hit.
[2024-06-01 07:09:12] [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-06-01 07:09:12] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 7 places in 36 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 2061 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 1476 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 3575ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3576ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3725 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 78 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)]
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 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 105 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7107 reset in 108 ms.
Product exploration explored 100000 steps with 7090 reset in 111 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-06-01 07:09:16] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:16] [INFO ] Invariant cache hit.
[2024-06-01 07:09:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 07:09:16] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:16] [INFO ] Invariant cache hit.
[2024-06-01 07:09:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-01 07:09:16] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-01 07:09:16] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:16] [INFO ] Invariant cache hit.
[2024-06-01 07:09:16] [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-06-01 07:09:16] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 7 places in 31 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 2062 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 1526 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 3619ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3621ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3769 ms. Remains : 45/45 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-11 finished in 9199 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-06-01 07:09:20] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 07:09:20] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants in 60 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 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-06-01 07:09:20] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 47 cols
[2024-06-01 07:09:20] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 07:09:20] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:20] [INFO ] Invariant cache hit.
[2024-06-01 07:09:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 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 216 ms. Remains : 47/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 74 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 1333 reset in 120 ms.
Product exploration explored 100000 steps with 1319 reset in 122 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 250 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 109 steps (0 resets) in 7 ms. (13 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 301 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 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 10 ms. Remains 47 /47 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:09:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:21] [INFO ] Invariant cache hit.
[2024-06-01 07:09:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 07:09:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:21] [INFO ] Invariant cache hit.
[2024-06-01 07:09:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:21] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-06-01 07:09:21] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-01 07:09:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:21] [INFO ] Invariant cache hit.
[2024-06-01 07:09:21] [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-06-01 07:09:21] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [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-06-01 07:09:22] [INFO ] Deduced a trap composed of 11 places in 31 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 2188 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 1497 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 3714ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3715ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3865 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 254 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))]
RANDOM walk for 326 steps (0 resets) in 11 ms. (27 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 344 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 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1343 reset in 126 ms.
Product exploration explored 100000 steps with 1432 reset in 135 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 9 ms. Remains 47 /47 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:09:26] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:26] [INFO ] Invariant cache hit.
[2024-06-01 07:09:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 07:09:26] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:26] [INFO ] Invariant cache hit.
[2024-06-01 07:09:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:26] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-01 07:09:26] [INFO ] Redundant transitions in 3 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-01 07:09:26] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:26] [INFO ] Invariant cache hit.
[2024-06-01 07:09:26] [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-06-01 07:09:26] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:26] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:09:27] [INFO ] Deduced a trap composed of 7 places in 31 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-06-01 07:09:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 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 2095 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 1535 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 3660ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3662ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3828 ms. Remains : 47/47 places, 82/82 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-13 finished in 10270 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-06-01 07:09:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 07:09:30] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 07:09:30] [INFO ] Implicit Places using invariants in 53 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 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 56 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 123 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 61 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-15 finished in 295 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 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))]
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 5 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:09:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 07:09:30] [INFO ] Invariant cache hit.
[2024-06-01 07:09:31] [INFO ] Implicit Places using invariants in 60 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 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-06-01 07:09:31] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2024-06-01 07:09:31] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:09:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 07:09:31] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:31] [INFO ] Invariant cache hit.
[2024-06-01 07:09:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 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 200 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 14654 reset in 144 ms.
Product exploration explored 100000 steps with 14700 reset in 157 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 78 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 168 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 46 steps (0 resets) in 4 ms. (9 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 134 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 188 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 193 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-06-01 07:09:32] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:32] [INFO ] Invariant cache hit.
[2024-06-01 07:09:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 07:09:32] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-01 07:09:32] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 07:09:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:09:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 07:09:32] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-06-01 07:09:32] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 07:09:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2024-06-01 07:09:32] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 5 ms.
[2024-06-01 07:09:32] [INFO ] Added : 10 causal constraints over 2 iterations in 36 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-06-01 07:09:32] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:32] [INFO ] Invariant cache hit.
[2024-06-01 07:09:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 07:09:32] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:32] [INFO ] Invariant cache hit.
[2024-06-01 07:09:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:32] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-06-01 07:09:32] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:32] [INFO ] Invariant cache hit.
[2024-06-01 07:09:32] [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-06-01 07:09:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [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-06-01 07:09:33] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 10 places in 24 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 2243 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 1638 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 3915ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3916ms
Finished structural reductions in LTL mode , in 1 iterations and 4052 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 89 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 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))]
RANDOM walk for 205 steps (0 resets) in 6 ms. (29 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 163 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 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))]
[2024-06-01 07:09:37] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:37] [INFO ] Invariant cache hit.
[2024-06-01 07:09:37] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 07:09:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-01 07:09:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 07:09:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:09:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 07:09:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-06-01 07:09:37] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 07:09:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-06-01 07:09:37] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 5 ms.
[2024-06-01 07:09:37] [INFO ] Added : 10 causal constraints over 2 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 178 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 14757 reset in 133 ms.
Product exploration explored 100000 steps with 14721 reset in 163 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 192 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 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 07:09:38] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-06-01 07:09:38] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:38] [INFO ] Invariant cache hit.
[2024-06-01 07:09:38] [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-06-01 07:09:38] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 10 places in 28 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 2222 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 1578 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 3834ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3835ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3849 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 6 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 07:09:42] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:42] [INFO ] Invariant cache hit.
[2024-06-01 07:09:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 07:09:42] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:42] [INFO ] Invariant cache hit.
[2024-06-01 07:09:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:09:42] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-06-01 07:09:42] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2024-06-01 07:09:42] [INFO ] Invariant cache hit.
[2024-06-01 07:09:42] [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-06-01 07:09:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 22 places in 26 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-06-01 07:09:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 10 places in 32 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 2281 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 1505 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 3815ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3816ms
Finished structural reductions in LTL mode , in 1 iterations and 3959 ms. Remains : 48/48 places, 85/85 transitions.
Treatment of property SafeBus-PT-03-LTLCardinality-03 finished in 15408 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-06-01 07:09:46] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:09:46] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 07:09:46] [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 79078 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SafeBus-PT-03-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-PT-03-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-PT-03-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-PT-03-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225786945

--------------------
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
mcc2024
ltl formula name SafeBus-PT-03-LTLCardinality-03
ltl formula formula --ltl=/tmp/2471/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 82 transitions and 457 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2471/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2471/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2471/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2471/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 56 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 87 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~22!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 260
pnml2lts-mc( 0/ 4): unique states count: 339
pnml2lts-mc( 0/ 4): unique transitions count: 526
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 85
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 365
pnml2lts-mc( 0/ 4): - cum. max stack depth: 95
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 365 states 606 transitions, fanout: 1.660
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 23.9 B/state, compr.: 10.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 82 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-03-LTLCardinality-07
ltl formula formula --ltl=/tmp/2471/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 82 transitions and 457 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2471/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2471/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2471/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2471/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 103 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1648
pnml2lts-mc( 0/ 4): unique states count: 6297
pnml2lts-mc( 0/ 4): unique transitions count: 16821
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2345
pnml2lts-mc( 0/ 4): - claim found count: 8369
pnml2lts-mc( 0/ 4): - claim success count: 6434
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1832
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6543 states 17603 transitions, fanout: 2.690
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 130860, Transitions per second: 352060
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 13.8 B/state, compr.: 6.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 82 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-03-LTLCardinality-11
ltl formula formula --ltl=/tmp/2471/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 82 transitions and 457 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2471/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2471/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2471/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2471/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 56 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 85 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1729
pnml2lts-mc( 0/ 4): unique states count: 6378
pnml2lts-mc( 0/ 4): unique transitions count: 18072
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3539
pnml2lts-mc( 0/ 4): - claim found count: 8421
pnml2lts-mc( 0/ 4): - claim success count: 6520
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6695 states 19207 transitions, fanout: 2.869
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 167375, Transitions per second: 480175
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 13.5 B/state, compr.: 6.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 82 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-03-LTLCardinality-13
ltl formula formula --ltl=/tmp/2471/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 82 transitions and 457 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2471/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2471/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2471/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2471/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 115 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2594
pnml2lts-mc( 0/ 4): unique states count: 7942
pnml2lts-mc( 0/ 4): unique transitions count: 21408
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3849
pnml2lts-mc( 0/ 4): - claim found count: 10096
pnml2lts-mc( 0/ 4): - claim success count: 8270
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1917
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8569 states 23571 transitions, fanout: 2.751
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 171380, Transitions per second: 471420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 13.0 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 82 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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="ltsminxred"
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 ltsminxred"
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 r524-tall-171679080300411"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;