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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.8K Feb 25 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:13 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.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 45K 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-COL-V80P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678480472629

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-COL-V80P20N10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 20:34:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 20:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:34:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-10 20:34:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 20:34:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 445 ms
[2023-03-10 20:34:34] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 20:34:35] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2023-03-10 20:34:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10000 steps, including 2 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 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 20:34:35] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-10 20:34:35] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 20:34:35] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1
[2023-03-10 20:34:35] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 20:34:35] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-10 20:34:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 20:34:35] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-10 20:34:35] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 20:34:35] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 93 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=93 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-10 20:34:36] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-10 20:34:36] [INFO ] Flatten gal took : 25 ms
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 20:34:36] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-10 20:34:36] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 81 ms.
[2023-03-10 20:34:36] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 15 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 51 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:34:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-10 20:34:36] [INFO ] Computed 7 place invariants in 23 ms
[2023-03-10 20:34:36] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
[2023-03-10 20:34:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:34:36] [INFO ] Invariant cache hit.
[2023-03-10 20:34:37] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-10 20:34:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:34:37] [INFO ] Invariant cache hit.
[2023-03-10 20:34:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:34:38] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2023-03-10 20:34:38] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:34:38] [INFO ] Invariant cache hit.
[2023-03-10 20:34:39] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2999 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 15 out of 188 places after structural reductions.
[2023-03-10 20:34:39] [INFO ] Flatten gal took : 185 ms
[2023-03-10 20:34:39] [INFO ] Flatten gal took : 157 ms
[2023-03-10 20:34:39] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:34:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:34:40] [INFO ] Invariant cache hit.
[2023-03-10 20:34:40] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-10 20:34:40] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-10 20:34:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 20:34:40] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-10 20:34:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:34:41] [INFO ] After 133ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-10 20:34:41] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-10 20:34:41] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 425 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 20:34:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 20:34:41] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-10 20:34:42] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1234 ms. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264020 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 264020 steps, saw 72821 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 20:34:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:34:45] [INFO ] Invariant cache hit.
[2023-03-10 20:34:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:34:46] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 20:34:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:34:46] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 20:34:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:34:46] [INFO ] After 89ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 20:34:46] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 393 ms.
[2023-03-10 20:34:47] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 234 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 402 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 20:34:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:34:47] [INFO ] Invariant cache hit.
[2023-03-10 20:34:48] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-10 20:34:48] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:34:48] [INFO ] Invariant cache hit.
[2023-03-10 20:34:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:34:49] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2217 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 170 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2790 ms. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 330682 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330682 steps, saw 90521 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 20:34:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-10 20:34:53] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-10 20:34:53] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:34:53] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 20:34:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:34:53] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 20:34:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:34:53] [INFO ] After 79ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 20:34:53] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-10 20:34:54] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 195 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 157 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 20:34:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:34:54] [INFO ] Invariant cache hit.
[2023-03-10 20:34:54] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-10 20:34:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:34:54] [INFO ] Invariant cache hit.
[2023-03-10 20:34:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:34:55] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2023-03-10 20:34:56] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-10 20:34:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:34:56] [INFO ] Invariant cache hit.
[2023-03-10 20:34:56] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2582 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
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 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 181 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 179 transition count 365
Applied a total of 1746 rules in 25 ms. Remains 179 /183 variables (removed 4) and now considering 365/2107 (removed 1742) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 365 rows 179 cols
[2023-03-10 20:34:56] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 20:34:56] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 20:34:57] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 20:34:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 20:34:57] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 20:34:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 20:34:57] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 20:34:57] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-10 20:34:57] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 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((X(F(p0))||(p1&&X(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 23 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:34:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 20:34:57] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-10 20:34:58] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
[2023-03-10 20:34:58] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:34:58] [INFO ] Invariant cache hit.
[2023-03-10 20:34:59] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-10 20:34:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:34:59] [INFO ] Invariant cache hit.
[2023-03-10 20:34:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:00] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2023-03-10 20:35:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:00] [INFO ] Invariant cache hit.
[2023-03-10 20:35:01] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/188 places, 2108/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3245 ms. Remains : 187/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s169), p0:(GT s84 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1099 ms.
Product exploration explored 100000 steps with 50000 reset in 744 ms.
Computed a total of 170 stabilizing places and 324 stable transitions
Graph (complete) has 4309 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 170 stabilizing places and 324 stable transitions
Detected a total of 170/187 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 finished in 5745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1&&X(p0))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 32 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:35:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:03] [INFO ] Invariant cache hit.
[2023-03-10 20:35:04] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
[2023-03-10 20:35:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:04] [INFO ] Invariant cache hit.
[2023-03-10 20:35:04] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-10 20:35:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:04] [INFO ] Invariant cache hit.
[2023-03-10 20:35:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:06] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned [84, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1730 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2534 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p1:(LEQ s82 (ADD s170 s171)), p0:(LEQ 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5328 steps with 1566 reset in 58 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 finished in 2834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1&&F(G(p2)))))))'
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 604 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:35:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 20:35:06] [INFO ] Computed 6 place invariants in 9 ms
[2023-03-10 20:35:07] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
[2023-03-10 20:35:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:07] [INFO ] Invariant cache hit.
[2023-03-10 20:35:08] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-10 20:35:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:08] [INFO ] Invariant cache hit.
[2023-03-10 20:35:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:09] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1488 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 303 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3129 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s83), p0:(AND (GT s168 1) (LEQ (ADD s171 s172) s0) (LEQ s84 s82)), p2:(LEQ s166 (ADD s184 s185))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 148 reset in 954 ms.
Product exploration explored 100000 steps with 148 reset in 698 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 844 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 665 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (OR p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 987 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-10 20:35:13] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 20:35:13] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 20:35:14] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 20:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:35:14] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-10 20:35:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:35:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:35:16] [INFO ] [Nat]Absence check using state equation in 284 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (OR p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 581 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03 finished in 10312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(G(p1)&&X(p2))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 23 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:35:16] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 20:35:16] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-10 20:35:17] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
[2023-03-10 20:35:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:17] [INFO ] Invariant cache hit.
[2023-03-10 20:35:17] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-10 20:35:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:17] [INFO ] Invariant cache hit.
[2023-03-10 20:35:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:19] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1585 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 17 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2356 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(GT 3 s83), p1:(LEQ 3 s167), p2:(LEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 400 reset in 662 ms.
Product exploration explored 100000 steps with 396 reset in 522 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (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 11 factoid took 705 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 234 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (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 (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 915 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-10 20:35:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 20:35:22] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 20:35:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:35:24] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2023-03-10 20:35:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:35:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:35:25] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-10 20:35:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 139 ms returned sat
[2023-03-10 20:35:25] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 145 ms.
[2023-03-10 20:35:25] [INFO ] Added : 11 causal constraints over 4 iterations in 504 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 32 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:35:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:26] [INFO ] Invariant cache hit.
[2023-03-10 20:35:26] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
[2023-03-10 20:35:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:26] [INFO ] Invariant cache hit.
[2023-03-10 20:35:27] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-10 20:35:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:27] [INFO ] Invariant cache hit.
[2023-03-10 20:35:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:29] [INFO ] Implicit Places using invariants and state equation in 2751 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
[2023-03-10 20:35:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:29] [INFO ] Invariant cache hit.
[2023-03-10 20:35:30] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4620 ms. Remains : 186/186 places, 2108/2108 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4145 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (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 11 factoid took 700 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 316 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (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 (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 775 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-10 20:35:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:32] [INFO ] Invariant cache hit.
[2023-03-10 20:35:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 20:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:35:34] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2023-03-10 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:35:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:35:35] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-10 20:35:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 159 ms returned sat
[2023-03-10 20:35:35] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 153 ms.
[2023-03-10 20:35:35] [INFO ] Added : 11 causal constraints over 4 iterations in 470 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 403 reset in 716 ms.
Product exploration explored 100000 steps with 396 reset in 555 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 12 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 6 ms
Applied a total of 1 rules in 383 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:35:38] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 20:35:38] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-10 20:35:38] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
[2023-03-10 20:35:38] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-10 20:35:38] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:38] [INFO ] Invariant cache hit.
[2023-03-10 20:35:39] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/186 places, 2108/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1811 ms. Remains : 186/186 places, 2108/2108 transitions.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:35:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 20:35:39] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 20:35:40] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
[2023-03-10 20:35:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:40] [INFO ] Invariant cache hit.
[2023-03-10 20:35:40] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-10 20:35:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:40] [INFO ] Invariant cache hit.
[2023-03-10 20:35:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:43] [INFO ] Implicit Places using invariants and state equation in 2929 ms returned []
Implicit Place search using SMT with State Equation took 3191 ms to find 0 implicit places.
[2023-03-10 20:35:43] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:43] [INFO ] Invariant cache hit.
[2023-03-10 20:35:44] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4768 ms. Remains : 186/186 places, 2108/2108 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 finished in 27816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&F((!p0&&X((!p0 U (p1||G(!p0)))))))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 24 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 20:35:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 20:35:44] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 20:35:45] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
[2023-03-10 20:35:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:35:45] [INFO ] Invariant cache hit.
[2023-03-10 20:35:45] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-10 20:35:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:35:45] [INFO ] Invariant cache hit.
[2023-03-10 20:35:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:46] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1620 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 22 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2375 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, true, true, true, true, p0, (AND p0 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s165 (ADD s167 s168)), p1:(GT (ADD s167 s168) s166)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05 finished in 2728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(X(p1) U (X(G(p1))||(p2&&X(p1)))))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 26 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:35:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 20:35:47] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-10 20:35:47] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
[2023-03-10 20:35:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:47] [INFO ] Invariant cache hit.
[2023-03-10 20:35:48] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-10 20:35:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:35:48] [INFO ] Invariant cache hit.
[2023-03-10 20:35:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:49] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2010 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2771 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 3 s167) (LEQ 1 s167)), p2:(GT 1 s167), p1:(GT 3 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 692 ms.
Product exploration explored 100000 steps with 25000 reset in 645 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT 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 based reduction with 8 factoid took 467 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:35:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-10 20:35:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 20:35:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT 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 p2 (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1 (NOT p0))), (F (NOT (AND p2 p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 10 factoid took 339 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 finished in 5637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 208 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 20:35:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 20:35:53] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 20:35:53] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
[2023-03-10 20:35:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:35:53] [INFO ] Invariant cache hit.
[2023-03-10 20:35:54] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-10 20:35:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:35:54] [INFO ] Invariant cache hit.
[2023-03-10 20:35:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:55] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1949 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 196 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3105 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 593 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08 finished in 3194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 194 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 20:35:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-10 20:35:56] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-10 20:35:57] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
[2023-03-10 20:35:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:35:57] [INFO ] Invariant cache hit.
[2023-03-10 20:35:57] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-10 20:35:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:35:57] [INFO ] Invariant cache hit.
[2023-03-10 20:35:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:35:58] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned [84, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1578 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 186 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2745 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s82)], 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 168 reset in 848 ms.
Product exploration explored 100000 steps with 168 reset in 610 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 3979 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 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, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
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 220 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)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
[2023-03-10 20:36:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-10 20:36:00] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 20:36:01] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 20:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:02] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-10 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:36:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:03] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2023-03-10 20:36:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 237 ms returned sat
[2023-03-10 20:36:03] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
[2023-03-10 20:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2023-03-10 20:36:04] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 85 ms.
[2023-03-10 20:36:04] [INFO ] Added : 79 causal constraints over 19 iterations in 731 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 162 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 20:36:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:04] [INFO ] Invariant cache hit.
[2023-03-10 20:36:05] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
[2023-03-10 20:36:05] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:05] [INFO ] Invariant cache hit.
[2023-03-10 20:36:05] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-10 20:36:05] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:05] [INFO ] Invariant cache hit.
[2023-03-10 20:36:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:07] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
[2023-03-10 20:36:07] [INFO ] Redundant transitions in 186 ms returned []
[2023-03-10 20:36:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:07] [INFO ] Invariant cache hit.
[2023-03-10 20:36:08] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3619 ms. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 3979 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 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 151 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 32 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 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 152 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-10 20:36:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:08] [INFO ] Invariant cache hit.
[2023-03-10 20:36:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:09] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2023-03-10 20:36:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:36:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:13] [INFO ] [Nat]Absence check using state equation in 3425 ms returned sat
[2023-03-10 20:36:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 98 ms returned sat
[2023-03-10 20:36:14] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-10 20:36:17] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3229 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 168 reset in 601 ms.
Product exploration explored 100000 steps with 168 reset in 610 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 136 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 20:36:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:18] [INFO ] Invariant cache hit.
[2023-03-10 20:36:19] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
[2023-03-10 20:36:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:19] [INFO ] Invariant cache hit.
[2023-03-10 20:36:19] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-10 20:36:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:19] [INFO ] Invariant cache hit.
[2023-03-10 20:36:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:20] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
[2023-03-10 20:36:20] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-10 20:36:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:20] [INFO ] Invariant cache hit.
[2023-03-10 20:36:21] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2978 ms. Remains : 184/184 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 finished in 25498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 21 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 20:36:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 20:36:21] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-10 20:36:22] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
[2023-03-10 20:36:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:22] [INFO ] Invariant cache hit.
[2023-03-10 20:36:22] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-10 20:36:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:22] [INFO ] Invariant cache hit.
[2023-03-10 20:36:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:24] [INFO ] Implicit Places using invariants and state equation in 2288 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2563 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3235 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 finished in 3494 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 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 181 transition count 2104
Applied a total of 10 rules in 282 ms. Remains 181 /188 variables (removed 7) and now considering 2104/2108 (removed 4) transitions.
[2023-03-10 20:36:25] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2023-03-10 20:36:25] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-10 20:36:25] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-10 20:36:25] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2023-03-10 20:36:25] [INFO ] Invariant cache hit.
[2023-03-10 20:36:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:26] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1401 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/188 places, 2104/2108 transitions.
Applied a total of 0 rules in 195 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1879 ms. Remains : 179/188 places, 2104/2108 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-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:(LEQ 2 s81)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 499 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13 finished in 2015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (!p0&&X(X(G(p0)))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 23 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:36:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-10 20:36:27] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 20:36:27] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
[2023-03-10 20:36:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:27] [INFO ] Invariant cache hit.
[2023-03-10 20:36:28] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-10 20:36:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:28] [INFO ] Invariant cache hit.
[2023-03-10 20:36:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:29] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1626 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2507 ms. Remains : 184/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, true, (NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 196 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 finished in 2704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||G(p0)))||F((G(F(p2))||(F(p2)&&X(!p2)))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 11 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:36:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-10 20:36:29] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-10 20:36:30] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
[2023-03-10 20:36:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:30] [INFO ] Invariant cache hit.
[2023-03-10 20:36:30] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-10 20:36:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:30] [INFO ] Invariant cache hit.
[2023-03-10 20:36:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:32] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned [84, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1644 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 10 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2301 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(LEQ 1 s82), p1:(AND (GT 3 s167) (GT 3 s166)), p0:(GT 3 s167)], 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 3973 reset in 660 ms.
Product exploration explored 100000 steps with 3960 reset in 496 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 518 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (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 p2)]
Knowledge based reduction with 9 factoid took 507 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 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
[2023-03-10 20:36:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-10 20:36:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 20:36:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:35] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2023-03-10 20:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:36:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 20:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:39] [INFO ] [Nat]Absence check using state equation in 3686 ms returned sat
[2023-03-10 20:36:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 484 ms returned sat
[2023-03-10 20:36:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 70 ms.
[2023-03-10 20:36:41] [INFO ] Added : 92 causal constraints over 23 iterations in 976 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 201 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-10 20:36:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:41] [INFO ] Invariant cache hit.
[2023-03-10 20:36:42] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
[2023-03-10 20:36:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:42] [INFO ] Invariant cache hit.
[2023-03-10 20:36:42] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-10 20:36:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:42] [INFO ] Invariant cache hit.
[2023-03-10 20:36:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:43] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-10 20:36:43] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-10 20:36:43] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:43] [INFO ] Invariant cache hit.
[2023-03-10 20:36:44] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2765 ms. Remains : 185/185 places, 2108/2108 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 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 33 ms :[(NOT p2)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 189 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 29 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
[2023-03-10 20:36:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-10 20:36:44] [INFO ] Invariant cache hit.
[2023-03-10 20:36:45] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 20:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:46] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2023-03-10 20:36:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:36:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:36:47] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-10 20:36:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 47 ms returned sat
[2023-03-10 20:36:47] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 0 ms to minimize.
[2023-03-10 20:36:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 787 ms
[2023-03-10 20:36:48] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 81 ms.
[2023-03-10 20:36:49] [INFO ] Added : 67 causal constraints over 16 iterations in 1074 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
Product exploration explored 100000 steps with 3908 reset in 748 ms.
Product exploration explored 100000 steps with 4030 reset in 619 ms.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 138 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 20:36:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-10 20:36:50] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 20:36:51] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
[2023-03-10 20:36:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:51] [INFO ] Invariant cache hit.
[2023-03-10 20:36:51] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-10 20:36:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:51] [INFO ] Invariant cache hit.
[2023-03-10 20:36:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:52] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2023-03-10 20:36:52] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-10 20:36:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:52] [INFO ] Invariant cache hit.
[2023-03-10 20:36:53] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/185 places, 2107/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2953 ms. Remains : 184/185 places, 2107/2108 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 finished in 23718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(G(p1)&&X(p2))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 70 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-10 20:36:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-10 20:36:53] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-10 20:36:54] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2023-03-10 20:36:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:54] [INFO ] Invariant cache hit.
[2023-03-10 20:36:55] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-10 20:36:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:36:55] [INFO ] Invariant cache hit.
[2023-03-10 20:36:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:36:56] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1359 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 185/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 29 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2212 ms. Remains : 185/188 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(GT 3 s83), p1:(LEQ 3 s166), p2:(LEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 412 reset in 667 ms.
Product exploration explored 100000 steps with 418 reset in 518 ms.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (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 11 factoid took 541 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 228 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (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 (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 717 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-10 20:36:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-10 20:36:59] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 20:37:00] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 20:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:37:00] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2023-03-10 20:37:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:37:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:37:01] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-10 20:37:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:37:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 91 ms returned sat
[2023-03-10 20:37:02] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 1 ms to minimize.
[2023-03-10 20:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-10 20:37:02] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 74 ms.
[2023-03-10 20:37:02] [INFO ] Added : 12 causal constraints over 4 iterations in 321 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 18 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 20:37:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:02] [INFO ] Invariant cache hit.
[2023-03-10 20:37:03] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
[2023-03-10 20:37:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:03] [INFO ] Invariant cache hit.
[2023-03-10 20:37:03] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-10 20:37:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:03] [INFO ] Invariant cache hit.
[2023-03-10 20:37:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:37:04] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2023-03-10 20:37:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:04] [INFO ] Invariant cache hit.
[2023-03-10 20:37:05] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2994 ms. Remains : 185/185 places, 2107/2107 transitions.
Computed a total of 168 stabilizing places and 323 stable transitions
Graph (complete) has 4143 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/185 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (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 11 factoid took 697 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 253 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (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 (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 776 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
[2023-03-10 20:37:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:07] [INFO ] Invariant cache hit.
[2023-03-10 20:37:08] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 20:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:37:09] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2023-03-10 20:37:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:37:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 20:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:37:10] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-10 20:37:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:37:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 130 ms returned sat
[2023-03-10 20:37:10] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 0 ms to minimize.
[2023-03-10 20:37:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2023-03-10 20:37:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 60 ms.
[2023-03-10 20:37:11] [INFO ] Added : 12 causal constraints over 4 iterations in 291 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 416 reset in 614 ms.
Product exploration explored 100000 steps with 409 reset in 497 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 137 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 20:37:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:13] [INFO ] Invariant cache hit.
[2023-03-10 20:37:13] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
[2023-03-10 20:37:13] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-10 20:37:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:13] [INFO ] Invariant cache hit.
[2023-03-10 20:37:14] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1553 ms. Remains : 185/185 places, 2107/2107 transitions.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 9 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-10 20:37:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:14] [INFO ] Invariant cache hit.
[2023-03-10 20:37:15] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
[2023-03-10 20:37:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:15] [INFO ] Invariant cache hit.
[2023-03-10 20:37:15] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-10 20:37:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:15] [INFO ] Invariant cache hit.
[2023-03-10 20:37:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-10 20:37:16] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2023-03-10 20:37:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-10 20:37:16] [INFO ] Invariant cache hit.
[2023-03-10 20:37:17] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3138 ms. Remains : 185/185 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 finished in 24238 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||G(p0)))||F((G(F(p2))||(F(p2)&&X(!p2)))))))'
[2023-03-10 20:37:18] [INFO ] Flatten gal took : 83 ms
[2023-03-10 20:37:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 20:37:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 2108 transitions and 15950 arcs took 19 ms.
Total runtime 163686 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BridgeAndVehicles-COL-V80P20N10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1678480863859

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09
lola: time limit : 1199 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-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1199 1/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 136521 m, 27304 m/sec, 350134 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1199 2/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 297324 m, 32160 m/sec, 765692 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1199 4/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 474380 m, 35411 m/sec, 1244774 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1199 5/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 636490 m, 32422 m/sec, 1715162 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1199 6/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 806471 m, 33996 m/sec, 2242879 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1199 7/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 970215 m, 32748 m/sec, 2764258 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/1199 8/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 1141566 m, 34270 m/sec, 3288791 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/1199 9/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 1306069 m, 32900 m/sec, 3837531 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/1199 10/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 1447412 m, 28268 m/sec, 4234187 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/1199 11/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 1619519 m, 34421 m/sec, 4798961 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/1199 12/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 1790674 m, 34231 m/sec, 5354766 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/1199 13/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 1957787 m, 33422 m/sec, 5903172 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/1199 15/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 2126516 m, 33745 m/sec, 6460392 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 69/1199 16/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 2294639 m, 33624 m/sec, 7014091 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 74/1199 17/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 2445725 m, 30217 m/sec, 7520848 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 79/1199 17/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 2563376 m, 23530 m/sec, 7818830 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 84/1199 18/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 2673167 m, 21958 m/sec, 8182164 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 89/1199 19/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 2785894 m, 22545 m/sec, 8552425 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 94/1199 20/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 2937092 m, 30239 m/sec, 9044434 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 99/1199 21/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 3065208 m, 25623 m/sec, 9397067 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 104/1199 22/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 3239518 m, 34862 m/sec, 9978118 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 109/1199 23/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 3412033 m, 34503 m/sec, 10553923 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 114/1199 24/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 3581479 m, 33889 m/sec, 11110491 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 119/1199 25/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 3752771 m, 34258 m/sec, 11685278 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 124/1199 27/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 3924257 m, 34297 m/sec, 12258330 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 129/1199 28/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 4094125 m, 33973 m/sec, 12827617 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 134/1199 29/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 4262292 m, 33633 m/sec, 13390168 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 139/1199 30/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 4403872 m, 28316 m/sec, 13856276 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 144/1199 31/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 4551175 m, 29460 m/sec, 14432304 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 149/1199 32/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 4709070 m, 31579 m/sec, 14924132 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 154/1199 32/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 4820287 m, 22243 m/sec, 15201075 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15
lola: time limit : 1720 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-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1720 6/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 657491 m, 131498 m/sec, 1909457 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1720 11/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 1342413 m, 136984 m/sec, 3853522 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1720 16/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 2024454 m, 136408 m/sec, 5768122 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1720 22/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 2732537 m, 141616 m/sec, 7624152 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1720 27/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 3443635 m, 142219 m/sec, 9471702 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
lola: time limit : 3410 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-COL-V80P20N10-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3410 6/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 737854 m, 147570 m/sec, 1977754 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3410 10/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 1455063 m, 143441 m/sec, 3920192 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3410 15/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 2162246 m, 141436 m/sec, 5830177 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3410 20/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 2860395 m, 139629 m/sec, 7712970 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3410 24/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 3542318 m, 136384 m/sec, 9548297 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3410 29/32 BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 4211380 m, 133812 m/sec, 11479954 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04: LTL unknown AGGR
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09: LTL unknown AGGR
BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15: LTL unknown AGGR


Time elapsed: 225 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-COL-V80P20N10"
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-COL-V80P20N10, 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-167813692100115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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