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-167813692200203.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-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692200203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Feb 25 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K 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 4.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 194K Feb 25 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 798K Feb 25 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:35 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 434K 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-V20P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678484205819

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:36:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 21:36:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:36:48] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-10 21:36:48] [INFO ] Transformed 68 places.
[2023-03-10 21:36:48] [INFO ] Transformed 548 transitions.
[2023-03-10 21:36:48] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 42 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:36:48] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-10 21:36:48] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-10 21:36:48] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
[2023-03-10 21:36:48] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:36:48] [INFO ] Invariant cache hit.
[2023-03-10 21:36:49] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-10 21:36:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:36:49] [INFO ] Invariant cache hit.
[2023-03-10 21:36:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:36:49] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-10 21:36:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:36:49] [INFO ] Invariant cache hit.
[2023-03-10 21:36:49] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1433 ms. Remains : 68/68 places, 548/548 transitions.
Support contains 16 out of 68 places after structural reductions.
[2023-03-10 21:36:50] [INFO ] Flatten gal took : 92 ms
[2023-03-10 21:36:50] [INFO ] Flatten gal took : 35 ms
[2023-03-10 21:36:50] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:36:51] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:36:51] [INFO ] Invariant cache hit.
[2023-03-10 21:36:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-10 21:36:51] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-10 21:36:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-10 21:36:51] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-10 21:36:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:36:51] [INFO ] After 28ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-10 21:36:51] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-10 21:36:51] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 68 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:36:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-10 21:36:51] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 21:36:51] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 65/68 places, 547/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10008 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=345 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 534203 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 534203 steps, saw 132649 distinct states, run finished after 3002 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:36:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:36:55] [INFO ] Invariant cache hit.
[2023-03-10 21:36:55] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:36:55] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:36:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:36:55] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:36:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:36:55] [INFO ] After 29ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:36:55] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-10 21:36:55] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 33 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 28 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:36:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:36:55] [INFO ] Invariant cache hit.
[2023-03-10 21:36:55] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-10 21:36:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:36:55] [INFO ] Invariant cache hit.
[2023-03-10 21:36:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:36:55] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 429 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 15 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 472 ms. Remains : 63/65 places, 547/547 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 770505 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 770505 steps, saw 187750 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:36:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-10 21:36:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:36:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:36:59] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:36:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-10 21:36:59] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:36:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:36:59] [INFO ] After 34ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:36:59] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 21:36:59] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:36:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:36:59] [INFO ] Invariant cache hit.
[2023-03-10 21:36:59] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 21:36:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:36:59] [INFO ] Invariant cache hit.
[2023-03-10 21:36:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:36:59] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-10 21:36:59] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-10 21:36:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:36:59] [INFO ] Invariant cache hit.
[2023-03-10 21:36:59] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 63/63 places, 547/547 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 63 transition count 129
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 1 with 4 rules applied. Total rules applied 422 place count 61 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 424 place count 61 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 426 place count 59 transition count 125
Applied a total of 426 rules in 12 ms. Remains 59 /63 variables (removed 4) and now considering 125/547 (removed 422) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 59 cols
[2023-03-10 21:36:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:36:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:36:59] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:36:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-10 21:36:59] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:36:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 21:37:00] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:37:00] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-10 21:37:00] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 7 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2023-03-10 21:37:00] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 21:37:00] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2023-03-10 21:37:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:00] [INFO ] Invariant cache hit.
[2023-03-10 21:37:00] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-10 21:37:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:00] [INFO ] Invariant cache hit.
[2023-03-10 21:37:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:00] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 311 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 514 ms. Remains : 65/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1545 reset in 428 ms.
Product exploration explored 100000 steps with 1534 reset in 335 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 1101 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 222 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-10 21:37:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2023-03-10 21:37:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:02] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 21:37:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:02] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-10 21:37:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 119 ms returned sat
[2023-03-10 21:37:02] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2023-03-10 21:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-10 21:37:03] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 36 ms.
[2023-03-10 21:37:03] [INFO ] Added : 26 causal constraints over 6 iterations in 182 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 547
Applied a total of 2 rules in 81 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:37:03] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-10 21:37:03] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:03] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
[2023-03-10 21:37:03] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:03] [INFO ] Invariant cache hit.
[2023-03-10 21:37:03] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-10 21:37:03] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:03] [INFO ] Invariant cache hit.
[2023-03-10 21:37:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:04] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-10 21:37:04] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 21:37:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:04] [INFO ] Invariant cache hit.
[2023-03-10 21:37:04] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/65 places, 547/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1152 ms. Remains : 64/65 places, 547/548 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 232 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 37 ms :[(NOT p0)]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-10 21:37:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:04] [INFO ] Invariant cache hit.
[2023-03-10 21:37:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:05] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-10 21:37:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:05] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 21:37:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 210 ms returned sat
[2023-03-10 21:37:05] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2023-03-10 21:37:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2023-03-10 21:37:05] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 41 ms.
[2023-03-10 21:37:05] [INFO ] Added : 28 causal constraints over 7 iterations in 159 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1738 reset in 271 ms.
Product exploration explored 100000 steps with 1714 reset in 272 ms.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 25 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:37:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:06] [INFO ] Invariant cache hit.
[2023-03-10 21:37:06] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
[2023-03-10 21:37:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:06] [INFO ] Invariant cache hit.
[2023-03-10 21:37:07] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-10 21:37:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:07] [INFO ] Invariant cache hit.
[2023-03-10 21:37:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:07] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-10 21:37:07] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-10 21:37:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:07] [INFO ] Invariant cache hit.
[2023-03-10 21:37:07] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 839 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 finished in 7321 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))&&F(p1)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 47 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:37:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-10 21:37:07] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:37:07] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
[2023-03-10 21:37:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:07] [INFO ] Invariant cache hit.
[2023-03-10 21:37:07] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-10 21:37:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:07] [INFO ] Invariant cache hit.
[2023-03-10 21:37:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:08] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 265 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 621 ms. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s48), p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 finished in 722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 23 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:37:08] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-10 21:37:08] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:37:08] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
[2023-03-10 21:37:08] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:08] [INFO ] Invariant cache hit.
[2023-03-10 21:37:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-10 21:37:08] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:08] [INFO ] Invariant cache hit.
[2023-03-10 21:37:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:08] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 264 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 491 ms. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s47 s22), p1:(GT 3 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2750 reset in 245 ms.
Product exploration explored 100000 steps with 2757 reset in 262 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 387 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-10 21:37:10] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-10 21:37:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 21:37:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:10] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-10 21:37:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 187 ms returned sat
[2023-03-10 21:37:10] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-10 21:37:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-10 21:37:10] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 23 ms.
[2023-03-10 21:37:11] [INFO ] Added : 29 causal constraints over 6 iterations in 88 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:37:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:11] [INFO ] Invariant cache hit.
[2023-03-10 21:37:11] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
[2023-03-10 21:37:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:11] [INFO ] Invariant cache hit.
[2023-03-10 21:37:11] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 21:37:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:11] [INFO ] Invariant cache hit.
[2023-03-10 21:37:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:11] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-10 21:37:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:37:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:11] [INFO ] Invariant cache hit.
[2023-03-10 21:37:11] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 739 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 409 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-10 21:37:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:13] [INFO ] Invariant cache hit.
[2023-03-10 21:37:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:13] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 21:37:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:13] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-10 21:37:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 242 ms returned sat
[2023-03-10 21:37:13] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2023-03-10 21:37:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-10 21:37:14] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 37 ms.
[2023-03-10 21:37:14] [INFO ] Added : 29 causal constraints over 6 iterations in 138 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2647 reset in 384 ms.
Product exploration explored 100000 steps with 2752 reset in 356 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 32 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:37:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:15] [INFO ] Invariant cache hit.
[2023-03-10 21:37:15] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
[2023-03-10 21:37:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:15] [INFO ] Invariant cache hit.
[2023-03-10 21:37:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-10 21:37:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:15] [INFO ] Invariant cache hit.
[2023-03-10 21:37:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:15] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-10 21:37:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:37:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:15] [INFO ] Invariant cache hit.
[2023-03-10 21:37:16] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 974 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 finished in 7999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 546
Applied a total of 6 rules in 57 ms. Remains 63 /68 variables (removed 5) and now considering 546/548 (removed 2) transitions.
[2023-03-10 21:37:16] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 63 cols
[2023-03-10 21:37:16] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 21:37:17] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2023-03-10 21:37:17] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:17] [INFO ] Invariant cache hit.
[2023-03-10 21:37:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:17] [INFO ] Implicit Places using invariants and state equation in 293 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1490 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/68 places, 546/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1563 ms. Remains : 61/68 places, 546/548 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s45 s46))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 765 reset in 233 ms.
Product exploration explored 100000 steps with 765 reset in 234 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 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:37:18] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 61 cols
[2023-03-10 21:37:18] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 21:37:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:19] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-10 21:37:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:19] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-10 21:37:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:19] [INFO ] [Nat]Added 22 Read/Feed constraints in 363 ms returned sat
[2023-03-10 21:37:19] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 75 transitions) in 24 ms.
[2023-03-10 21:37:19] [INFO ] Added : 19 causal constraints over 5 iterations in 144 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 546/546 transitions.
Applied a total of 0 rules in 20 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2023-03-10 21:37:19] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:19] [INFO ] Invariant cache hit.
[2023-03-10 21:37:19] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-10 21:37:19] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:19] [INFO ] Invariant cache hit.
[2023-03-10 21:37:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:20] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-10 21:37:20] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:37:20] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:20] [INFO ] Invariant cache hit.
[2023-03-10 21:37:20] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 738 ms. Remains : 61/61 places, 546/546 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-10 21:37:21] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:21] [INFO ] Invariant cache hit.
[2023-03-10 21:37:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:21] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 21:37:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:21] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-10 21:37:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 587 ms returned sat
[2023-03-10 21:37:22] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 75 transitions) in 14 ms.
[2023-03-10 21:37:22] [INFO ] Added : 19 causal constraints over 5 iterations in 151 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 765 reset in 300 ms.
Product exploration explored 100000 steps with 765 reset in 302 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 546/546 transitions.
Applied a total of 0 rules in 19 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2023-03-10 21:37:22] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:22] [INFO ] Invariant cache hit.
[2023-03-10 21:37:22] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-10 21:37:22] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:22] [INFO ] Invariant cache hit.
[2023-03-10 21:37:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:23] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-10 21:37:23] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:37:23] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
[2023-03-10 21:37:23] [INFO ] Invariant cache hit.
[2023-03-10 21:37:23] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 61/61 places, 546/546 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 finished in 7255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||p0))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-10 21:37:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:23] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
[2023-03-10 21:37:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:23] [INFO ] Invariant cache hit.
[2023-03-10 21:37:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-10 21:37:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:23] [INFO ] Invariant cache hit.
[2023-03-10 21:37:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:24] [INFO ] Implicit Places using invariants and state equation in 309 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 65/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 1 s22) (LEQ 2 (ADD s48 s49))), p1:(LEQ s23 (ADD s25 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 37449 reset in 257 ms.
Product exploration explored 100000 steps with 37512 reset in 255 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 finished in 1445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 3 place count 66 transition count 547
Applied a total of 3 rules in 30 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:37:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-10 21:37:24] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-10 21:37:25] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
[2023-03-10 21:37:25] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:25] [INFO ] Invariant cache hit.
[2023-03-10 21:37:25] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 21:37:25] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:25] [INFO ] Invariant cache hit.
[2023-03-10 21:37:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:25] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 345 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 33 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 605 ms. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s52 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1949 reset in 256 ms.
Product exploration explored 100000 steps with 1948 reset in 208 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2023-03-10 21:37:26] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-10 21:37:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:27] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 21:37:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:27] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 21:37:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2023-03-10 21:37:27] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-10 21:37:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-10 21:37:27] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 18 ms.
[2023-03-10 21:37:27] [INFO ] Added : 14 causal constraints over 5 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:37:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:27] [INFO ] Invariant cache hit.
[2023-03-10 21:37:27] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
[2023-03-10 21:37:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:27] [INFO ] Invariant cache hit.
[2023-03-10 21:37:27] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-10 21:37:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:27] [INFO ] Invariant cache hit.
[2023-03-10 21:37:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:28] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-10 21:37:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:37:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:28] [INFO ] Invariant cache hit.
[2023-03-10 21:37:28] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 829 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
[2023-03-10 21:37:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:28] [INFO ] Invariant cache hit.
[2023-03-10 21:37:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 21:37:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-10 21:37:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2023-03-10 21:37:29] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2023-03-10 21:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-10 21:37:29] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 13 ms.
[2023-03-10 21:37:29] [INFO ] Added : 15 causal constraints over 4 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1946 reset in 224 ms.
Product exploration explored 100000 steps with 1961 reset in 233 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:37:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:29] [INFO ] Invariant cache hit.
[2023-03-10 21:37:29] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
[2023-03-10 21:37:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:29] [INFO ] Invariant cache hit.
[2023-03-10 21:37:30] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 21:37:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:30] [INFO ] Invariant cache hit.
[2023-03-10 21:37:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:30] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-10 21:37:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:37:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:30] [INFO ] Invariant cache hit.
[2023-03-10 21:37:30] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 599 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 finished in 5436 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(G(p0)))))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 4 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:37:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-10 21:37:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:30] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
[2023-03-10 21:37:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:30] [INFO ] Invariant cache hit.
[2023-03-10 21:37:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-10 21:37:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:37:30] [INFO ] Invariant cache hit.
[2023-03-10 21:37:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:30] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 333 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 522 ms. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 finished in 627 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 U (X(X(p1)) U (p2&&G(p1))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 16 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-10 21:37:31] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:37:31] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
[2023-03-10 21:37:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:31] [INFO ] Invariant cache hit.
[2023-03-10 21:37:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 21:37:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:31] [INFO ] Invariant cache hit.
[2023-03-10 21:37:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:31] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 345 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ s23 1) (LEQ s0 s49)), p2:(LEQ s0 s49), p1:(LEQ 3 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22232 reset in 285 ms.
Product exploration explored 100000 steps with 22262 reset in 266 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X (OR (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 p1))), (X p1), (X (NOT p0)), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 1370 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10005 steps, including 19 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10004 steps, including 21 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 21:37:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:37:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:35] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-10 21:37:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:35] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-10 21:37:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:35] [INFO ] After 53ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-10 21:37:35] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-10 21:37:35] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:35] [INFO ] Invariant cache hit.
[2023-03-10 21:37:35] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 557306 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557306 steps, saw 137895 distinct states, run finished after 3002 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:37:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:39] [INFO ] Invariant cache hit.
[2023-03-10 21:37:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:39] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:37:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:39] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:39] [INFO ] After 50ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:39] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-10 21:37:39] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:39] [INFO ] Invariant cache hit.
[2023-03-10 21:37:39] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-10 21:37:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:39] [INFO ] Invariant cache hit.
[2023-03-10 21:37:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:39] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-10 21:37:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:37:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:39] [INFO ] Invariant cache hit.
[2023-03-10 21:37:40] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:37:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:40] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:37:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:37:40] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:37:40] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:40] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-10 21:37:40] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X (OR (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 p1))), (X p1), (X (NOT p0)), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 p1)), (F (AND p0 p1 p2)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 26 factoid took 1475 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-10 21:37:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:37:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:42] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 21:37:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:42] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-10 21:37:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 384 ms returned sat
[2023-03-10 21:37:43] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 23 ms.
[2023-03-10 21:37:43] [INFO ] Added : 10 causal constraints over 5 iterations in 71 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:43] [INFO ] Invariant cache hit.
[2023-03-10 21:37:43] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
[2023-03-10 21:37:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:43] [INFO ] Invariant cache hit.
[2023-03-10 21:37:43] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-10 21:37:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:43] [INFO ] Invariant cache hit.
[2023-03-10 21:37:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:44] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-10 21:37:44] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:37:44] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:44] [INFO ] Invariant cache hit.
[2023-03-10 21:37:44] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 779 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND p1 p2))), (X p1), (X (AND (NOT p0) p1)), true, (X (X (AND p1 (NOT p2)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1003 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:37:45] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:45] [INFO ] Invariant cache hit.
[2023-03-10 21:37:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:45] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:37:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:37:45] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:46] [INFO ] After 79ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:46] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-10 21:37:46] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:46] [INFO ] Invariant cache hit.
[2023-03-10 21:37:46] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10007 steps, including 20 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 396957 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396957 steps, saw 100109 distinct states, run finished after 3004 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:37:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:49] [INFO ] Invariant cache hit.
[2023-03-10 21:37:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:49] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:37:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:50] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:50] [INFO ] After 71ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:50] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-10 21:37:50] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:50] [INFO ] Invariant cache hit.
[2023-03-10 21:37:50] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-10 21:37:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:50] [INFO ] Invariant cache hit.
[2023-03-10 21:37:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:50] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-10 21:37:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:37:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:50] [INFO ] Invariant cache hit.
[2023-03-10 21:37:51] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 6 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:37:51] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:37:51] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:37:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:37:51] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:37:51] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:37:51] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-10 21:37:51] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND p1 p2))), (X p1), (X (AND (NOT p0) p1)), true, (X (X (AND p1 (NOT p2)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 21 factoid took 1237 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-10 21:37:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:37:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:37:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:53] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-10 21:37:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:37:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:37:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-10 21:37:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 416 ms returned sat
[2023-03-10 21:37:54] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 26 ms.
[2023-03-10 21:37:54] [INFO ] Added : 10 causal constraints over 5 iterations in 86 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 585 reset in 338 ms.
Product exploration explored 100000 steps with 585 reset in 320 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:55] [INFO ] Invariant cache hit.
[2023-03-10 21:37:55] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
[2023-03-10 21:37:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:55] [INFO ] Invariant cache hit.
[2023-03-10 21:37:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 21:37:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:55] [INFO ] Invariant cache hit.
[2023-03-10 21:37:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:55] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-10 21:37:55] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:37:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:55] [INFO ] Invariant cache hit.
[2023-03-10 21:37:56] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 finished in 25027 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)||(F(p1)&&(p2||X(p0)))) U G(p2)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-10 21:37:56] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:37:56] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
[2023-03-10 21:37:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:56] [INFO ] Invariant cache hit.
[2023-03-10 21:37:56] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-10 21:37:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:56] [INFO ] Invariant cache hit.
[2023-03-10 21:37:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:56] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 374 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s23), p1:(LEQ 2 s0), p0:(LEQ 2 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1507 reset in 280 ms.
Product exploration explored 100000 steps with 1498 reset in 243 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1168 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10002 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:37:59] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:37:59] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:37:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:59] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:37:59] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:37:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:37:59] [INFO ] After 29ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:37:59] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2023-03-10 21:37:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-10 21:37:59] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-10 21:37:59] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 21 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:37:59] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:37:59] [INFO ] Invariant cache hit.
[2023-03-10 21:37:59] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 727911 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 727911 steps, saw 177058 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:38:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:03] [INFO ] Invariant cache hit.
[2023-03-10 21:38:03] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:03] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:38:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:38:03] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:03] [INFO ] After 41ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:03] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-03-10 21:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-10 21:38:03] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-10 21:38:03] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:03] [INFO ] Invariant cache hit.
[2023-03-10 21:38:03] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-10 21:38:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:03] [INFO ] Invariant cache hit.
[2023-03-10 21:38:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:04] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-10 21:38:04] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:38:04] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:04] [INFO ] Invariant cache hit.
[2023-03-10 21:38:04] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:38:04] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:38:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:04] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:38:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:04] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:38:04] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:04] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 21:38:04] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 1200 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:38:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:06] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
[2023-03-10 21:38:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:06] [INFO ] Invariant cache hit.
[2023-03-10 21:38:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-10 21:38:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:06] [INFO ] Invariant cache hit.
[2023-03-10 21:38:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:06] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-10 21:38:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:06] [INFO ] Invariant cache hit.
[2023-03-10 21:38:06] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 715 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 988 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:38:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:08] [INFO ] Invariant cache hit.
[2023-03-10 21:38:08] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-10 21:38:08] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:38:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:08] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:08] [INFO ] After 31ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:08] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2023-03-10 21:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-10 21:38:08] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-10 21:38:08] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:08] [INFO ] Invariant cache hit.
[2023-03-10 21:38:09] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 647724 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647724 steps, saw 158828 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:38:12] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:12] [INFO ] Invariant cache hit.
[2023-03-10 21:38:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:12] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:38:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 21:38:12] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:12] [INFO ] After 44ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:12] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2023-03-10 21:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-10 21:38:13] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-10 21:38:13] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:13] [INFO ] Invariant cache hit.
[2023-03-10 21:38:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 21:38:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:13] [INFO ] Invariant cache hit.
[2023-03-10 21:38:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:13] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-10 21:38:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:38:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:13] [INFO ] Invariant cache hit.
[2023-03-10 21:38:13] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 6 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:38:13] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:38:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:13] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:38:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:38:13] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:38:13] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:13] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-10 21:38:13] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 1190 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 1514 reset in 289 ms.
Product exploration explored 100000 steps with 1518 reset in 284 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:38:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:38:16] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2023-03-10 21:38:16] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:38:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:16] [INFO ] Invariant cache hit.
[2023-03-10 21:38:17] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 64/64 places, 548/548 transitions.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:17] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:17] [INFO ] Invariant cache hit.
[2023-03-10 21:38:17] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
[2023-03-10 21:38:17] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:17] [INFO ] Invariant cache hit.
[2023-03-10 21:38:17] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-10 21:38:17] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:17] [INFO ] Invariant cache hit.
[2023-03-10 21:38:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:17] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-10 21:38:17] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:17] [INFO ] Invariant cache hit.
[2023-03-10 21:38:17] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 finished in 21868 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(G(p1)))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 2 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:17] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-10 21:38:17] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:18] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
[2023-03-10 21:38:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:18] [INFO ] Invariant cache hit.
[2023-03-10 21:38:18] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-10 21:38:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:18] [INFO ] Invariant cache hit.
[2023-03-10 21:38:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:18] [INFO ] Implicit Places using invariants and state equation in 195 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 294 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 477 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s24 s0), p1:(LEQ s23 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 547
Applied a total of 3 rules in 19 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:38:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-10 21:38:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 21:38:18] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
[2023-03-10 21:38:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:18] [INFO ] Invariant cache hit.
[2023-03-10 21:38:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-10 21:38:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:18] [INFO ] Invariant cache hit.
[2023-03-10 21:38:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:19] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 322 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 539 ms. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s23) (LEQ s23 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2731 reset in 256 ms.
Product exploration explored 100000 steps with 2650 reset in 236 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:38:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-10 21:38:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:38:20] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
[2023-03-10 21:38:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:20] [INFO ] Invariant cache hit.
[2023-03-10 21:38:20] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-10 21:38:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:20] [INFO ] Invariant cache hit.
[2023-03-10 21:38:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:20] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-10 21:38:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:38:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:20] [INFO ] Invariant cache hit.
[2023-03-10 21:38:20] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2828 reset in 348 ms.
Product exploration explored 100000 steps with 2737 reset in 336 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:38:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:22] [INFO ] Invariant cache hit.
[2023-03-10 21:38:22] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
[2023-03-10 21:38:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:22] [INFO ] Invariant cache hit.
[2023-03-10 21:38:22] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 21:38:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:22] [INFO ] Invariant cache hit.
[2023-03-10 21:38:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:22] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-10 21:38:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:38:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:22] [INFO ] Invariant cache hit.
[2023-03-10 21:38:23] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 890 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 finished in 4710 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)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 4 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-10 21:38:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:23] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
[2023-03-10 21:38:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:23] [INFO ] Invariant cache hit.
[2023-03-10 21:38:23] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-10 21:38:23] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:23] [INFO ] Invariant cache hit.
[2023-03-10 21:38:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:23] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 386 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 606 ms. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 547
Applied a total of 3 rules in 22 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-10 21:38:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-10 21:38:24] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 21:38:24] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
[2023-03-10 21:38:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:24] [INFO ] Invariant cache hit.
[2023-03-10 21:38:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-10 21:38:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:24] [INFO ] Invariant cache hit.
[2023-03-10 21:38:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:24] [INFO ] Implicit Places using invariants and state equation in 255 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 377 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 646 ms. Remains : 64/68 places, 547/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1746 reset in 267 ms.
Product exploration explored 100000 steps with 1737 reset in 279 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=68 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 234 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-10 21:38:25] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-10 21:38:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:38:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:26] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-10 21:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:38:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:26] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-10 21:38:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 212 ms returned sat
[2023-03-10 21:38:26] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-10 21:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-10 21:38:27] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 27 ms.
[2023-03-10 21:38:27] [INFO ] Added : 28 causal constraints over 7 iterations in 155 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 22 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:38:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:27] [INFO ] Invariant cache hit.
[2023-03-10 21:38:27] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
[2023-03-10 21:38:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:27] [INFO ] Invariant cache hit.
[2023-03-10 21:38:27] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 21:38:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:27] [INFO ] Invariant cache hit.
[2023-03-10 21:38:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:27] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-10 21:38:27] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:38:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:27] [INFO ] Invariant cache hit.
[2023-03-10 21:38:27] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 838 ms. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1099 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 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 41 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 176 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-10 21:38:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:28] [INFO ] Invariant cache hit.
[2023-03-10 21:38:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:28] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 21:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:38:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:28] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-10 21:38:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 213 ms returned sat
[2023-03-10 21:38:29] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2023-03-10 21:38:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-10 21:38:29] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 22 ms.
[2023-03-10 21:38:29] [INFO ] Added : 28 causal constraints over 7 iterations in 139 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1742 reset in 255 ms.
Product exploration explored 100000 steps with 1729 reset in 261 ms.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-10 21:38:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:30] [INFO ] Invariant cache hit.
[2023-03-10 21:38:30] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
[2023-03-10 21:38:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:30] [INFO ] Invariant cache hit.
[2023-03-10 21:38:30] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 21:38:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:30] [INFO ] Invariant cache hit.
[2023-03-10 21:38:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:30] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-10 21:38:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:38:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-10 21:38:30] [INFO ] Invariant cache hit.
[2023-03-10 21:38:30] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 784 ms. Remains : 64/64 places, 547/547 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 finished in 7044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 U (X(X(p1)) U (p2&&G(p1))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-10 21:38:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:32] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
[2023-03-10 21:38:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:32] [INFO ] Invariant cache hit.
[2023-03-10 21:38:32] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-10 21:38:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:32] [INFO ] Invariant cache hit.
[2023-03-10 21:38:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:32] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 394 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 636 ms. Remains : 64/68 places, 548/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ s23 1) (LEQ s0 s49)), p2:(LEQ s0 s49), p1:(LEQ 3 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22126 reset in 341 ms.
Product exploration explored 100000 steps with 22227 reset in 311 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X (OR (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 p1))), (X p1), (X (NOT p0)), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 1949 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 21:38:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:38:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:35] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-10 21:38:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:35] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-10 21:38:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:36] [INFO ] After 100ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-10 21:38:36] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-10 21:38:36] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:36] [INFO ] Invariant cache hit.
[2023-03-10 21:38:36] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 632634 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632634 steps, saw 155266 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:38:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:39] [INFO ] Invariant cache hit.
[2023-03-10 21:38:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:39] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:38:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:39] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:39] [INFO ] After 45ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:40] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-10 21:38:40] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 10 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:40] [INFO ] Invariant cache hit.
[2023-03-10 21:38:40] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-10 21:38:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:40] [INFO ] Invariant cache hit.
[2023-03-10 21:38:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:40] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-10 21:38:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:38:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:40] [INFO ] Invariant cache hit.
[2023-03-10 21:38:40] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:38:40] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:38:40] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:38:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:40] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:38:40] [INFO ] After 45ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:40] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-10 21:38:40] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X (OR (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 p1))), (X p1), (X (NOT p0)), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 p1)), (F (AND p0 p1 p2)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 26 factoid took 1215 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-10 21:38:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:38:42] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 21:38:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:42] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 21:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:38:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:42] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-10 21:38:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 277 ms returned sat
[2023-03-10 21:38:43] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 23 ms.
[2023-03-10 21:38:43] [INFO ] Added : 10 causal constraints over 5 iterations in 69 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:43] [INFO ] Invariant cache hit.
[2023-03-10 21:38:43] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
[2023-03-10 21:38:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:43] [INFO ] Invariant cache hit.
[2023-03-10 21:38:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-10 21:38:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:43] [INFO ] Invariant cache hit.
[2023-03-10 21:38:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:43] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-10 21:38:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:38:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:43] [INFO ] Invariant cache hit.
[2023-03-10 21:38:44] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 801 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND p1 p2))), (X p1), (X (AND (NOT p0) p1)), true, (X (X (AND p1 (NOT p2)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1049 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:38:45] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:45] [INFO ] Invariant cache hit.
[2023-03-10 21:38:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:46] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:38:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:46] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:46] [INFO ] After 83ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:46] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-10 21:38:46] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:46] [INFO ] Invariant cache hit.
[2023-03-10 21:38:46] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 457068 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457068 steps, saw 115046 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:38:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:50] [INFO ] Invariant cache hit.
[2023-03-10 21:38:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:50] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:38:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:50] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:50] [INFO ] After 56ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:50] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-10 21:38:50] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:50] [INFO ] Invariant cache hit.
[2023-03-10 21:38:50] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-10 21:38:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:50] [INFO ] Invariant cache hit.
[2023-03-10 21:38:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:50] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-10 21:38:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:38:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:50] [INFO ] Invariant cache hit.
[2023-03-10 21:38:51] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:38:51] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:38:51] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:38:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:51] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:38:51] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:38:51] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-10 21:38:51] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND p1 p2))), (X p1), (X (AND (NOT p0) p1)), true, (X (X (AND p1 (NOT p2)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 21 factoid took 927 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
[2023-03-10 21:38:52] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:38:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:52] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-10 21:38:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:38:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:38:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-10 21:38:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 279 ms returned sat
[2023-03-10 21:38:53] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 17 ms.
[2023-03-10 21:38:53] [INFO ] Added : 10 causal constraints over 5 iterations in 58 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 586 reset in 232 ms.
Product exploration explored 100000 steps with 585 reset in 237 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:54] [INFO ] Invariant cache hit.
[2023-03-10 21:38:54] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
[2023-03-10 21:38:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:54] [INFO ] Invariant cache hit.
[2023-03-10 21:38:54] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 21:38:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:54] [INFO ] Invariant cache hit.
[2023-03-10 21:38:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:54] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-10 21:38:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:38:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:54] [INFO ] Invariant cache hit.
[2023-03-10 21:38:54] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 650 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 finished in 23501 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)||(F(p1)&&(p2||X(p0)))) U G(p2)))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-10 21:38:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:55] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
[2023-03-10 21:38:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:55] [INFO ] Invariant cache hit.
[2023-03-10 21:38:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-10 21:38:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:55] [INFO ] Invariant cache hit.
[2023-03-10 21:38:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:55] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 291 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 478 ms. Remains : 64/68 places, 548/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s23), p1:(LEQ 2 s0), p0:(LEQ 2 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1507 reset in 211 ms.
Product exploration explored 100000 steps with 1513 reset in 219 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 845 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:38:57] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:38:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:38:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:57] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:38:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:38:57] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:38:57] [INFO ] After 41ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:38:57] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2023-03-10 21:38:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-10 21:38:57] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-10 21:38:57] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:38:57] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:38:57] [INFO ] Invariant cache hit.
[2023-03-10 21:38:58] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 734317 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 734317 steps, saw 178441 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:39:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:01] [INFO ] Invariant cache hit.
[2023-03-10 21:39:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:01] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:39:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:01] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:39:01] [INFO ] After 31ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:01] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-10 21:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-10 21:39:01] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-10 21:39:01] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:39:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:01] [INFO ] Invariant cache hit.
[2023-03-10 21:39:01] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-10 21:39:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:02] [INFO ] Invariant cache hit.
[2023-03-10 21:39:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:39:02] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-10 21:39:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 21:39:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:02] [INFO ] Invariant cache hit.
[2023-03-10 21:39:02] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:39:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:39:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:39:02] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:39:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:02] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:39:02] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:02] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 21:39:02] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 846 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:39:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:39:03] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:39:04] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
[2023-03-10 21:39:04] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:04] [INFO ] Invariant cache hit.
[2023-03-10 21:39:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 21:39:04] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:04] [INFO ] Invariant cache hit.
[2023-03-10 21:39:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:39:04] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-10 21:39:04] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:04] [INFO ] Invariant cache hit.
[2023-03-10 21:39:04] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 735 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:39:05] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:05] [INFO ] Invariant cache hit.
[2023-03-10 21:39:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:05] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:39:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:05] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:39:05] [INFO ] After 32ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:06] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2023-03-10 21:39:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-10 21:39:06] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-10 21:39:06] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:39:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:06] [INFO ] Invariant cache hit.
[2023-03-10 21:39:06] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 740216 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 740216 steps, saw 179675 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 21:39:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:09] [INFO ] Invariant cache hit.
[2023-03-10 21:39:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:09] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:39:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:09] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:39:09] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:09] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2023-03-10 21:39:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-10 21:39:09] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-10 21:39:09] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:39:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:09] [INFO ] Invariant cache hit.
[2023-03-10 21:39:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-10 21:39:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:09] [INFO ] Invariant cache hit.
[2023-03-10 21:39:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:39:10] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-10 21:39:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:39:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:10] [INFO ] Invariant cache hit.
[2023-03-10 21:39:10] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
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 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 6 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 127 rows 61 cols
[2023-03-10 21:39:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 21:39:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 21:39:10] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 21:39:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 21:39:10] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:39:10] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 21:39:10] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-10 21:39:10] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (NOT p1)), (F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 18 factoid took 1085 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 1505 reset in 234 ms.
Product exploration explored 100000 steps with 1506 reset in 205 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:39:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-10 21:39:13] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 21:39:13] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
[2023-03-10 21:39:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:39:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:13] [INFO ] Invariant cache hit.
[2023-03-10 21:39:13] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 476 ms. Remains : 64/64 places, 548/548 transitions.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-10 21:39:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:13] [INFO ] Invariant cache hit.
[2023-03-10 21:39:13] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
[2023-03-10 21:39:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:13] [INFO ] Invariant cache hit.
[2023-03-10 21:39:13] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 21:39:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:13] [INFO ] Invariant cache hit.
[2023-03-10 21:39:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 21:39:14] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-10 21:39:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-10 21:39:14] [INFO ] Invariant cache hit.
[2023-03-10 21:39:14] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 64/64 places, 548/548 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 finished in 19554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-10 21:39:14] [INFO ] Flatten gal took : 68 ms
[2023-03-10 21:39:14] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-10 21:39:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 548 transitions and 4070 arcs took 13 ms.
Total runtime 146740 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BridgeAndVehicles-PT-V20P20N10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678484615199

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.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: 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: LAUNCH task # 11 (type EXCL) for 10 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
lola: time limit : 399 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 4/399 4/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 526388 m, 105277 m/sec, 2091719 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 9/399 7/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 1084013 m, 111525 m/sec, 4401514 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 14/399 11/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 1651663 m, 113530 m/sec, 6783897 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 19/399 15/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 2232540 m, 116175 m/sec, 9239679 t fired, .

