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.r037-tajo-167813690000212.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 itstools
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 r037-tajo-167813690000212
=====================================================================

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

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 03:09:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 03:09:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:09:34] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-09 03:09:34] [INFO ] Transformed 78 places.
[2023-03-09 03:09:34] [INFO ] Transformed 968 transitions.
[2023-03-09 03:09:34] [INFO ] Parsed PT model containing 78 places and 968 transitions and 7350 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 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 56 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:09:34] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-09 03:09:34] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-09 03:09:35] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
[2023-03-09 03:09:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:09:35] [INFO ] Invariant cache hit.
[2023-03-09 03:09:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 03:09:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:09:35] [INFO ] Invariant cache hit.
[2023-03-09 03:09:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:09:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-09 03:09:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:09:35] [INFO ] Invariant cache hit.
[2023-03-09 03:09:35] [INFO ] Dead Transitions using invariants and state equation in 484 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 1530 ms. Remains : 76/78 places, 968/968 transitions.
Support contains 75 out of 76 places after structural reductions.
[2023-03-09 03:09:36] [INFO ] Flatten gal took : 259 ms
[2023-03-09 03:09:36] [INFO ] Flatten gal took : 83 ms
[2023-03-09 03:09:37] [INFO ] Input system was already deterministic with 968 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:09:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:09:38] [INFO ] Invariant cache hit.
[2023-03-09 03:09:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:38] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 03:09:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:38] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 03:09:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:09:38] [INFO ] After 62ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 03:09:38] [INFO ] After 115ms 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-09 03:09:38] [INFO ] After 322ms 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 2 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 6 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 307 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 307 ms. Remains : 71/76 places, 964/968 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 589447 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589447 steps, saw 164035 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 03:09:42] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2023-03-09 03:09:42] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-09 03:09:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:42] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 03:09:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:42] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 03:09:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:09:42] [INFO ] After 32ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 03:09:42] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 03:09:42] [INFO ] After 261ms 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 62 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 63 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 95 ms. Remains 71 /71 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2023-03-09 03:09:42] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-09 03:09:42] [INFO ] Invariant cache hit.
[2023-03-09 03:09:42] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-09 03:09:42] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-09 03:09:42] [INFO ] Invariant cache hit.
[2023-03-09 03:09:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:09:43] [INFO ] Implicit Places using invariants and state equation in 572 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 775 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 63 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 935 ms. Remains : 69/71 places, 964/964 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 632202 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632202 steps, saw 175068 distinct states, run finished after 3002 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 03:09:46] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 69 cols
[2023-03-09 03:09:46] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-09 03:09:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:46] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 03:09:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:46] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 03:09:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:09:46] [INFO ] After 29ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 03:09:46] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 03:09:46] [INFO ] After 164ms 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 55 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 57 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 56 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2023-03-09 03:09:47] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-09 03:09:47] [INFO ] Invariant cache hit.
[2023-03-09 03:09:50] [INFO ] Implicit Places using invariants in 3452 ms returned []
[2023-03-09 03:09:50] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-09 03:09:50] [INFO ] Invariant cache hit.
[2023-03-09 03:09:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:09:50] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
[2023-03-09 03:09:50] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-09 03:09:50] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
[2023-03-09 03:09:50] [INFO ] Invariant cache hit.
[2023-03-09 03:09:51] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4291 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 14 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-09 03:09:51] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-09 03:09:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:51] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 03:09:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:09:51] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 03:09:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 03:09:51] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 03:09:51] [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 10 ms.
[2023-03-09 03:09:51] [INFO ] After 131ms 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 3 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:09:52] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-09 03:09:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 03:10:22] [INFO ] Performed 701/968 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-09 03:10:34] [INFO ] Dead Transitions using invariants and state equation in 42374 ms found 0 transitions.
[2023-03-09 03:10:34] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:34] [INFO ] Invariant cache hit.
[2023-03-09 03:10:34] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-09 03:10:34] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:34] [INFO ] Invariant cache hit.
[2023-03-09 03:10:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:35] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 387 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 2 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 42775 ms. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 984 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 4 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 finished in 43913 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 13 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:10:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-09 03:10:36] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 03:10:36] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
[2023-03-09 03:10:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:36] [INFO ] Invariant cache hit.
[2023-03-09 03:10:36] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-09 03:10:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:36] [INFO ] Invariant cache hit.
[2023-03-09 03:10:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:36] [INFO ] Implicit Places using invariants and state equation in 294 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 437 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 934 ms. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 157 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 836 ms.
Product exploration explored 100000 steps with 50000 reset in 615 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 107 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 2718 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 5 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:10:38] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:38] [INFO ] Invariant cache hit.
[2023-03-09 03:10:39] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
[2023-03-09 03:10:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:39] [INFO ] Invariant cache hit.
[2023-03-09 03:10:39] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-09 03:10:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:39] [INFO ] Invariant cache hit.
[2023-03-09 03:10:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:39] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 314 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 3 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 704 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 815 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 3 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 finished in 1555 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 7 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:10:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:40] [INFO ] Invariant cache hit.
[2023-03-09 03:10:40] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
[2023-03-09 03:10:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:40] [INFO ] Invariant cache hit.
[2023-03-09 03:10:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 03:10:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:40] [INFO ] Invariant cache hit.
[2023-03-09 03:10:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:41] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 373 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 3 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 738 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 580 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 2 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 1381 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 6 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:10:41] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:41] [INFO ] Invariant cache hit.
[2023-03-09 03:10:42] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
[2023-03-09 03:10:42] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:42] [INFO ] Invariant cache hit.
[2023-03-09 03:10:42] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 03:10:42] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:42] [INFO ] Invariant cache hit.
[2023-03-09 03:10:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:42] [INFO ] Implicit Places using invariants and state equation in 423 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 582 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 975 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 181 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 206 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 1187 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 94 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:10:42] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-09 03:10:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 03:10:47] [INFO ] Dead Transitions using invariants and state equation in 4389 ms found 0 transitions.
[2023-03-09 03:10:47] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:47] [INFO ] Invariant cache hit.
[2023-03-09 03:10:47] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-09 03:10:47] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:47] [INFO ] Invariant cache hit.
[2023-03-09 03:10:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:48] [INFO ] Implicit Places using invariants and state equation in 445 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 657 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 48 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 5205 ms. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 109 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 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 finished in 5343 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 8 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:10:48] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-09 03:10:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:10:48] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
[2023-03-09 03:10:48] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:48] [INFO ] Invariant cache hit.
[2023-03-09 03:10:48] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-09 03:10:48] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:48] [INFO ] Invariant cache hit.
[2023-03-09 03:10:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:49] [INFO ] Implicit Places using invariants and state equation in 541 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 742 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 5 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 1105 ms. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 186 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 1318 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-09 03:10:49] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-09 03:10:49] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-09 03:10:49] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
[2023-03-09 03:10:49] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:49] [INFO ] Invariant cache hit.
[2023-03-09 03:10:50] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-09 03:10:50] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:50] [INFO ] Invariant cache hit.
[2023-03-09 03:10:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:50] [INFO ] Implicit Places using invariants and state equation in 692 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 966 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 5 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 1395 ms. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 205 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 1632 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 100 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:10:51] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-09 03:10:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:10:51] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
[2023-03-09 03:10:51] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:51] [INFO ] Invariant cache hit.
[2023-03-09 03:10:51] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 03:10:51] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:10:51] [INFO ] Invariant cache hit.
[2023-03-09 03:10:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:52] [INFO ] Implicit Places using invariants and state equation in 603 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 755 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 70 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 1279 ms. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 136 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 519 steps with 3 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-10 finished in 1448 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 60 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:10:52] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-09 03:10:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:10:53] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
[2023-03-09 03:10:53] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:53] [INFO ] Invariant cache hit.
[2023-03-09 03:10:53] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-09 03:10:53] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:53] [INFO ] Invariant cache hit.
[2023-03-09 03:10:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:53] [INFO ] Implicit Places using invariants and state equation in 317 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 479 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 54 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 932 ms. Remains : 75/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 134 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 683 reset in 520 ms.
Product exploration explored 100000 steps with 668 reset in 471 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 325 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 183 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 2 ms. (steps per millisecond=1 )
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 329 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 197 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
[2023-03-09 03:10:55] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 75 cols
[2023-03-09 03:10:55] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 03:10:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:10:56] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-09 03:10:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:10:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:10:56] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 03:10:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 300 ms returned sat
[2023-03-09 03:10:57] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 103 ms.
[2023-03-09 03:10:57] [INFO ] Added : 16 causal constraints over 4 iterations in 241 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 55 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:10:57] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:57] [INFO ] Invariant cache hit.
[2023-03-09 03:10:57] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
[2023-03-09 03:10:57] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:57] [INFO ] Invariant cache hit.
[2023-03-09 03:10:57] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-09 03:10:57] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:57] [INFO ] Invariant cache hit.
[2023-03-09 03:10:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:10:58] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2023-03-09 03:10:58] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-09 03:10:58] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:10:58] [INFO ] Invariant cache hit.
[2023-03-09 03:10:59] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1876 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 221 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 114 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=1 )
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 401 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 139 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
[2023-03-09 03:11:00] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:11:00] [INFO ] Invariant cache hit.
[2023-03-09 03:11:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:11:00] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-09 03:11:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:11:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:11:00] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-09 03:11:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:11:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 139 ms returned sat
[2023-03-09 03:11:01] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 55 ms.
[2023-03-09 03:11:01] [INFO ] Added : 19 causal constraints over 6 iterations in 199 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Product exploration explored 100000 steps with 661 reset in 478 ms.
Product exploration explored 100000 steps with 670 reset in 434 ms.
Built C files in :
/tmp/ltsmin16057423380222479194
[2023-03-09 03:11:02] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2023-03-09 03:11:02] [INFO ] Computation of Complete disable matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:11:02] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2023-03-09 03:11:02] [INFO ] Computation of Complete enable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:11:02] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2023-03-09 03:11:02] [INFO ] Computation of Completed DNA matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:11:02] [INFO ] Built C files in 560ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16057423380222479194
Running compilation step : cd /tmp/ltsmin16057423380222479194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16057423380222479194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16057423380222479194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 93 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:11:05] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:11:06] [INFO ] Invariant cache hit.
[2023-03-09 03:11:06] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
[2023-03-09 03:11:06] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:11:06] [INFO ] Invariant cache hit.
[2023-03-09 03:11:06] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 03:11:06] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:11:06] [INFO ] Invariant cache hit.
[2023-03-09 03:11:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:11:07] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-09 03:11:07] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-09 03:11:07] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:11:07] [INFO ] Invariant cache hit.
[2023-03-09 03:11:07] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1871 ms. Remains : 75/75 places, 968/968 transitions.
Built C files in :
/tmp/ltsmin7363933722254599748
[2023-03-09 03:11:07] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2023-03-09 03:11:07] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:11:07] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2023-03-09 03:11:07] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:11:08] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2023-03-09 03:11:08] [INFO ] Computation of Completed DNA matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:11:08] [INFO ] Built C files in 418ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7363933722254599748
Running compilation step : cd /tmp/ltsmin7363933722254599748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7363933722254599748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7363933722254599748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 03:11:11] [INFO ] Flatten gal took : 105 ms
[2023-03-09 03:11:11] [INFO ] Flatten gal took : 97 ms
[2023-03-09 03:11:11] [INFO ] Time to serialize gal into /tmp/LTL1297551013658850913.gal : 29 ms
[2023-03-09 03:11:11] [INFO ] Time to serialize properties into /tmp/LTL16520146069319362554.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1297551013658850913.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3142902125517176778.hoa' '-atoms' '/tmp/LTL16520146069319362554.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16520146069319362554.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3142902125517176778.hoa
Detected timeout of ITS tools.
[2023-03-09 03:11:27] [INFO ] Flatten gal took : 88 ms
[2023-03-09 03:11:27] [INFO ] Flatten gal took : 108 ms
[2023-03-09 03:11:27] [INFO ] Time to serialize gal into /tmp/LTL14577302894411978188.gal : 10 ms
[2023-03-09 03:11:27] [INFO ] Time to serialize properties into /tmp/LTL11461699103452424407.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14577302894411978188.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11461699103452424407.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((NB_ATTENTE_A_1<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))"))&&(("(SUR_PONT_A>=1)")||(X("(((NB_ATTENTE_A_1>=1)&&...214
Formula 0 simplified : G(F!"(((NB_ATTENTE_A_1<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))" | (!"(SUR_PONT_A>=1)" & X!"(((NB_ATTENTE_A_1>=1)&&(ATT...206
Detected timeout of ITS tools.
[2023-03-09 03:11:42] [INFO ] Flatten gal took : 49 ms
[2023-03-09 03:11:42] [INFO ] Applying decomposition
[2023-03-09 03:11:42] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12062219434383091055.txt' '-o' '/tmp/graph12062219434383091055.bin' '-w' '/tmp/graph12062219434383091055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12062219434383091055.bin' '-l' '-1' '-v' '-w' '/tmp/graph12062219434383091055.weights' '-q' '0' '-e' '0.001'
[2023-03-09 03:11:42] [INFO ] Decomposing Gal with order
[2023-03-09 03:11:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 03:11:43] [INFO ] Removed a total of 1832 redundant transitions.
[2023-03-09 03:11:43] [INFO ] Flatten gal took : 438 ms
[2023-03-09 03:11:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 215 labels/synchronizations in 10 ms.
[2023-03-09 03:11:43] [INFO ] Time to serialize gal into /tmp/LTL4357881844507592673.gal : 1 ms
[2023-03-09 03:11:43] [INFO ] Time to serialize properties into /tmp/LTL8949960309882516193.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4357881844507592673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8949960309882516193.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i2.u4.NB_ATTENTE_A_1<1)||(i0.u0.ATTENTE_A<1))||((i0.u2.CAPACITE<1)||(u1.CONTROLEUR_1<1)))"))&&(("(i0.u2.SUR_PONT_A>=1)")||...262
Formula 0 simplified : G(F!"(((i2.u4.NB_ATTENTE_A_1<1)||(i0.u0.ATTENTE_A<1))||((i0.u2.CAPACITE<1)||(u1.CONTROLEUR_1<1)))" | (!"(i0.u2.SUR_PONT_A>=1)" & X!"...254
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11361135373274143163
[2023-03-09 03:11:58] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11361135373274143163
Running compilation step : cd /tmp/ltsmin11361135373274143163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1825 ms.
Running link step : cd /tmp/ltsmin11361135373274143163;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin11361135373274143163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&((LTLAPp1==true)||X(!(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 finished in 80927 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 7 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:12:13] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2023-03-09 03:12:13] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 03:12:13] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
[2023-03-09 03:12:13] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:12:13] [INFO ] Invariant cache hit.
[2023-03-09 03:12:14] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 03:12:14] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:12:14] [INFO ] Invariant cache hit.
[2023-03-09 03:12:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:14] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 376 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 726 ms. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 188 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 461 ms.
Product exploration explored 100000 steps with 25000 reset in 382 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 153 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 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))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:12:15] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2023-03-09 03:12:15] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 03:12:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:12:16] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:12:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:12:16] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:16] [INFO ] After 60ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:16] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-09 03:12:16] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 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 64 ms. Remains 73 /74 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:12:16] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2023-03-09 03:12:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:12:16] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 73/74 places, 967/968 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 482575 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 482575 steps, saw 121936 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:12:20] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:20] [INFO ] Invariant cache hit.
[2023-03-09 03:12:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:12:20] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:12:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:12:20] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:20] [INFO ] After 58ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:20] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-09 03:12:20] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 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 47 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 43 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2023-03-09 03:12:20] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:20] [INFO ] Invariant cache hit.
[2023-03-09 03:12:20] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-09 03:12:20] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:20] [INFO ] Invariant cache hit.
[2023-03-09 03:12:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:21] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2023-03-09 03:12:21] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-09 03:12:21] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:21] [INFO ] Invariant cache hit.
[2023-03-09 03:12:21] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 963 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-09 03:12:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:12:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:12:21] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:12:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:12:21] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 03:12:21] [INFO ] After 42ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:21] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 03:12:22] [INFO ] After 290ms 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 173 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 254 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 233 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 8 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:12:22] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2023-03-09 03:12:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 03:12:23] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
[2023-03-09 03:12:23] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:12:23] [INFO ] Invariant cache hit.
[2023-03-09 03:12:23] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-09 03:12:23] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:12:23] [INFO ] Invariant cache hit.
[2023-03-09 03:12:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:23] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-09 03:12:23] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:12:23] [INFO ] Invariant cache hit.
[2023-03-09 03:12:23] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1191 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 113 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 168 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 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:12:24] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:12:24] [INFO ] Invariant cache hit.
[2023-03-09 03:12:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:12:24] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:12:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:12:24] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:24] [INFO ] After 41ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:24] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-09 03:12:24] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 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 59 ms. Remains 73 /74 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2023-03-09 03:12:24] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2023-03-09 03:12:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:12:25] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 73/74 places, 967/968 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 481628 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481628 steps, saw 121734 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:12:28] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:28] [INFO ] Invariant cache hit.
[2023-03-09 03:12:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:12:28] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:12:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:12:28] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:28] [INFO ] After 49ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:28] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-09 03:12:28] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 37 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 45 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 46 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 63 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2023-03-09 03:12:28] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:28] [INFO ] Invariant cache hit.
[2023-03-09 03:12:28] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-09 03:12:28] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:28] [INFO ] Invariant cache hit.
[2023-03-09 03:12:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 03:12:29] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-09 03:12:29] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 03:12:29] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
[2023-03-09 03:12:29] [INFO ] Invariant cache hit.
[2023-03-09 03:12:29] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 877 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 5 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-09 03:12:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:12:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:12:29] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:12:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 03:12:29] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 03:12:29] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:12:29] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 03:12:29] [INFO ] After 154ms 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 111 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 128 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 155 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 181 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 406 ms.
Product exploration explored 100000 steps with 25000 reset in 523 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 143 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 1 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 57 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-03-09 03:12:31] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2023-03-09 03:12:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:12:32] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
[2023-03-09 03:12:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 03:12:32] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2023-03-09 03:12:32] [INFO ] Invariant cache hit.
[2023-03-09 03:12:32] [INFO ] Dead Transitions using invariants and state equation in 379 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 774 ms. Remains : 74/74 places, 968/968 transitions.
Built C files in :
/tmp/ltsmin13880606370577398308
[2023-03-09 03:12:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13880606370577398308
Running compilation step : cd /tmp/ltsmin13880606370577398308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1529 ms.
Running link step : cd /tmp/ltsmin13880606370577398308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin13880606370577398308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13661115586577008684.hoa' '--buchi-type=spotba'
LTSmin run took 350 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 finished in 20812 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)))))'
[2023-03-09 03:12:34] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6461039717577891993
[2023-03-09 03:12:34] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2023-03-09 03:12:34] [INFO ] Applying decomposition
[2023-03-09 03:12:34] [INFO ] Computation of Complete disable matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:12:34] [INFO ] Flatten gal took : 109 ms
[2023-03-09 03:12:34] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2023-03-09 03:12:34] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14391490815298532595.txt' '-o' '/tmp/graph14391490815298532595.bin' '-w' '/tmp/graph14391490815298532595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14391490815298532595.bin' '-l' '-1' '-v' '-w' '/tmp/graph14391490815298532595.weights' '-q' '0' '-e' '0.001'
[2023-03-09 03:12:34] [INFO ] Decomposing Gal with order
[2023-03-09 03:12:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 03:12:35] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2023-03-09 03:12:35] [INFO ] Computation of Completed DNA matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 03:12:35] [INFO ] Removed a total of 1871 redundant transitions.
[2023-03-09 03:12:35] [INFO ] Flatten gal took : 339 ms
[2023-03-09 03:12:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 21 ms.
[2023-03-09 03:12:35] [INFO ] Time to serialize gal into /tmp/LTLFireability9686515251826709617.gal : 1 ms
[2023-03-09 03:12:35] [INFO ] Time to serialize properties into /tmp/LTLFireability12737184178062973124.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9686515251826709617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12737184178062973124.ltl' '-c' '-stutter-deadlock'
[2023-03-09 03:12:35] [INFO ] Built C files in 788ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6461039717577891993
Running compilation step : cd /tmp/ltsmin6461039717577891993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i2.u2.NB_ATTENTE_A_1<1)||(i2.u0.ATTENTE_A<1))||((i0.u1.CAPACITE<1)||(i1.u3.CONTROLEUR_1<1)))"))&&(("(i0.u1.SUR_PONT_A>=1)"...267
Formula 0 simplified : G(F!"(((i2.u2.NB_ATTENTE_A_1<1)||(i2.u0.ATTENTE_A<1))||((i0.u1.CAPACITE<1)||(i1.u3.CONTROLEUR_1<1)))" | (!"(i0.u1.SUR_PONT_A>=1)" & ...255
Compilation finished in 3196 ms.
Running link step : cd /tmp/ltsmin6461039717577891993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin6461039717577891993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&(!(LTLAPp1==true)||X(!(LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 245283 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 430091 ms.

BK_STOP 1678331804199

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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