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.r334-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 itstools
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 r334-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 1716828430218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 16:47:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 16:47:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 16:47:11] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-27 16:47:11] [INFO ] Transformed 57 places.
[2024-05-27 16:47:11] [INFO ] Transformed 91 transitions.
[2024-05-27 16:47:11] [INFO ] Found NUPN structural information;
[2024-05-27 16:47:11] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 3 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SafeBus-PT-03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-27 16:47:11] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 16:47:11] [INFO ] Computed 17 invariants in 14 ms
[2024-05-27 16:47:11] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-27 16:47:11] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 16:47:11] [INFO ] Invariant cache hit.
[2024-05-27 16:47:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:11] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-27 16:47:11] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 16:47:11] [INFO ] Invariant cache hit.
[2024-05-27 16:47:11] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 10 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-27 16:47:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 10/81 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 16:47:13] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-27 16:47:13] [INFO ] Deduced a trap composed of 15 places in 29 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-05-27 16:47:13] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/84 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 16:47:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 68/122 variables, 54/139 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 152 constraints, problems are : Problem set: 9 solved, 79 unsolved in 2768 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 14/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 16:47:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-27 16:47:15] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-27 16:47:15] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:15] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 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 1919 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 4785ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 4802ms
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 2 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 5141 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 46 out of 54 places after structural reductions.
[2024-05-27 16:47:16] [INFO ] Flatten gal took : 29 ms
[2024-05-27 16:47:16] [INFO ] Flatten gal took : 12 ms
[2024-05-27 16:47:17] [INFO ] Input system was already deterministic with 82 transitions.
RANDOM walk for 40000 steps (8 resets) in 934 ms. (42 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
[2024-05-27 16:47:17] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 16:47:17] [INFO ] Computed 17 invariants in 5 ms
[2024-05-27 16:47:17] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/18 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/29 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/51 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 16:47:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-27 16:47:17] [INFO ] Deduced a trap composed of 15 places in 29 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 147 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/18 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/29 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/51 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 16:47:17] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-27 16:47:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 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 95 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 254ms 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-05-27 16:47:17] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:17] [INFO ] Invariant cache hit.
[2024-05-27 16:47:17] [INFO ] Implicit Places using invariants in 53 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 LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 0 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 57 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 180 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 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(X(F(p1))))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:18] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:18] [INFO ] Invariant cache hit.
[2024-05-27 16:47:18] [INFO ] Implicit Places using invariants in 77 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 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 83 ms. Remains : 51/54 places, 82/82 transitions.
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))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-03
Product exploration explored 100000 steps with 13123 reset in 258 ms.
Product exploration explored 100000 steps with 13153 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 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 176 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 136 steps (0 resets) in 7 ms. (17 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 152 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 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 16:47:19] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 51 cols
[2024-05-27 16:47:19] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 16:47:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 16:47:19] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-27 16:47:19] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-27 16:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 16:47:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 16:47:19] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-27 16:47:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 16:47:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-27 16:47:19] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 5 ms.
[2024-05-27 16:47:19] [INFO ] Added : 13 causal constraints over 3 iterations in 53 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 0 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:19] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:19] [INFO ] Invariant cache hit.
[2024-05-27 16:47:20] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 16:47:20] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:20] [INFO ] Invariant cache hit.
[2024-05-27 16:47:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:20] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-27 16:47:20] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:20] [INFO ] Invariant cache hit.
[2024-05-27 16:47:20] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 23 places in 35 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-05-27 16:47:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-27 16:47:20] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-27 16:47:21] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:21] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:21] [INFO ] Deduced a trap composed of 10 places in 28 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 2447 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 1439 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 3930ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3932ms
Finished structural reductions in LTL mode , in 1 iterations and 4090 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 121 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 194 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 706 steps (0 resets) in 8 ms. (78 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 173 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 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))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 16:47:24] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:24] [INFO ] Invariant cache hit.
[2024-05-27 16:47:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 16:47:25] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-27 16:47:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 16:47:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 16:47:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 16:47:25] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-27 16:47:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 16:47:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-27 16:47:25] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-27 16:47:25] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 4 ms.
[2024-05-27 16:47:25] [INFO ] Added : 32 causal constraints over 8 iterations in 68 ms. Result :sat
Could not prove EG (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))]
Product exploration explored 100000 steps with 13200 reset in 123 ms.
Product exploration explored 100000 steps with 13124 reset in 174 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 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 1 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 21 ms. Remains 51 /51 variables (removed 0) and now considering 91/82 (removed -9) transitions.
[2024-05-27 16:47:26] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-27 16:47:26] [INFO ] Flow matrix only has 77 transitions (discarded 14 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-27 16:47:26] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 16:47:26] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:26] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 10/75 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 77/128 variables, 51/126 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 13/139 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/139 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/139 constraints. Problems are: Problem set: 6 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 139 constraints, problems are : Problem set: 6 solved, 82 unsolved in 1818 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 6 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/52 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/58 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 10/68 constraints. Problems are: Problem set: 6 solved, 82 unsolved
[2024-05-27 16:47:28] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:28] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/70 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/70 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 3/51 variables, 2/72 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 3/75 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 2/77 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/77 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 77/128 variables, 51/128 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 13/141 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 82/223 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/128 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 223 constraints, problems are : Problem set: 6 solved, 82 unsolved in 2002 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 3870ms problems are : Problem set: 6 solved, 82 unsolved
Search for dead transitions found 6 dead transitions in 3871ms
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.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 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 3906 ms. Remains : 48/51 places, 85/82 transitions.
Built C files in :
/tmp/ltsmin17236778406573593756
[2024-05-27 16:47:30] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17236778406573593756
Running compilation step : cd /tmp/ltsmin17236778406573593756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 312 ms.
Running link step : cd /tmp/ltsmin17236778406573593756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17236778406573593756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8193019802105798536.hoa' '--buchi-type=spotba'
LTSmin run took 181 ms.
FORMULA SafeBus-PT-03-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-03-LTLCardinality-03 finished in 12402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1))||F(p2))))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 16:47:30] [INFO ] Computed 17 invariants in 4 ms
[2024-05-27 16:47:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-27 16:47:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:30] [INFO ] Invariant cache hit.
[2024-05-27 16:47:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:30] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-27 16:47:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:30] [INFO ] Invariant cache hit.
[2024-05-27 16:47:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:30] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-27 16:47:31] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/122 variables, 54/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2330 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:33] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-27 16:47:33] [INFO ] Deduced a trap composed of 8 places in 30 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 1781 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 4139ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4140ms
Finished structural reductions in LTL mode , in 1 iterations and 4286 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 188 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 94 ms.
Product exploration explored 100000 steps with 50000 reset in 103 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 21 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 4711 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 6 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:35] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:35] [INFO ] Invariant cache hit.
[2024-05-27 16:47:35] [INFO ] Implicit Places using invariants in 51 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 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 63 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 111 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 231 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-05 finished in 427 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-05-27 16:47:35] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:35] [INFO ] Invariant cache hit.
[2024-05-27 16:47:35] [INFO ] Implicit Places using invariants in 55 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 221 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 9436 reset in 140 ms.
Product exploration explored 100000 steps with 9412 reset in 194 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 p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 9 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-05-27 16:47:36] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 51 cols
[2024-05-27 16:47:36] [INFO ] Computed 14 invariants in 12 ms
[2024-05-27 16:47:36] [INFO ] State equation strengthened by 13 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 17/119 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Domain max(s): 0/51 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/51 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 356 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter insensitive) to 9 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), false, false, false, false]
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), false, false, false, false]
[2024-05-27 16:47:38] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:38] [INFO ] Invariant cache hit.
[2024-05-27 16:47:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 16:47:38] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-27 16:47:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-27 16:47:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 16:47:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-27 16:47:38] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-27 16:47:38] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-27 16:47:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:38] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-27 16:47:38] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 4 ms.
[2024-05-27 16:47:38] [INFO ] Added : 17 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 17 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:38] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:38] [INFO ] Invariant cache hit.
[2024-05-27 16:47:38] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-27 16:47:38] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:38] [INFO ] Invariant cache hit.
[2024-05-27 16:47:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:38] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-27 16:47:38] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 16:47:38] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:38] [INFO ] Invariant cache hit.
[2024-05-27 16:47:38] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:38] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-27 16:47:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-27 16:47:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-27 16:47:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-27 16:47:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-27 16:47:39] [INFO ] Deduced a trap composed of 23 places in 29 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-05-27 16:47:39] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:39] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:39] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-27 16:47:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:39] [INFO ] Deduced a trap composed of 14 places in 36 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-05-27 16:47:39] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:39] [INFO ] Deduced a trap composed of 10 places in 37 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 2382 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 1419 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 3826ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3828ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3969 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 139 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter insensitive) to 9 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-05-27 16:47:42] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:42] [INFO ] Invariant cache hit.
[2024-05-27 16:47:42] [INFO ] State equation strengthened by 13 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 17/119 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Domain max(s): 0/51 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/51 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 18 factoid took 344 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter insensitive) to 9 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), false, false, false, false]
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), false, false, false, false]
[2024-05-27 16:47:43] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:43] [INFO ] Invariant cache hit.
[2024-05-27 16:47:44] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-27 16:47:44] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-27 16:47:44] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-27 16:47:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 16:47:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 16:47:44] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-27 16:47:44] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-27 16:47:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:44] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-27 16:47:44] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 5 ms.
[2024-05-27 16:47:44] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), false, false, false, false]
Product exploration explored 100000 steps with 9470 reset in 148 ms.
Product exploration explored 100000 steps with 9469 reset in 156 ms.
Built C files in :
/tmp/ltsmin17369481886191544192
[2024-05-27 16:47:44] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-27 16:47:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:47:44] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-27 16:47:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:47:44] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-27 16:47:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:47:44] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17369481886191544192
Running compilation step : cd /tmp/ltsmin17369481886191544192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 214 ms.
Running link step : cd /tmp/ltsmin17369481886191544192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17369481886191544192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10194194125935384878.hoa' '--buchi-type=spotba'
LTSmin run took 386 ms.
FORMULA SafeBus-PT-03-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-03-LTLCardinality-06 finished in 9795 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 10 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 16:47:45] [INFO ] Computed 17 invariants in 2 ms
[2024-05-27 16:47:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-27 16:47:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:45] [INFO ] Invariant cache hit.
[2024-05-27 16:47:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:45] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-27 16:47:45] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 16:47:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:45] [INFO ] Invariant cache hit.
[2024-05-27 16:47:45] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-27 16:47:46] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-27 16:47:46] [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 2393 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:48] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-27 16:47:48] [INFO ] Deduced a trap composed of 8 places in 27 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 1737 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 4168ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4324 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 86 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 5155 reset in 134 ms.
Product exploration explored 100000 steps with 5089 reset in 147 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 163 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 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 57 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 239 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 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 7 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:51] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:51] [INFO ] Invariant cache hit.
[2024-05-27 16:47:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-27 16:47:51] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:51] [INFO ] Invariant cache hit.
[2024-05-27 16:47:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:51] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-27 16:47:51] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 16:47:51] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:51] [INFO ] Invariant cache hit.
[2024-05-27 16:47:51] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:51] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:47:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-27 16:47:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-27 16:47:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-27 16:47:52] [INFO ] Deduced a trap composed of 7 places in 33 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 2401 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:53] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-27 16:47:53] [INFO ] Deduced a trap composed of 8 places in 28 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 1764 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 4191ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4193ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4347 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 315 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 48 steps (0 resets) in 8 ms. (5 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 246 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5096 reset in 134 ms.
Product exploration explored 100000 steps with 5147 reset in 144 ms.
Built C files in :
/tmp/ltsmin5886756451422869979
[2024-05-27 16:47:56] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-27 16:47:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:47:56] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-27 16:47:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:47:56] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-27 16:47:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:47:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5886756451422869979
Running compilation step : cd /tmp/ltsmin5886756451422869979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin5886756451422869979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5886756451422869979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16490629626745365245.hoa' '--buchi-type=spotba'
LTSmin run took 321 ms.
FORMULA SafeBus-PT-03-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-03-LTLCardinality-07 finished in 11654 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:57] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:57] [INFO ] Invariant cache hit.
[2024-05-27 16:47:57] [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 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 65 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 216 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 121 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 119 in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-08 finished in 419 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 7 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:57] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:57] [INFO ] Invariant cache hit.
[2024-05-27 16:47:57] [INFO ] Implicit Places using invariants in 65 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 82
Applied a total of 12 rules in 10 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:57] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2024-05-27 16:47:57] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 16:47:57] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-27 16:47:57] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:57] [INFO ] Invariant cache hit.
[2024-05-27 16:47:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:57] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 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 215 ms. Remains : 45/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-11
Product exploration explored 100000 steps with 7123 reset in 112 ms.
Product exploration explored 100000 steps with 7093 reset in 115 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 74 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 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 4 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:47:58] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:58] [INFO ] Invariant cache hit.
[2024-05-27 16:47:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-27 16:47:58] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:58] [INFO ] Invariant cache hit.
[2024-05-27 16:47:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:47:58] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-27 16:47:58] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 16:47:58] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:47:58] [INFO ] Invariant cache hit.
[2024-05-27 16:47:58] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:47:58] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-27 16:47:58] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-27 16:47:58] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-27 16:47:58] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 11 places in 24 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-05-27 16:47:59] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-27 16:47:59] [INFO ] Deduced a trap composed of 7 places in 30 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 2114 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 1511 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 3660ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3661ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3803 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 73 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 27 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7119 reset in 109 ms.
Product exploration explored 100000 steps with 7095 reset in 111 ms.
Built C files in :
/tmp/ltsmin2698234736822668275
[2024-05-27 16:48:02] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-27 16:48:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:48:02] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-27 16:48:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:48:02] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-27 16:48:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:48:02] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2698234736822668275
Running compilation step : cd /tmp/ltsmin2698234736822668275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin2698234736822668275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2698234736822668275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1682072693864183112.hoa' '--buchi-type=spotba'
LTSmin run took 317 ms.
FORMULA SafeBus-PT-03-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-03-LTLCardinality-11 finished in 5973 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 4 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:48:03] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 16:48:03] [INFO ] Computed 17 invariants in 6 ms
[2024-05-27 16:48:03] [INFO ] Implicit Places using invariants in 67 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 51 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 47 transition count 82
Applied a total of 8 rules in 6 ms. Remains 47 /51 variables (removed 4) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:48:03] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 47 cols
[2024-05-27 16:48:03] [INFO ] Computed 14 invariants in 5 ms
[2024-05-27 16:48:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-27 16:48:03] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:48:03] [INFO ] Invariant cache hit.
[2024-05-27 16:48:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:48:03] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 131 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 208 ms. Remains : 47/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-13
Product exploration explored 100000 steps with 1372 reset in 123 ms.
Product exploration explored 100000 steps with 1387 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 : [(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 238 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 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 264 steps (0 resets) in 11 ms. (22 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 399 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))]
Stuttering acceptance computed with spot in 66 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 5 ms. Remains 47 /47 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:48:04] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:48:04] [INFO ] Invariant cache hit.
[2024-05-27 16:48:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-27 16:48:05] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:48:05] [INFO ] Invariant cache hit.
[2024-05-27 16:48:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 16:48:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-27 16:48:05] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 16:48:05] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 16:48:05] [INFO ] Invariant cache hit.
[2024-05-27 16:48:05] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2024-05-27 16:48:05] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 16:48:06] [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 2157 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 1564 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 3750ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3753ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3889 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 249 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 221 steps (0 resets) in 8 ms. (24 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 331 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1364 reset in 131 ms.
Product exploration explored 100000 steps with 1281 reset in 139 ms.
Built C files in :
/tmp/ltsmin13155696054089727298
[2024-05-27 16:48:10] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-27 16:48:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:48:10] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-27 16:48:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:48:10] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-27 16:48:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:48:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13155696054089727298
Running compilation step : cd /tmp/ltsmin13155696054089727298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin13155696054089727298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13155696054089727298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased172444148922490677.hoa' '--buchi-type=spotba'
LTSmin run took 472 ms.
FORMULA SafeBus-PT-03-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-03-LTLCardinality-13 finished in 7205 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 16:48:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 16:48:10] [INFO ] Computed 17 invariants in 1 ms
[2024-05-27 16:48:10] [INFO ] Implicit Places using invariants in 63 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 147 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 14 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-15 finished in 225 ms.
All properties solved by simple procedures.
Total runtime 59678 ms.

BK_STOP 1716828491051

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is 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 r334-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 ;