fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r039-tajo-167813692200228
Last Updated
May 14, 2023

About the Execution of LoLa+red for BridgeAndVehicles-PT-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1059.140 209387.00 253328.00 190.10 FFFFFFFTFF?TFFT? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 20K Feb 25 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 455K Feb 25 12:07 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 9.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 12:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 12:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Feb 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 856K Feb 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 1.1M 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-V50P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678485190619

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:53:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 21:53:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:53:12] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-03-10 21:53:12] [INFO ] Transformed 128 places.
[2023-03-10 21:53:12] [INFO ] Transformed 1328 transitions.
[2023-03-10 21:53:12] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 293 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 5 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 35 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-10 21:53:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-10 21:53:13] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-10 21:53:14] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
[2023-03-10 21:53:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:14] [INFO ] Invariant cache hit.
[2023-03-10 21:53:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-10 21:53:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:14] [INFO ] Invariant cache hit.
[2023-03-10 21:53:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:14] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-10 21:53:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:14] [INFO ] Invariant cache hit.
[2023-03-10 21:53:15] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1328/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1851 ms. Remains : 126/128 places, 1328/1328 transitions.
Support contains 126 out of 126 places after structural reductions.
[2023-03-10 21:53:15] [INFO ] Flatten gal took : 170 ms
[2023-03-10 21:53:16] [INFO ] Flatten gal took : 142 ms
[2023-03-10 21:53:16] [INFO ] Input system was already deterministic with 1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-10 21:53:17] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:17] [INFO ] Invariant cache hit.
[2023-03-10 21:53:17] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-10 21:53:17] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:53:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-10 21:53:17] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:18] [INFO ] After 70ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:18] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-10 21:53:18] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 121 transition count 1324
Applied a total of 9 rules in 413 ms. Remains 121 /126 variables (removed 5) and now considering 1324/1328 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 121/126 places, 1324/1328 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 459360 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 459360 steps, saw 136599 distinct states, run finished after 3002 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:53:21] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2023-03-10 21:53:21] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-10 21:53:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 21:53:22] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:53:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-10 21:53:22] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:22] [INFO ] After 33ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:22] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-10 21:53:22] [INFO ] After 303ms 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 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1324/1324 transitions.
Applied a total of 0 rules in 85 ms. Remains 121 /121 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 121/121 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1324/1324 transitions.
Applied a total of 0 rules in 128 ms. Remains 121 /121 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-10 21:53:22] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-10 21:53:22] [INFO ] Invariant cache hit.
[2023-03-10 21:53:22] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-10 21:53:22] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-10 21:53:22] [INFO ] Invariant cache hit.
[2023-03-10 21:53:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:23] [INFO ] Implicit Places using invariants and state equation in 629 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 973 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/121 places, 1324/1324 transitions.
Applied a total of 0 rules in 63 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1167 ms. Remains : 119/121 places, 1324/1324 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 493972 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493972 steps, saw 145184 distinct states, run finished after 3005 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:53:26] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 119 cols
[2023-03-10 21:53:26] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-10 21:53:26] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-10 21:53:26] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:53:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:53:26] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:26] [INFO ] After 26ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:27] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-10 21:53:27] [INFO ] After 198ms 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 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1324/1324 transitions.
Applied a total of 0 rules in 65 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 119/119 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1324/1324 transitions.
Applied a total of 0 rules in 64 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-10 21:53:27] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-10 21:53:27] [INFO ] Invariant cache hit.
[2023-03-10 21:53:27] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-10 21:53:27] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-10 21:53:27] [INFO ] Invariant cache hit.
[2023-03-10 21:53:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:28] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-03-10 21:53:28] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-10 21:53:28] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-10 21:53:28] [INFO ] Invariant cache hit.
[2023-03-10 21:53:28] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1563 ms. Remains : 119/119 places, 1324/1324 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 119 transition count 246
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 119 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1082 place count 117 transition count 244
Applied a total of 1082 rules in 13 ms. Remains 117 /119 variables (removed 2) and now considering 244/1324 (removed 1080) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 244 rows 117 cols
[2023-03-10 21:53:28] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 21:53:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 21:53:28] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:53:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:53:28] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 21:53:28] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:53:28] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 21:53:28] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 109 stabilizing places and 204 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(X((!p0&&F(G(p0))))))))'
Support contains 63 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 20 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-10 21:53:29] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-10 21:53:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:53:30] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2023-03-10 21:53:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:30] [INFO ] Invariant cache hit.
[2023-03-10 21:53:30] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-10 21:53:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:30] [INFO ] Invariant cache hit.
[2023-03-10 21:53:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:30] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 578 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1084 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 322 ms :[true, true, true, true, true, true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-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=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s54 1) (LT s102 1) (LT s118 1)) (OR (LT s1 1) (LT s54 1) (LT s58 1) (LT s119 1)) (OR (LT s1 1) (LT s54 1) (LT s97 1) (LT s113 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-00 finished in 1501 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)) U p1))'
Support contains 54 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 143 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-10 21:53:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-10 21:53:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:53:31] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
[2023-03-10 21:53:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:31] [INFO ] Invariant cache hit.
[2023-03-10 21:53:31] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-10 21:53:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:31] [INFO ] Invariant cache hit.
[2023-03-10 21:53:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:32] [INFO ] Implicit Places using invariants and state equation in 350 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 502 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 70 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1307 ms. Remains : 125/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s52 1), p0:(OR (AND (GEQ s53 1) (GEQ s55 1) (GEQ s64 1) (GEQ s107 1)) (AND (GEQ s53 1) (GEQ s55 1) (GEQ s103 1) (GEQ s107 1)) (AND (GEQ s53 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 30 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-02 finished in 1440 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(X(G((!p0 U p1))))))'
Support contains 64 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-10 21:53:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:32] [INFO ] Invariant cache hit.
[2023-03-10 21:53:32] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
[2023-03-10 21:53:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:32] [INFO ] Invariant cache hit.
[2023-03-10 21:53:33] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-10 21:53:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:33] [INFO ] Invariant cache hit.
[2023-03-10 21:53:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:33] [INFO ] Implicit Places using invariants and state equation in 428 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 603 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1111 ms. Remains : 124/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 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=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s109 1), p0:(OR (AND (GEQ s33 1) (GEQ s55 1) (GEQ s56 1) (GEQ s116 1)) (AND (GEQ s36 1) (GEQ s55 1) (GEQ s56 1) (GEQ s117 1)) (AND (GEQ s35 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7002 steps with 98 reset in 101 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-03 finished in 1409 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(((X(p1)||p0) U G(!p2)))) U G((p3 U !p2))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-10 21:53:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:33] [INFO ] Invariant cache hit.
[2023-03-10 21:53:34] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
[2023-03-10 21:53:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:34] [INFO ] Invariant cache hit.
[2023-03-10 21:53:34] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-10 21:53:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:34] [INFO ] Invariant cache hit.
[2023-03-10 21:53:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:35] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1224 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1691 ms. Remains : 124/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 783 ms :[p2, p2, p2, p2, p2, p2, (NOT p1), (AND p2 (NOT p1)), true, (AND (NOT p0) (NOT p1) p2), p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p3), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) p3), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(OR (NOT p2) p3), acceptance={} source=2 dest: 9}, { cond=(AND p2 p3), acceptance={} source=2 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p3), acceptance={} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=9 dest: 12}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p2 p3), acceptance={0} source=10 dest: 10}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=10 dest: 13}], [{ cond=p2, acceptance={} source=11 dest: 8}, { cond=(NOT p2), acceptance={} source=11 dest: 11}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=12 dest: 14}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=12 dest: 15}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=13 dest: 8}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=13 dest: 14}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=14 dest: 8}, { cond=(AND p2 p3), acceptance={0} source=14 dest: 14}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=15 dest: 8}, { cond=(AND p2 p3), acceptance={} source=15 dest: 14}, { cond=(OR (NOT p2) p3), acceptance={} source=15 dest: 15}]], initial=0, aps=[p2:(LT s109 1), p3:(OR (AND (GEQ s107 1) (GEQ s123 1)) (AND (GEQ s108 1) (GEQ s123 1))), p0:(OR (AND (GEQ s53 20) (GEQ s111 1)) (AND (GEQ s53 20) (GEQ s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, 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, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-05 finished in 2512 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(p0)||X((F(p1) U !(p1 U !p0)))))'
Support contains 104 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 12 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-10 21:53:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-10 21:53:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:53:36] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
[2023-03-10 21:53:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:36] [INFO ] Invariant cache hit.
[2023-03-10 21:53:36] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 21:53:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:36] [INFO ] Invariant cache hit.
[2023-03-10 21:53:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:37] [INFO ] Implicit Places using invariants and state equation in 372 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 476 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 972 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s98 1) (GEQ s111 1)) (AND (GEQ s59 1) (GEQ s111 1)) (AND (GEQ s69 1) (GEQ s111 1)) (AND (GEQ s88 1) (GEQ s111 1)) (AND (GEQ s79 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1304 steps with 5 reset in 24 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-06 finished in 1167 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||X((X((!p1||X((!p0||G(p0))))) U (!p0&&X((!p1||X((!p0||G(p0)))))))))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-10 21:53:37] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-10 21:53:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:53:38] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
[2023-03-10 21:53:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:38] [INFO ] Invariant cache hit.
[2023-03-10 21:53:38] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-10 21:53:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-10 21:53:38] [INFO ] Invariant cache hit.
[2023-03-10 21:53:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:38] [INFO ] Implicit Places using invariants and state equation in 525 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 749 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1328/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1254 ms. Remains : 124/126 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 280 ms :[p0, p0, p0, false, false, (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s52 1), p1:(LT s109 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 567 ms.
Product exploration explored 100000 steps with 50000 reset in 536 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-07 finished in 2882 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(p0)||(F(p1)&&X(F(p2))))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 15 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-10 21:53:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-10 21:53:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:53:40] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
[2023-03-10 21:53:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:40] [INFO ] Invariant cache hit.
[2023-03-10 21:53:41] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-10 21:53:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:41] [INFO ] Invariant cache hit.
[2023-03-10 21:53:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:41] [INFO ] Implicit Places using invariants and state equation in 569 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 760 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1272 ms. Remains : 124/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)), p1:(AND (GEQ s109 1) (GEQ s121 1)), p2:(AND (GEQ s109 1) (GEQ s123 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]]
Product exploration explored 100000 steps with 823 reset in 362 ms.
Product exploration explored 100000 steps with 822 reset in 401 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 455 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Finished random walk after 163 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 10 factoid took 550 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2023-03-10 21:53:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-10 21:53:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:53:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:44] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-10 21:53:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:53:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:45] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-10 21:53:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 108 ms returned sat
[2023-03-10 21:53:45] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 95 ms.
[2023-03-10 21:53:45] [INFO ] Added : 42 causal constraints over 9 iterations in 430 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 21:53:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:45] [INFO ] Invariant cache hit.
[2023-03-10 21:53:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:46] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-10 21:53:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:53:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:47] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-10 21:53:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 310 ms returned sat
[2023-03-10 21:53:47] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 49 ms.
[2023-03-10 21:53:48] [INFO ] Added : 42 causal constraints over 9 iterations in 752 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 11 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:53:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:48] [INFO ] Invariant cache hit.
[2023-03-10 21:53:48] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
[2023-03-10 21:53:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:48] [INFO ] Invariant cache hit.
[2023-03-10 21:53:49] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-10 21:53:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:49] [INFO ] Invariant cache hit.
[2023-03-10 21:53:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:49] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2023-03-10 21:53:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:49] [INFO ] Invariant cache hit.
[2023-03-10 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1662 ms. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Finished random walk after 137 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2023-03-10 21:53:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:50] [INFO ] Invariant cache hit.
[2023-03-10 21:53:51] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 21:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:51] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-10 21:53:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:53:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 21:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:52] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2023-03-10 21:53:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 103 ms returned sat
[2023-03-10 21:53:52] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 50 ms.
[2023-03-10 21:53:52] [INFO ] Added : 42 causal constraints over 10 iterations in 483 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 21:53:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:52] [INFO ] Invariant cache hit.
[2023-03-10 21:53:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:53] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-10 21:53:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:53:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:53:53] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-10 21:53:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 383 ms returned sat
[2023-03-10 21:53:54] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 48 ms.
[2023-03-10 21:53:55] [INFO ] Added : 42 causal constraints over 9 iterations in 892 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 825 reset in 490 ms.
Product exploration explored 100000 steps with 825 reset in 512 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 1327
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 178 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:53:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-10 21:53:56] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:53:57] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
[2023-03-10 21:53:57] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-10 21:53:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:57] [INFO ] Invariant cache hit.
[2023-03-10 21:53:58] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1327/1327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1327 ms. Remains : 124/124 places, 1327/1327 transitions.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:53:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-10 21:53:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:53:58] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
[2023-03-10 21:53:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:58] [INFO ] Invariant cache hit.
[2023-03-10 21:53:58] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-10 21:53:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:53:58] [INFO ] Invariant cache hit.
[2023-03-10 21:53:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:53:59] [INFO ] Implicit Places using invariants and state equation in 564 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 751 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1195 ms. Remains : 123/124 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 finished in 19119 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(F(p0))&&(X(F(p2))||p1))))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 8 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-10 21:53:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-10 21:53:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:54:00] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
[2023-03-10 21:54:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:00] [INFO ] Invariant cache hit.
[2023-03-10 21:54:00] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-10 21:54:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:00] [INFO ] Invariant cache hit.
[2023-03-10 21:54:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:00] [INFO ] Implicit Places using invariants and state equation in 423 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 665 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1411 ms. Remains : 124/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 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=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s53 1) (LT s55 1) (LT s66 1) (LT s107 1)), p0:(AND (GEQ s108 1) (GEQ s113 1)), p2:(AND (GEQ s53 1) (GEQ s55 1) (GEQ s66 1) (GEQ s107 1))], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 1370 reset in 336 ms.
Product exploration explored 100000 steps with 1389 reset in 345 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-10 21:54:02] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:54:03] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
[2023-03-10 21:54:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:03] [INFO ] Invariant cache hit.
[2023-03-10 21:54:03] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-10 21:54:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:03] [INFO ] Invariant cache hit.
[2023-03-10 21:54:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:03] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2023-03-10 21:54:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:03] [INFO ] Invariant cache hit.
[2023-03-10 21:54:04] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1870 ms. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1436 reset in 336 ms.
Product exploration explored 100000 steps with 1467 reset in 345 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 1327
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 136 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-10 21:54:06] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 21:54:06] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
[2023-03-10 21:54:06] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-10 21:54:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:06] [INFO ] Invariant cache hit.
[2023-03-10 21:54:07] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1327/1327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1109 ms. Remains : 124/124 places, 1327/1327 transitions.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-10 21:54:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:54:07] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
[2023-03-10 21:54:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:07] [INFO ] Invariant cache hit.
[2023-03-10 21:54:07] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-10 21:54:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:07] [INFO ] Invariant cache hit.
[2023-03-10 21:54:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:08] [INFO ] Implicit Places using invariants and state equation in 494 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1101 ms. Remains : 123/124 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 finished in 8725 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(p0))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1327
Applied a total of 2 rules in 69 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-10 21:54:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-10 21:54:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:54:08] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2023-03-10 21:54:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:08] [INFO ] Invariant cache hit.
[2023-03-10 21:54:09] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-10 21:54:09] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:09] [INFO ] Invariant cache hit.
[2023-03-10 21:54:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:09] [INFO ] Implicit Places using invariants and state equation in 510 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 724 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 61 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1334 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s53 20) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1706 reset in 305 ms.
Product exploration explored 100000 steps with 1715 reset in 318 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-10 21:54:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-10 21:54:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:54:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:54:11] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-10 21:54:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:54:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:54:11] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2023-03-10 21:54:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 685 ms returned sat
[2023-03-10 21:54:12] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-10 21:54:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-10 21:54:12] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 31 ms.
[2023-03-10 21:54:12] [INFO ] Added : 11 causal constraints over 3 iterations in 245 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 85 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:13] [INFO ] Invariant cache hit.
[2023-03-10 21:54:13] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2023-03-10 21:54:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:13] [INFO ] Invariant cache hit.
[2023-03-10 21:54:13] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-10 21:54:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:13] [INFO ] Invariant cache hit.
[2023-03-10 21:54:14] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-10 21:54:14] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-10 21:54:14] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:14] [INFO ] Invariant cache hit.
[2023-03-10 21:54:14] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1510 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-10 21:54:14] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:14] [INFO ] Invariant cache hit.
[2023-03-10 21:54:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:54:15] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-10 21:54:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:54:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:54:15] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-10 21:54:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 225 ms returned sat
[2023-03-10 21:54:16] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2023-03-10 21:54:19] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3206 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1736 reset in 403 ms.
Product exploration explored 100000 steps with 1744 reset in 321 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 109 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:19] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:19] [INFO ] Invariant cache hit.
[2023-03-10 21:54:20] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
[2023-03-10 21:54:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:20] [INFO ] Invariant cache hit.
[2023-03-10 21:54:20] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-10 21:54:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:20] [INFO ] Invariant cache hit.
[2023-03-10 21:54:20] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2023-03-10 21:54:21] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-10 21:54:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:21] [INFO ] Invariant cache hit.
[2023-03-10 21:54:21] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1562 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 finished in 13232 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((G(p1)||p0))))'
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1328/1328 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 125 transition count 1327
Applied a total of 2 rules in 74 ms. Remains 125 /126 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-10 21:54:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-10 21:54:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:54:21] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
[2023-03-10 21:54:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:21] [INFO ] Invariant cache hit.
[2023-03-10 21:54:22] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-10 21:54:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:22] [INFO ] Invariant cache hit.
[2023-03-10 21:54:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:22] [INFO ] Implicit Places using invariants and state equation in 492 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 676 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1327/1328 transitions.
Applied a total of 0 rules in 60 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1182 ms. Remains : 123/126 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s108 1), p0:(OR (LT s1 1) (LT s53 1) (LT s92 1) (LT s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 268 reset in 406 ms.
Product exploration explored 100000 steps with 268 reset in 405 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 424406 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 424406 steps, saw 119929 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:54:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-10 21:54:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:54:27] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-10 21:54:27] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:54:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:54:27] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:27] [INFO ] After 34ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:27] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-10 21:54:27] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 51 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:27] [INFO ] Invariant cache hit.
[2023-03-10 21:54:28] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 484434 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 484434 steps, saw 136388 distinct states, run finished after 3014 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:54:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:31] [INFO ] Invariant cache hit.
[2023-03-10 21:54:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:54:31] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:54:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-10 21:54:31] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:31] [INFO ] After 35ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:32] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-10 21:54:32] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 51 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 51 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:32] [INFO ] Invariant cache hit.
[2023-03-10 21:54:32] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-10 21:54:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:32] [INFO ] Invariant cache hit.
[2023-03-10 21:54:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:32] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-10 21:54:32] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-10 21:54:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:32] [INFO ] Invariant cache hit.
[2023-03-10 21:54:33] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1123 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
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 1082 place count 121 transition count 247
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1084 place count 121 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1086 place count 119 transition count 245
Applied a total of 1086 rules in 8 ms. Remains 119 /123 variables (removed 4) and now considering 245/1327 (removed 1082) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 245 rows 119 cols
[2023-03-10 21:54:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:54:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:54:33] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:54:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:54:33] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 21:54:33] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:33] [INFO ] After 44ms 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-10 21:54:33] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 158 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-10 21:54:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:54:34] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
[2023-03-10 21:54:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:34] [INFO ] Invariant cache hit.
[2023-03-10 21:54:34] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-10 21:54:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:34] [INFO ] Invariant cache hit.
[2023-03-10 21:54:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:34] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2023-03-10 21:54:34] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-10 21:54:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:34] [INFO ] Invariant cache hit.
[2023-03-10 21:54:35] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1638 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 414521 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 414521 steps, saw 117316 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:54:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:38] [INFO ] Invariant cache hit.
[2023-03-10 21:54:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:39] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:54:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:39] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:39] [INFO ] After 49ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:39] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-10 21:54:39] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 66 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:39] [INFO ] Invariant cache hit.
[2023-03-10 21:54:40] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 447872 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447872 steps, saw 126349 distinct states, run finished after 3002 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:54:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:43] [INFO ] Invariant cache hit.
[2023-03-10 21:54:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 21:54:43] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:54:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:43] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:43] [INFO ] After 57ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:43] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-10 21:54:43] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 75 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:44] [INFO ] Invariant cache hit.
[2023-03-10 21:54:44] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-10 21:54:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:44] [INFO ] Invariant cache hit.
[2023-03-10 21:54:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:44] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2023-03-10 21:54:45] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-10 21:54:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:45] [INFO ] Invariant cache hit.
[2023-03-10 21:54:45] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1466 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
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 1082 place count 121 transition count 247
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1084 place count 121 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1086 place count 119 transition count 245
Applied a total of 1086 rules in 9 ms. Remains 119 /123 variables (removed 4) and now considering 245/1327 (removed 1082) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 245 rows 119 cols
[2023-03-10 21:54:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:54:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:54:45] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:54:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 21:54:45] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 21:54:45] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:54:45] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-10 21:54:45] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 268 reset in 420 ms.
Product exploration explored 100000 steps with 268 reset in 432 ms.
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-10 21:54:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-10 21:54:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:54:47] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
[2023-03-10 21:54:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:47] [INFO ] Invariant cache hit.
[2023-03-10 21:54:47] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-10 21:54:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:47] [INFO ] Invariant cache hit.
[2023-03-10 21:54:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:54:48] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-03-10 21:54:48] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 21:54:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-10 21:54:48] [INFO ] Invariant cache hit.
[2023-03-10 21:54:48] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1673 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 finished in 27301 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(p0)||(F(p1)&&X(F(p2))))))'
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(F(p0))&&(X(F(p2))||p1))))'
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(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2023-03-10 21:54:49] [INFO ] Flatten gal took : 77 ms
[2023-03-10 21:54:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-10 21:54:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 1328 transitions and 10008 arcs took 10 ms.
Total runtime 96703 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BridgeAndVehicles-PT-V50P20N10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678485400006

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 6 (type EXCL) for 3 BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 4/719 7/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 733731 m, 146746 m/sec, 2470426 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 9/719 12/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 1438360 m, 140925 m/sec, 5066174 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 14/719 18/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 2086059 m, 129539 m/sec, 7452998 t fired, .

Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 19/719 24/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 2837576 m, 150303 m/sec, 10221698 t fired, .

Time elapsed: 20 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 24/719 31/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 3701925 m, 172869 m/sec, 13062469 t fired, .

Time elapsed: 25 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 6 (type EXCL) for BridgeAndVehicles-PT-V50P20N10-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 8 (type EXCL) for 3 BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
lola: time limit : 892 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for BridgeAndVehicles-PT-V50P20N10-LTLFireability-10
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
lola: time limit : 1190 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BridgeAndVehicles-PT-V50P20N10-LTLFireability-09
lola: result : false
lola: markings : 854063
lola: fired transitions : 3013397
lola: time used : 5.000000
lola: memory pages used : 8
lola: LAUNCH task # 16 (type EXCL) for 10 BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
lola: time limit : 1782 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EG EXCL 0/1782 1/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 883 m, 176 m/sec, 1992 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EG EXCL 5/1782 2/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-11 245788 m, 48981 m/sec, 825612 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 16 (type EXCL) for BridgeAndVehicles-PT-V50P20N10-LTLFireability-11
lola: result : false
lola: markings : 394261
lola: fired transitions : 1328123
lola: time used : 8.000000
lola: memory pages used : 2
lola: LAUNCH task # 14 (type EXCL) for 13 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15
lola: time limit : 3557 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 2/3557 2/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 146632 m, 29326 m/sec, 383114 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 7/3557 5/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 550627 m, 80799 m/sec, 1445216 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 12/3557 7/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 839293 m, 57733 m/sec, 2424209 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 17/3557 10/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 1104529 m, 53047 m/sec, 3361696 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 22/3557 12/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 1375714 m, 54237 m/sec, 4285735 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 27/3557 14/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 1670898 m, 59036 m/sec, 5311709 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 32/3557 17/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 1965353 m, 58891 m/sec, 6301668 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 37/3557 19/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 2257826 m, 58494 m/sec, 7303046 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 42/3557 21/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 2541540 m, 56742 m/sec, 8252956 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 47/3557 24/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 2837829 m, 59257 m/sec, 9244815 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 52/3557 26/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 3116116 m, 55657 m/sec, 10198276 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 57/3557 29/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 3409278 m, 58632 m/sec, 11148136 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 62/3557 31/32 BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 3695626 m, 57269 m/sec, 12115231 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for BridgeAndVehicles-PT-V50P20N10-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ 0 0 0 0 3 0 1 0
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V50P20N10-LTLFireability-09: LTL false LTL model checker
BridgeAndVehicles-PT-V50P20N10-LTLFireability-10: CONJ unknown CONJ
BridgeAndVehicles-PT-V50P20N10-LTLFireability-11: F true state space / EG
BridgeAndVehicles-PT-V50P20N10-LTLFireability-15: LTL unknown AGGR


Time elapsed: 110 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is BridgeAndVehicles-PT-V50P20N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692200228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 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 ;