Time elapsed: 20 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 7
lola: FINISHED task # 11 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
lola: result : true
lola: markings : 2664074
lola: fired transitions : 11059517
lola: time used : 23.000000
lola: memory pages used : 17
lola: LAUNCH task # 24 (type EXCL) for 23 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
lola: time limit : 447 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 LTL EXCL 1/447 3/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 354364 m, 70872 m/sec, 1286971 t fired, .

Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 LTL EXCL 6/447 10/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 1492703 m, 227667 m/sec, 5361794 t fired, .

Time elapsed: 30 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 LTL EXCL 11/447 17/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 2623319 m, 226123 m/sec, 9612019 t fired, .

Time elapsed: 35 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 LTL EXCL 16/447 25/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 3790201 m, 233376 m/sec, 13998796 t fired, .

Time elapsed: 40 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 LTL EXCL 21/447 32/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 4950226 m, 232005 m/sec, 18304206 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 24 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 21 (type EXCL) for 16 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
lola: time limit : 507 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 LTL EXCL 5/507 8/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 1126396 m, 225279 m/sec, 3634990 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 LTL EXCL 10/507 14/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 2179272 m, 210575 m/sec, 7168492 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 LTL EXCL 15/507 21/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 3208686 m, 205882 m/sec, 10684830 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 LTL EXCL 20/507 28/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 4281609 m, 214584 m/sec, 14352192 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 21 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 1 (type EXCL) for 0 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
lola: time limit : 587 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
lola: result : true
lola: markings : 819054
lola: fired transitions : 2348722
lola: time used : 3.000000
lola: memory pages used : 6
lola: LAUNCH task # 8 (type EXCL) for 3 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
lola: time limit : 704 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 2/704 2/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 237042 m, 47408 m/sec, 1116177 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 7/704 5/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 726521 m, 97895 m/sec, 3536963 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 12/704 8/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 1206581 m, 96012 m/sec, 5932902 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 17/704 11/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 1709356 m, 100555 m/sec, 8484672 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 1 0 2 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 23/704 14/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 2136505 m, 85429 m/sec, 10643882 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: FINISHED task # 8 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
lola: result : true
lola: markings : 2221707
lola: fired transitions : 11053034
lola: time used : 23.000000
lola: memory pages used : 15
lola: LAUNCH task # 27 (type EXCL) for 26 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13
lola: time limit : 874 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 5/874 3/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 355455 m, 71091 m/sec, 1074654 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 10/874 5/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 739752 m, 76859 m/sec, 2297693 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 15/874 8/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 1120572 m, 76164 m/sec, 3557505 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 20/874 10/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 1469515 m, 69788 m/sec, 4738589 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 25/874 13/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 1851879 m, 76472 m/sec, 6047396 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 30/874 15/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 2233987 m, 76421 m/sec, 7330324 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 35/874 17/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 2565406 m, 66283 m/sec, 8477282 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 40/874 19/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 2902988 m, 67516 m/sec, 9623568 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 45/874 22/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 3267134 m, 72829 m/sec, 10860428 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 50/874 24/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 3678342 m, 82241 m/sec, 12261902 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 LTL EXCL 55/874 27/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 4024265 m, 69184 m/sec, 13517497 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: FINISHED task # 27 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13
lola: result : true
lola: markings : 4410174
lola: fired transitions : 14817435
lola: time used : 59.000000
lola: memory pages used : 29
lola: LAUNCH task # 14 (type EXCL) for 13 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05
lola: time limit : 1146 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 1/1146 1/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 67500 m, 13500 m/sec, 186596 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 6/1146 6/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 792042 m, 144908 m/sec, 2359600 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 11/1146 10/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 1504919 m, 142575 m/sec, 4558783 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 16/1146 14/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 2117489 m, 122514 m/sec, 6699491 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 21/1146 18/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 2715326 m, 119567 m/sec, 9156357 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 26/1146 22/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 3279140 m, 112762 m/sec, 11666848 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 31/1146 25/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 3828139 m, 109799 m/sec, 14221625 t fired, .

Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 36/1146 28/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 4343341 m, 103040 m/sec, 16959602 t fired, .

