Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692200212.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BridgeAndVehicles-PT-V20P20N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692200212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 14K Feb 25 12:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 158K Feb 25 12:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 12:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 88K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 276K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 12:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K Feb 25 12:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 457K Feb 25 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 790K Mar 5 18:22 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 BridgeAndVehicles-PT-V20P20N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678484590131

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:43:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 21:43:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:43:11] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-10 21:43:11] [INFO ] Transformed 78 places.
[2023-03-10 21:43:11] [INFO ] Transformed 968 transitions.
[2023-03-10 21:43:11] [INFO ] Parsed PT model containing 78 places and 968 transitions and 7350 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 968
Applied a total of 2 rules in 27 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:12] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-10 21:43:12] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-10 21:43:12] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
[2023-03-10 21:43:12] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:12] [INFO ] Invariant cache hit.
[2023-03-10 21:43:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 21:43:12] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:12] [INFO ] Invariant cache hit.
[2023-03-10 21:43:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:12] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-10 21:43:12] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:12] [INFO ] Invariant cache hit.
[2023-03-10 21:43:13] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/78 places, 968/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1273 ms. Remains : 76/78 places, 968/968 transitions.
Support contains 75 out of 76 places after structural reductions.
[2023-03-10 21:43:13] [INFO ] Flatten gal took : 207 ms
[2023-03-10 21:43:14] [INFO ] Flatten gal took : 103 ms
[2023-03-10 21:43:14] [INFO ] Input system was already deterministic with 968 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:43:14] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:14] [INFO ] Invariant cache hit.
[2023-03-10 21:43:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 21:43:15] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-10 21:43:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:43:15] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-10 21:43:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:15] [INFO ] After 27ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-10 21:43:15] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-10 21:43:15] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 73 transition count 966
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 71 transition count 964
Applied a total of 9 rules in 140 ms. Remains 71 /76 variables (removed 5) and now considering 964/968 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 71/76 places, 964/968 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 697508 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 697508 steps, saw 192458 distinct states, run finished after 3002 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:43:18] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2023-03-10 21:43:18] [INFO ] Computed 4 place invariants in 24 ms
[2023-03-10 21:43:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:18] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:43:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 21:43:18] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:43:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:18] [INFO ] After 16ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:43:18] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-10 21:43:19] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 964/964 transitions.
Applied a total of 0 rules in 59 ms. Remains 71 /71 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 71/71 places, 964/964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 964/964 transitions.
Applied a total of 0 rules in 55 ms. Remains 71 /71 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2023-03-10 21:43:19] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-10 21:43:19] [INFO ] Invariant cache hit.
[2023-03-10 21:43:19] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-10 21:43:19] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-10 21:43:19] [INFO ] Invariant cache hit.
[2023-03-10 21:43:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:19] [INFO ] Implicit Places using invariants and state equation in 423 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 689 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/71 places, 964/964 transitions.
Applied a total of 0 rules in 46 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 790 ms. Remains : 69/71 places, 964/964 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 692848 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 692848 steps, saw 191213 distinct states, run finished after 3002 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:43:22] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 69 cols
[2023-03-10 21:43:22] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-10 21:43:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:23] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:43:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:23] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:43:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:23] [INFO ] After 40ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:43:23] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-10 21:43:23] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 964/964 transitions.
Applied a total of 0 rules in 35 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 69/69 places, 964/964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 964/964 transitions.
Applied a total of 0 rules in 34 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2023-03-10 21:43:23] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-10 21:43:23] [INFO ] Invariant cache hit.
[2023-03-10 21:43:23] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-10 21:43:23] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-10 21:43:23] [INFO ] Invariant cache hit.
[2023-03-10 21:43:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:23] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-10 21:43:24] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-10 21:43:24] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-10 21:43:24] [INFO ] Invariant cache hit.
[2023-03-10 21:43:24] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 952 ms. Remains : 69/69 places, 964/964 transitions.
Ensure Unique test removed 798 transitions
Reduce isomorphic transitions removed 798 transitions.
Iterating post reduction 0 with 798 rules applied. Total rules applied 798 place count 69 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 800 place count 69 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 802 place count 67 transition count 164
Applied a total of 802 rules in 8 ms. Remains 67 /69 variables (removed 2) and now considering 164/964 (removed 800) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 164 rows 67 cols
[2023-03-10 21:43:24] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 21:43:24] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2023-03-10 21:43:24] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:43:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:24] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:43:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 21:43:24] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:43:24] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-10 21:43:24] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 49 stabilizing places and 84 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F((p0&&X(p1)))&&X((X(p0) U ((!p2&&X(p0))||X(G(p0))))))))))'
Support contains 45 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:25] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-10 21:43:25] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 21:43:25] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
[2023-03-10 21:43:25] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:25] [INFO ] Invariant cache hit.
[2023-03-10 21:43:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 21:43:25] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:25] [INFO ] Invariant cache hit.
[2023-03-10 21:43:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:25] [INFO ] Implicit Places using invariants and state equation in 306 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 390 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 968/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 778 ms. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 748 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LT s22 1), p1:(LT s49 1), p2:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s31 1) (GEQ s56 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s32 1) (GEQ s70 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 finished in 1638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 45 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 24 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:26] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-10 21:43:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:43:27] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2023-03-10 21:43:27] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:27] [INFO ] Invariant cache hit.
[2023-03-10 21:43:27] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-10 21:43:27] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:27] [INFO ] Invariant cache hit.
[2023-03-10 21:43:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:27] [INFO ] Implicit Places using invariants and state equation in 391 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 589 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 967/968 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1019 ms. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (OR (LT s48 1) (LT s72 1)) (OR (LT s47 1) (LT s72 1))) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s31 1) (GEQ s55 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 566 ms.
Product exploration explored 100000 steps with 50000 reset in 565 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-01 finished in 2437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U ((p1 U X(p2)) U X(p1)))))))'
Support contains 67 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 6 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:29] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:29] [INFO ] Invariant cache hit.
[2023-03-10 21:43:29] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
[2023-03-10 21:43:29] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:29] [INFO ] Invariant cache hit.
[2023-03-10 21:43:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-10 21:43:29] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:29] [INFO ] Invariant cache hit.
[2023-03-10 21:43:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:29] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 226 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 582 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 590 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), false, false, true, (NOT p0), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 12}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 9}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=12 dest: 10}]], initial=0, aps=[p1:(OR (AND (GEQ s23 20) (GEQ s51 1)) (AND (GEQ s23 20) (GEQ s50 1))), p0:(OR (AND (GEQ s23 1) (GEQ s25 1) (GEQ s43 1) (GEQ s47 1)) (AND (GEQ s23 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((X(p1)||(p1 U G(p2)))))))'
Support contains 48 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 8 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:30] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:30] [INFO ] Invariant cache hit.
[2023-03-10 21:43:30] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
[2023-03-10 21:43:30] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:30] [INFO ] Invariant cache hit.
[2023-03-10 21:43:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 21:43:30] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:30] [INFO ] Invariant cache hit.
[2023-03-10 21:43:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:31] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 328 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 711 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) p1), false]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={1} source=1 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(OR p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=9 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND p2 p1 p0), acceptance={1} source=9 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=9 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (AND (GEQ s23 1) (GEQ s25 1) (GEQ s43 1) (GEQ s47 1)) (AND (GEQ s23 1) (GEQ s25 1) (GEQ s36 1) (GEQ s47 1)) (AND (GEQ s23 1) (GEQ s25 1) (GEQ s41 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-03 finished in 1229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!p1)&&p0))))'
Support contains 25 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 9 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:31] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:31] [INFO ] Invariant cache hit.
[2023-03-10 21:43:31] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
[2023-03-10 21:43:31] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:31] [INFO ] Invariant cache hit.
[2023-03-10 21:43:32] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-10 21:43:32] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:32] [INFO ] Invariant cache hit.
[2023-03-10 21:43:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:32] [INFO ] Implicit Places using invariants and state equation in 344 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 478 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 853 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s23 1) (LT s25 1) (LT s43 1) (LT s47 1)) (OR (LT s23 1) (LT s25 1) (LT s36 1) (LT s47 1)) (OR (LT s23 1) (LT s25 1) (LT s41 1) (LT s47 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 108 steps with 1 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-05 finished in 1042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 106 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:32] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-10 21:43:32] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 21:43:33] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
[2023-03-10 21:43:33] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:33] [INFO ] Invariant cache hit.
[2023-03-10 21:43:33] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-10 21:43:33] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:33] [INFO ] Invariant cache hit.
[2023-03-10 21:43:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:33] [INFO ] Implicit Places using invariants and state equation in 349 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 504 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/76 places, 967/968 transitions.
Applied a total of 0 rules in 92 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1062 ms. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 63 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 finished in 1146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 12 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:33] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-10 21:43:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:43:34] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
[2023-03-10 21:43:34] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:34] [INFO ] Invariant cache hit.
[2023-03-10 21:43:34] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 21:43:34] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:34] [INFO ] Invariant cache hit.
[2023-03-10 21:43:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:34] [INFO ] Implicit Places using invariants and state equation in 377 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 553 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 967/968 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 910 ms. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s48 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-08 finished in 1041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!p0)&&F(p1))||X(G(!p0)))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:34] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-10 21:43:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:43:35] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
[2023-03-10 21:43:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:35] [INFO ] Invariant cache hit.
[2023-03-10 21:43:35] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-10 21:43:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:35] [INFO ] Invariant cache hit.
[2023-03-10 21:43:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:35] [INFO ] Implicit Places using invariants and state equation in 486 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 639 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 968/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 969 ms. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 289 ms :[p0, p0, p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s15 1)), p0:(LT s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 165 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-09 finished in 1280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 73 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-10 21:43:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:43:36] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
[2023-03-10 21:43:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:36] [INFO ] Invariant cache hit.
[2023-03-10 21:43:36] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-10 21:43:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:36] [INFO ] Invariant cache hit.
[2023-03-10 21:43:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:37] [INFO ] Implicit Places using invariants and state equation in 372 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 544 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 75 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1078 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s25 1) (GEQ s41 1) (GEQ s47 1)), p1:(OR (LT s49 1) (LT s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 166 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-10 finished in 1237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(!p1||X(!p0)))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 50 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-10 21:43:37] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 21:43:37] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
[2023-03-10 21:43:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:37] [INFO ] Invariant cache hit.
[2023-03-10 21:43:37] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-10 21:43:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:37] [INFO ] Invariant cache hit.
[2023-03-10 21:43:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:38] [INFO ] Implicit Places using invariants and state equation in 371 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 526 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/76 places, 968/968 transitions.
Applied a total of 0 rules in 60 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1021 ms. Remains : 75/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s22 1) (LT s24 1) (LT s25 1)), p1:(LT s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 667 reset in 369 ms.
Product exploration explored 100000 steps with 657 reset in 416 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/75 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
[2023-03-10 21:43:40] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 75 cols
[2023-03-10 21:43:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:43:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:43:40] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 21:43:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:43:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:43:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-10 21:43:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 220 ms returned sat
[2023-03-10 21:43:40] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 89 ms.
[2023-03-10 21:43:40] [INFO ] Added : 16 causal constraints over 4 iterations in 168 ms. Result :sat
Could not prove EG p1
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 968/968 transitions.
Applied a total of 0 rules in 46 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:40] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:41] [INFO ] Invariant cache hit.
[2023-03-10 21:43:41] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
[2023-03-10 21:43:41] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:41] [INFO ] Invariant cache hit.
[2023-03-10 21:43:41] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-10 21:43:41] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:41] [INFO ] Invariant cache hit.
[2023-03-10 21:43:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:41] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-10 21:43:42] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-10 21:43:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:42] [INFO ] Invariant cache hit.
[2023-03-10 21:43:42] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1431 ms. Remains : 75/75 places, 968/968 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/75 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
[2023-03-10 21:43:43] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:43] [INFO ] Invariant cache hit.
[2023-03-10 21:43:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:43:43] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-10 21:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:43:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:43:43] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-10 21:43:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 95 ms returned sat
[2023-03-10 21:43:43] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 49 ms.
[2023-03-10 21:43:43] [INFO ] Added : 19 causal constraints over 6 iterations in 151 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Product exploration explored 100000 steps with 666 reset in 378 ms.
Product exploration explored 100000 steps with 652 reset in 400 ms.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 968/968 transitions.
Applied a total of 0 rules in 43 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:44] [INFO ] Invariant cache hit.
[2023-03-10 21:43:45] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
[2023-03-10 21:43:45] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:45] [INFO ] Invariant cache hit.
[2023-03-10 21:43:45] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-10 21:43:45] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:45] [INFO ] Invariant cache hit.
[2023-03-10 21:43:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:45] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-10 21:43:45] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 21:43:45] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:45] [INFO ] Invariant cache hit.
[2023-03-10 21:43:45] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1146 ms. Remains : 75/75 places, 968/968 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 finished in 8910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(p1)))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:46] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-10 21:43:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:43:46] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
[2023-03-10 21:43:46] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:46] [INFO ] Invariant cache hit.
[2023-03-10 21:43:46] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-10 21:43:46] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:46] [INFO ] Invariant cache hit.
[2023-03-10 21:43:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:46] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 415 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 968/968 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 792 ms. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(OR (LT s1 1) (LT s24 1) (LT s43 1) (LT s69 1)), p0:(LT s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 328 ms.
Product exploration explored 100000 steps with 25000 reset in 333 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/74 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:43:48] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2023-03-10 21:43:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:43:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:48] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:43:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:48] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:48] [INFO ] After 40ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:48] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-10 21:43:48] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 968/968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 967
Applied a total of 2 rules in 39 ms. Remains 73 /74 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:48] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2023-03-10 21:43:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:43:49] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 73/74 places, 967/968 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 554255 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 554255 steps, saw 138499 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:43:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:52] [INFO ] Invariant cache hit.
[2023-03-10 21:43:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:52] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:43:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:52] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:52] [INFO ] After 48ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:52] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-10 21:43:52] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 32 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 73/73 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 34 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2023-03-10 21:43:53] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:53] [INFO ] Invariant cache hit.
[2023-03-10 21:43:53] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-10 21:43:53] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:53] [INFO ] Invariant cache hit.
[2023-03-10 21:43:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:53] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-10 21:43:53] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 21:43:53] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:43:53] [INFO ] Invariant cache hit.
[2023-03-10 21:43:53] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 73/73 places, 967/967 transitions.
Ensure Unique test removed 798 transitions
Reduce isomorphic transitions removed 798 transitions.
Iterating post reduction 0 with 798 rules applied. Total rules applied 798 place count 73 transition count 169
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 1 with 4 rules applied. Total rules applied 802 place count 71 transition count 167
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 804 place count 71 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 806 place count 69 transition count 165
Applied a total of 806 rules in 15 ms. Remains 69 /73 variables (removed 4) and now considering 165/967 (removed 802) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 165 rows 69 cols
[2023-03-10 21:43:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:43:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:54] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:43:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:43:54] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 21:43:54] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:54] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 21:43:54] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (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 218 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 968/968 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:43:54] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2023-03-10 21:43:54] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:43:55] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
[2023-03-10 21:43:55] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:55] [INFO ] Invariant cache hit.
[2023-03-10 21:43:55] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-10 21:43:55] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:55] [INFO ] Invariant cache hit.
[2023-03-10 21:43:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:55] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-10 21:43:55] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:55] [INFO ] Invariant cache hit.
[2023-03-10 21:43:55] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1142 ms. Remains : 74/74 places, 968/968 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/74 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:43:56] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:43:56] [INFO ] Invariant cache hit.
[2023-03-10 21:43:56] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:56] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:43:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:43:56] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:43:56] [INFO ] After 43ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:43:56] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-10 21:43:56] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 968/968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 967
Applied a total of 2 rules in 51 ms. Remains 73 /74 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-10 21:43:56] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2023-03-10 21:43:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:43:57] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 73/74 places, 967/968 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 600854 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600854 steps, saw 149464 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:44:00] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:44:00] [INFO ] Invariant cache hit.
[2023-03-10 21:44:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:44:00] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:44:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:44:00] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:44:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:44:00] [INFO ] After 46ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:44:00] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-10 21:44:00] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 47 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 73/73 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 44 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2023-03-10 21:44:00] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:44:00] [INFO ] Invariant cache hit.
[2023-03-10 21:44:01] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-10 21:44:01] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:44:01] [INFO ] Invariant cache hit.
[2023-03-10 21:44:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:44:01] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-10 21:44:01] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-10 21:44:01] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-10 21:44:01] [INFO ] Invariant cache hit.
[2023-03-10 21:44:01] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 948 ms. Remains : 73/73 places, 967/967 transitions.
Ensure Unique test removed 798 transitions
Reduce isomorphic transitions removed 798 transitions.
Iterating post reduction 0 with 798 rules applied. Total rules applied 798 place count 73 transition count 169
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 1 with 4 rules applied. Total rules applied 802 place count 71 transition count 167
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 804 place count 71 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 806 place count 69 transition count 165
Applied a total of 806 rules in 9 ms. Remains 69 /73 variables (removed 4) and now considering 165/967 (removed 802) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 165 rows 69 cols
[2023-03-10 21:44:01] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:44:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:44:01] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:44:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:44:01] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:44:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 21:44:01] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:44:02] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 21:44:02] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (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 199 ms :[true, (NOT p0), (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 203 ms :[true, (NOT p0), (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 25000 reset in 332 ms.
Product exploration explored 100000 steps with 25000 reset in 331 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 968/968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 968
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 49 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:44:03] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2023-03-10 21:44:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 21:44:04] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
[2023-03-10 21:44:04] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-10 21:44:04] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:44:04] [INFO ] Invariant cache hit.
[2023-03-10 21:44:04] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 968/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 823 ms. Remains : 74/74 places, 968/968 transitions.
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 968/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-10 21:44:04] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2023-03-10 21:44:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:44:05] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
[2023-03-10 21:44:05] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:44:05] [INFO ] Invariant cache hit.
[2023-03-10 21:44:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-10 21:44:05] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:44:05] [INFO ] Invariant cache hit.
[2023-03-10 21:44:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 21:44:05] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-10 21:44:05] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-10 21:44:05] [INFO ] Invariant cache hit.
[2023-03-10 21:44:05] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 74/74 places, 968/968 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 finished in 19521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(!p1||X(!p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(p1)))))'
[2023-03-10 21:44:05] [INFO ] Flatten gal took : 64 ms
[2023-03-10 21:44:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-10 21:44:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 76 places, 968 transitions and 7348 arcs took 10 ms.
Total runtime 54345 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BridgeAndVehicles-PT-V20P20N20
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678484681282

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 BridgeAndVehicles-PT-V20P20N20-LTLFireability-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BridgeAndVehicles-PT-V20P20N20-LTLFireability-13
lola: result : true
lola: markings : 18
lola: fired transitions : 26
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BridgeAndVehicles-PT-V20P20N20-LTLFireability-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 5/32 BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 725272 m, 145054 m/sec, 2500005 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 10/32 BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 1495049 m, 153955 m/sec, 5329804 t fired, .

Time elapsed: 10 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 16/32 BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 2266436 m, 154277 m/sec, 8196044 t fired, .

Time elapsed: 15 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 21/32 BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 3036334 m, 153979 m/sec, 11092369 t fired, .

Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 26/32 BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 3829972 m, 158727 m/sec, 14076876 t fired, .

Time elapsed: 25 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 31/32 BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 4560329 m, 146071 m/sec, 16861120 t fired, .

Time elapsed: 30 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N20-LTLFireability-11: LTL unknown AGGR
BridgeAndVehicles-PT-V20P20N20-LTLFireability-13: LTL true LTL model checker


Time elapsed: 35 secs. Pages in use: 32

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="BridgeAndVehicles-PT-V20P20N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is BridgeAndVehicles-PT-V20P20N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692200212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N20.tgz
mv BridgeAndVehicles-PT-V20P20N20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;