About the Execution of LoLa+red for HouseConstruction-PT-00100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 719.983 | 84185.00 | 102772.00 | 894.80 | F?TTFTFTFTTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r199-smll-167840346100555.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HouseConstruction-PT-00100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840346100555
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:06 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 3.7K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00100-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678564101482
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=HouseConstruction-PT-00100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 19:48:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 19:48:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:48:25] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-11 19:48:25] [INFO ] Transformed 26 places.
[2023-03-11 19:48:25] [INFO ] Transformed 18 transitions.
[2023-03-11 19:48:25] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 20 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-11 19:48:25] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-11 19:48:25] [INFO ] Implicit Places using invariants in 240 ms returned [13, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 302 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 324 ms. Remains : 24/26 places, 18/18 transitions.
Support contains 22 out of 24 places after structural reductions.
[2023-03-11 19:48:26] [INFO ] Flatten gal took : 35 ms
[2023-03-11 19:48:26] [INFO ] Flatten gal took : 11 ms
[2023-03-11 19:48:26] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10004 steps, including 5 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 32) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 24 cols
[2023-03-11 19:48:26] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-11 19:48:26] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 19:48:26] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:26] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 19:48:26] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 19:48:26] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 6 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||G(p2)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 16 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 11 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 9 transition count 8
Applied a total of 10 rules in 23 ms. Remains 9 /24 variables (removed 15) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-11 19:48:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 19:48:27] [INFO ] Implicit Places using invariants in 39 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 8/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 524 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ 1 s3), p2:(GT 3 s7), p0:(LEQ s2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 739 steps with 0 reset in 18 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-00 finished in 714 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||X(F((p0&&F(p1))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 17 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 17 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 21 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 6 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 5 transition count 4
Applied a total of 29 rules in 20 ms. Remains 5 /24 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-11 19:48:28] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 19:48:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 19:48:28] [INFO ] Invariant cache hit.
[2023-03-11 19:48:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-11 19:48:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 19:48:28] [INFO ] Invariant cache hit.
[2023-03-11 19:48:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s2 s4), p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1245 reset in 382 ms.
Product exploration explored 100000 steps with 1321 reset in 327 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 668 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) p0), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 673 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 19:48:31] [INFO ] Invariant cache hit.
[2023-03-11 19:48:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 19:48:31] [INFO ] Invariant cache hit.
[2023-03-11 19:48:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-11 19:48:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 19:48:31] [INFO ] Invariant cache hit.
[2023-03-11 19:48:31] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 573 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p1) p0), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 661 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1242 reset in 197 ms.
Product exploration explored 100000 steps with 1276 reset in 287 ms.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 19:48:33] [INFO ] Invariant cache hit.
[2023-03-11 19:48:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 19:48:33] [INFO ] Invariant cache hit.
[2023-03-11 19:48:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-11 19:48:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 19:48:33] [INFO ] Invariant cache hit.
[2023-03-11 19:48:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-01 finished in 5748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 8 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 7 ms. Remains 4 /24 variables (removed 20) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 19:48:34] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 19:48:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 19:48:34] [INFO ] Invariant cache hit.
[2023-03-11 19:48:34] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-11 19:48:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 19:48:34] [INFO ] Invariant cache hit.
[2023-03-11 19:48:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 4/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-02 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 s2 s1)], 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 249 reset in 197 ms.
Product exploration explored 100000 steps with 249 reset in 167 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLCardinality-02 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(X(p1))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 19:48:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 19:48:34] [INFO ] Implicit Places using invariants in 36 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 474 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 10}], [{ cond=(NOT p0), acceptance={} source=10 dest: 6}, { cond=p0, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(LEQ s9 s3), p1:(LEQ s21 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 122 ms.
Product exploration explored 100000 steps with 20000 reset in 135 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 438 ms. Reduced automaton from 11 states, 18 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10004 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :2
Finished Best-First random walk after 798 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 542 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 388 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-11 19:48:37] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-11 19:48:37] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-11 19:48:37] [INFO ] Invariant cache hit.
[2023-03-11 19:48:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-11 19:48:37] [INFO ] Invariant cache hit.
[2023-03-11 19:48:38] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10004 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :2
Finished Best-First random walk after 782 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND p1 p0), true, (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 406 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 429 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 103 ms.
Product exploration explored 100000 steps with 20000 reset in 131 ms.
Applying partial POR strategy [false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 391 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 12 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 2 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 12 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 6 ms. Remains 11 /22 variables (removed 11) and now considering 9/18 (removed 9) transitions.
[2023-03-11 19:48:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2023-03-11 19:48:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 19:48:41] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 11/22 places, 9/18 transitions.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-11 19:48:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 19:48:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 19:48:41] [INFO ] Invariant cache hit.
[2023-03-11 19:48:41] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-11 19:48:41] [INFO ] Invariant cache hit.
[2023-03-11 19:48:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-03 finished in 6918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)||G(p2)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 19:48:41] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-11 19:48:41] [INFO ] Implicit Places using invariants in 52 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 503 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}]], initial=1, aps=[p1:(GT 3 s6), p2:(LEQ s5 s20), p0:(LEQ 3 s9)], 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-04 finished in 584 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 G(p1)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 18 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 8 transition count 6
Applied a total of 25 rules in 9 ms. Remains 8 /24 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-11 19:48:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 19:48:42] [INFO ] Implicit Places using invariants in 34 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/24 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47 ms. Remains : 7/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s6 s5), p0:(GT s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 600 steps with 0 reset in 16 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-06 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 14 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 8 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 8 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 15 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 3 transition count 3
Applied a total of 17 rules in 8 ms. Remains 3 /24 variables (removed 21) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 19:48:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 19:48:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 19:48:42] [INFO ] Invariant cache hit.
[2023-03-11 19:48:42] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 19:48:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 19:48:42] [INFO ] Invariant cache hit.
[2023-03-11 19:48:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/24 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 3/24 places, 3/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7426 reset in 177 ms.
Product exploration explored 100000 steps with 7088 reset in 227 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-11 19:48:43] [INFO ] Invariant cache hit.
[2023-03-11 19:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 19:48:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-11 19:48:43] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 19:48:43] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-11 19:48:43] [INFO ] Invariant cache hit.
[2023-03-11 19:48:43] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 19:48:43] [INFO ] Invariant cache hit.
[2023-03-11 19:48:43] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 19:48:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 19:48:43] [INFO ] Invariant cache hit.
[2023-03-11 19:48:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=202 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 249 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 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-11 19:48:44] [INFO ] Invariant cache hit.
[2023-03-11 19:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 19:48:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-11 19:48:44] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 19:48:44] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7161 reset in 132 ms.
Product exploration explored 100000 steps with 7413 reset in 111 ms.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-11 19:48:44] [INFO ] Invariant cache hit.
[2023-03-11 19:48:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 19:48:45] [INFO ] Invariant cache hit.
[2023-03-11 19:48:45] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-11 19:48:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 19:48:45] [INFO ] Invariant cache hit.
[2023-03-11 19:48:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-07 finished in 2613 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))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 19:48:45] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 19:48:45] [INFO ] Implicit Places using invariants in 45 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 2 s13)], 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 33333 reset in 86 ms.
Product exploration explored 100000 steps with 33333 reset in 355 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLCardinality-09 finished in 774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(((p1 U p2) U p3))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 19:48:45] [INFO ] Invariant cache hit.
[2023-03-11 19:48:45] [INFO ] Implicit Places using invariants in 40 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (NOT p2), (NOT p3)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR p3 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LEQ 3 s10) (LEQ s0 s3)), p3:(LEQ 3 s10), p2:(GT s5 s9), p1:(LEQ s0 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-11 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||F(p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 19:48:46] [INFO ] Invariant cache hit.
[2023-03-11 19:48:46] [INFO ] Implicit Places using invariants in 47 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s8), p2:(LEQ 3 s21), p0:(LEQ s12 s3)], 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 947 reset in 216 ms.
Product exploration explored 100000 steps with 967 reset in 245 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p0), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 670 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 1010 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=336 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p0), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 713 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-11 19:48:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 19:48:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 19:48:49] [INFO ] Invariant cache hit.
[2023-03-11 19:48:49] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-11 19:48:49] [INFO ] Invariant cache hit.
[2023-03-11 19:48:49] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 604 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 707 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=353 )
Knowledge obtained : [(AND (NOT p2) p1), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 8 factoid took 531 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 475 reset in 129 ms.
Product exploration explored 100000 steps with 478 reset in 142 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 13 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 13 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 13 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 10 rules in 6 ms. Remains 11 /22 variables (removed 11) and now considering 9/18 (removed 9) transitions.
[2023-03-11 19:48:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2023-03-11 19:48:51] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 19:48:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 11/22 places, 9/18 transitions.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-11 19:48:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 19:48:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-11 19:48:51] [INFO ] Invariant cache hit.
[2023-03-11 19:48:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-11 19:48:51] [INFO ] Invariant cache hit.
[2023-03-11 19:48:51] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-12 finished in 5469 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||G(((p2 U (p3||G(p2)))&&p1))))))'
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 22 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 18 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 17 transition count 13
Applied a total of 9 rules in 6 ms. Remains 17 /24 variables (removed 7) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 17 cols
[2023-03-11 19:48:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 19:48:51] [INFO ] Implicit Places using invariants in 36 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/24 places, 13/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46 ms. Remains : 16/24 places, 13/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s9 s13) (GT 2 s1)), p0:(AND (GT s9 s13) (GT 3 s6)), p3:(AND (GT s5 s6) (GT s14 s7)), p2:(GT s14 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2543 steps with 27 reset in 11 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-13 finished in 216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&F(!p1)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 19:48:51] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 19:48:52] [INFO ] Implicit Places using invariants in 49 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, p1, (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s1), p0:(LEQ 2 s3)], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-14 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 19:48:52] [INFO ] Invariant cache hit.
[2023-03-11 19:48:52] [INFO ] Implicit Places using invariants in 58 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GT 3 s11), p0:(LEQ s18 s14)], 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 307 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-15 finished in 358 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||X(F((p0&&F(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||F(p2))))'
Found a Shortening insensitive property : HouseConstruction-PT-00100-LTLCardinality-12
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 16 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 12 place count 9 transition count 7
Applied a total of 12 rules in 10 ms. Remains 9 /24 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-11 19:48:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 19:48:53] [INFO ] Implicit Places using invariants in 37 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/24 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 49 ms. Remains : 7/24 places, 7/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s3), p2:(LEQ 3 s6), p0:(LEQ s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3301 reset in 135 ms.
Product exploration explored 100000 steps with 3415 reset in 172 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p0), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (F (G p1)), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 772 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 404 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=202 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p0), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (F (G p1)), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 719 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-11 19:48:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 19:48:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 19:48:55] [INFO ] Invariant cache hit.
[2023-03-11 19:48:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 19:48:55] [INFO ] Invariant cache hit.
[2023-03-11 19:48:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 7/7 places, 7/7 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 507 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 606 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=303 )
Knowledge obtained : [(AND (NOT p2) p1), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 8 factoid took 504 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1746 reset in 144 ms.
Product exploration explored 100000 steps with 1749 reset in 160 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Graph (complete) has 6 edges and 7 vertex of which 5 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 5/7 (removed 2) transitions.
[2023-03-11 19:48:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 19:48:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 19:48:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/7 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 5/7 places, 5/7 transitions.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-11 19:48:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 19:48:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 19:48:58] [INFO ] Invariant cache hit.
[2023-03-11 19:48:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-11 19:48:58] [INFO ] Invariant cache hit.
[2023-03-11 19:48:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 7/7 places, 7/7 transitions.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-12 finished in 5322 ms.
[2023-03-11 19:48:58] [INFO ] Flatten gal took : 5 ms
[2023-03-11 19:48:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-11 19:48:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 47 arcs took 1 ms.
Total runtime 33448 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HouseConstruction-PT-00100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLCardinality
FORMULA HouseConstruction-PT-00100-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-00100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678564185667
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 HouseConstruction-PT-00100-LTLCardinality-03
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for HouseConstruction-PT-00100-LTLCardinality-03
lola: result : true
lola: markings : 25
lola: fired transitions : 30
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 12 (type EXCL) for 9 HouseConstruction-PT-00100-LTLCardinality-12
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 12 (type EXCL) for HouseConstruction-PT-00100-LTLCardinality-12
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 HouseConstruction-PT-00100-LTLCardinality-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 5/32 HouseConstruction-PT-00100-LTLCardinality-01 663308 m, 132661 m/sec, 6347762 t fired, .
Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 9/32 HouseConstruction-PT-00100-LTLCardinality-01 1281751 m, 123688 m/sec, 12663694 t fired, .
Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 12/32 HouseConstruction-PT-00100-LTLCardinality-01 1853320 m, 114313 m/sec, 18794704 t fired, .
Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1200 16/32 HouseConstruction-PT-00100-LTLCardinality-01 2404315 m, 110199 m/sec, 24906058 t fired, .
Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1200 19/32 HouseConstruction-PT-00100-LTLCardinality-01 2989288 m, 116994 m/sec, 31062592 t fired, .
Time elapsed: 25 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1200 23/32 HouseConstruction-PT-00100-LTLCardinality-01 3504057 m, 102953 m/sec, 37022820 t fired, .
Time elapsed: 30 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1200 26/32 HouseConstruction-PT-00100-LTLCardinality-01 4076501 m, 114488 m/sec, 43030229 t fired, .
Time elapsed: 35 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1200 30/32 HouseConstruction-PT-00100-LTLCardinality-01 4576129 m, 99925 m/sec, 48760047 t fired, .
Time elapsed: 40 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for HouseConstruction-PT-00100-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-00100-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-00100-LTLCardinality-07: F 0 1 0 0 1 0 0 0
HouseConstruction-PT-00100-LTLCardinality-12: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 16 (type EXCL) for 6 HouseConstruction-PT-00100-LTLCardinality-07
lola: time limit : 1777 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for HouseConstruction-PT-00100-LTLCardinality-07
lola: result : false
lola: markings : 258776
lola: fired transitions : 425326
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 9 HouseConstruction-PT-00100-LTLCardinality-12
lola: time limit : 3555 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for HouseConstruction-PT-00100-LTLCardinality-12
lola: result : false
lola: markings : 5205
lola: fired transitions : 7553
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-00100-LTLCardinality-01: LTL unknown AGGR
HouseConstruction-PT-00100-LTLCardinality-03: LTL true LTL model checker
HouseConstruction-PT-00100-LTLCardinality-07: F true state space / EG
HouseConstruction-PT-00100-LTLCardinality-12: CONJ false LTL model checker
Time elapsed: 45 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="HouseConstruction-PT-00100"
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 HouseConstruction-PT-00100, 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 r199-smll-167840346100555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00100.tgz
mv HouseConstruction-PT-00100 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 '
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 ;