Time elapsed: 196 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 41/1146 32/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 4864461 m, 104224 m/sec, 19891743 t fired, .

Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 14 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 6 (type EXCL) for 3 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
lola: time limit : 1697 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
lola: result : false
lola: markings : 16426
lola: fired transitions : 45173
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 19 (type EXCL) for 16 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
lola: time limit : 3394 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 5/3394 4/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 470039 m, 94007 m/sec, 1501638 t fired, .

Time elapsed: 211 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 10/3394 7/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 964372 m, 98866 m/sec, 3144450 t fired, .

Time elapsed: 216 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 15/3394 10/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 1460076 m, 99140 m/sec, 4813279 t fired, .

Time elapsed: 221 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 20/3394 13/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 1949406 m, 97866 m/sec, 6495270 t fired, .

Time elapsed: 226 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 25/3394 16/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 2410173 m, 92153 m/sec, 8081537 t fired, .

Time elapsed: 231 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 30/3394 19/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 2853721 m, 88709 m/sec, 9618408 t fired, .

Time elapsed: 236 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 35/3394 22/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 3297583 m, 88772 m/sec, 11161038 t fired, .

Time elapsed: 241 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 40/3394 25/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 3743566 m, 89196 m/sec, 12724501 t fired, .

Time elapsed: 246 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 45/3394 28/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 4181470 m, 87580 m/sec, 14239538 t fired, .

Time elapsed: 251 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 1 0 2 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 LTL EXCL 50/3394 31/32 BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 4627143 m, 89134 m/sec, 15789500 t fired, .

Time elapsed: 256 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 19 (type EXCL) for BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ 0 0 0 0 2 0 2 0
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02: CONJ false LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03: LTL true LTL model checker
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05: LTL unknown AGGR
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07: CONJ unknown CONJ
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08: LTL unknown AGGR
BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13: LTL true LTL model checker


Time elapsed: 261 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-V20P20N10"
export BK_EXAMINATION="LTLCardinality"
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-V20P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692200203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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