Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521300028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M May 18 16:42 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 CANConstruction-PT-050-LTLFireability-00
FORMULA_NAME CANConstruction-PT-050-LTLFireability-01
FORMULA_NAME CANConstruction-PT-050-LTLFireability-02
FORMULA_NAME CANConstruction-PT-050-LTLFireability-03
FORMULA_NAME CANConstruction-PT-050-LTLFireability-04
FORMULA_NAME CANConstruction-PT-050-LTLFireability-05
FORMULA_NAME CANConstruction-PT-050-LTLFireability-06
FORMULA_NAME CANConstruction-PT-050-LTLFireability-07
FORMULA_NAME CANConstruction-PT-050-LTLFireability-08
FORMULA_NAME CANConstruction-PT-050-LTLFireability-09
FORMULA_NAME CANConstruction-PT-050-LTLFireability-10
FORMULA_NAME CANConstruction-PT-050-LTLFireability-11
FORMULA_NAME CANConstruction-PT-050-LTLFireability-12
FORMULA_NAME CANConstruction-PT-050-LTLFireability-13
FORMULA_NAME CANConstruction-PT-050-LTLFireability-14
FORMULA_NAME CANConstruction-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716217469350

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 15:04:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 15:04:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:04:31] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-05-20 15:04:31] [INFO ] Transformed 5602 places.
[2024-05-20 15:04:31] [INFO ] Transformed 10400 transitions.
[2024-05-20 15:04:31] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2387 places :
Symmetric choice reduction at 0 with 2387 rule applications. Total rules 2387 place count 3215 transition count 5626
Iterating global reduction 0 with 2387 rules applied. Total rules applied 4774 place count 3215 transition count 5626
Applied a total of 4774 rules in 858 ms. Remains 3215 /5602 variables (removed 2387) and now considering 5626/10400 (removed 4774) transitions.
// Phase 1: matrix 5626 rows 3215 cols
[2024-05-20 15:04:32] [INFO ] Computed 101 invariants in 84 ms
[2024-05-20 15:04:34] [INFO ] Implicit Places using invariants in 2184 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 2215 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3165/5602 places, 5626/10400 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3115 transition count 5576
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3115 transition count 5576
Applied a total of 100 rules in 728 ms. Remains 3115 /3165 variables (removed 50) and now considering 5576/5626 (removed 50) transitions.
// Phase 1: matrix 5576 rows 3115 cols
[2024-05-20 15:04:35] [INFO ] Computed 51 invariants in 39 ms
[2024-05-20 15:04:37] [INFO ] Implicit Places using invariants in 1820 ms returned []
[2024-05-20 15:04:37] [INFO ] Invariant cache hit.
[2024-05-20 15:04:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:04:51] [INFO ] Implicit Places using invariants and state equation in 13740 ms returned []
Implicit Place search using SMT with State Equation took 15568 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3115/5602 places, 5576/10400 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19373 ms. Remains : 3115/5602 places, 5576/10400 transitions.
Support contains 34 out of 3115 places after structural reductions.
[2024-05-20 15:04:51] [INFO ] Flatten gal took : 322 ms
[2024-05-20 15:04:51] [INFO ] Flatten gal took : 198 ms
[2024-05-20 15:04:52] [INFO ] Input system was already deterministic with 5576 transitions.
Support contains 33 out of 3115 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 22) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-20 15:04:53] [INFO ] Invariant cache hit.
[2024-05-20 15:04:53] [INFO ] [Real]Absence check using 51 positive place invariants in 58 ms returned sat
[2024-05-20 15:04:57] [INFO ] After 2895ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2024-05-20 15:04:57] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:04:59] [INFO ] After 1855ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-20 15:04:59] [INFO ] After 6054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-20 15:04:59] [INFO ] [Nat]Absence check using 51 positive place invariants in 55 ms returned sat
[2024-05-20 15:05:03] [INFO ] After 2908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-20 15:05:05] [INFO ] After 2243ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-20 15:05:07] [INFO ] After 4758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1498 ms.
[2024-05-20 15:05:09] [INFO ] After 10305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 62 ms.
Support contains 9 out of 3115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3115 transition count 5239
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2778 transition count 5239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2778 transition count 5189
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2728 transition count 5189
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 782 place count 2720 transition count 5173
Iterating global reduction 2 with 8 rules applied. Total rules applied 790 place count 2720 transition count 5173
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 798 place count 2720 transition count 5165
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 806 place count 2712 transition count 5165
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 912 place count 2659 transition count 5112
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 914 place count 2659 transition count 5110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 916 place count 2657 transition count 5110
Applied a total of 916 rules in 1273 ms. Remains 2657 /3115 variables (removed 458) and now considering 5110/5576 (removed 466) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1274 ms. Remains : 2657/3115 places, 5110/5576 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5110 rows 2657 cols
[2024-05-20 15:05:11] [INFO ] Computed 51 invariants in 49 ms
[2024-05-20 15:05:11] [INFO ] [Real]Absence check using 51 positive place invariants in 44 ms returned sat
[2024-05-20 15:05:13] [INFO ] After 1753ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-20 15:05:13] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:05:14] [INFO ] After 767ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:05:14] [INFO ] After 3235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:05:14] [INFO ] [Nat]Absence check using 51 positive place invariants in 50 ms returned sat
[2024-05-20 15:05:16] [INFO ] After 1741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 15:05:17] [INFO ] After 945ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 15:05:18] [INFO ] After 1635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 458 ms.
[2024-05-20 15:05:18] [INFO ] After 4351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 6 ms.
Support contains 4 out of 2657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2657/2657 places, 5110/5110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2654 transition count 5104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2654 transition count 5104
Applied a total of 6 rules in 692 ms. Remains 2654 /2657 variables (removed 3) and now considering 5104/5110 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 2654/2657 places, 5104/5110 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 78520 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78520 steps, saw 28200 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5104 rows 2654 cols
[2024-05-20 15:05:22] [INFO ] Computed 51 invariants in 60 ms
[2024-05-20 15:05:23] [INFO ] [Real]Absence check using 51 positive place invariants in 42 ms returned sat
[2024-05-20 15:05:24] [INFO ] After 1583ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-20 15:05:25] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:05:25] [INFO ] After 626ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 15:05:25] [INFO ] After 2657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 15:05:26] [INFO ] [Nat]Absence check using 51 positive place invariants in 45 ms returned sat
[2024-05-20 15:05:27] [INFO ] After 1669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 15:05:28] [INFO ] After 823ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 15:05:29] [INFO ] After 1307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 301 ms.
[2024-05-20 15:05:29] [INFO ] After 3718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 3 ms.
Support contains 3 out of 2654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2654/2654 places, 5104/5104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2653 transition count 5102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2653 transition count 5102
Applied a total of 2 rules in 382 ms. Remains 2653 /2654 variables (removed 1) and now considering 5102/5104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 2653/2654 places, 5102/5104 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81565 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81565 steps, saw 28998 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5102 rows 2653 cols
[2024-05-20 15:05:32] [INFO ] Computed 51 invariants in 51 ms
[2024-05-20 15:05:33] [INFO ] [Real]Absence check using 51 positive place invariants in 43 ms returned sat
[2024-05-20 15:05:34] [INFO ] After 1493ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 15:05:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:05:35] [INFO ] After 463ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:05:35] [INFO ] After 2360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:05:35] [INFO ] [Nat]Absence check using 51 positive place invariants in 48 ms returned sat
[2024-05-20 15:05:37] [INFO ] After 1585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:05:37] [INFO ] After 738ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:05:38] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-05-20 15:05:38] [INFO ] After 3113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 2653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2653/2653 places, 5102/5102 transitions.
Applied a total of 0 rules in 202 ms. Remains 2653 /2653 variables (removed 0) and now considering 5102/5102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 2653/2653 places, 5102/5102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2653/2653 places, 5102/5102 transitions.
Applied a total of 0 rules in 201 ms. Remains 2653 /2653 variables (removed 0) and now considering 5102/5102 (removed 0) transitions.
[2024-05-20 15:05:38] [INFO ] Invariant cache hit.
[2024-05-20 15:05:40] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2024-05-20 15:05:40] [INFO ] Invariant cache hit.
[2024-05-20 15:05:41] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:05:51] [INFO ] Implicit Places using invariants and state equation in 11443 ms returned []
Implicit Place search using SMT with State Equation took 13100 ms to find 0 implicit places.
[2024-05-20 15:05:52] [INFO ] Redundant transitions in 355 ms returned []
[2024-05-20 15:05:52] [INFO ] Invariant cache hit.
[2024-05-20 15:05:54] [INFO ] Dead Transitions using invariants and state equation in 2254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15926 ms. Remains : 2653/2653 places, 5102/5102 transitions.
Graph (trivial) has 4997 edges and 2653 vertex of which 2548 / 2653 are part of one of the 50 SCC in 5 ms
Free SCC test removed 2498 places
Drop transitions removed 4946 transitions
Reduce isomorphic transitions removed 4946 transitions.
Graph (complete) has 308 edges and 155 vertex of which 11 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.0 ms
Discarding 144 places :
Also discarding 94 output transitions
Drop transitions removed 94 transitions
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 53 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 10 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 9 transition count 9
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 9 transition count 9
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 7 transition count 7
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 7 transition count 7
Applied a total of 63 rules in 15 ms. Remains 7 /2653 variables (removed 2646) and now considering 7/5102 (removed 5095) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 7 cols
[2024-05-20 15:05:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 15:05:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-20 15:05:54] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 15:05:54] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 15:05:54] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Computed a total of 151 stabilizing places and 200 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||p0)) U !F((F(X(p1)) U !p2))))'
Support contains 5 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3115 transition count 5240
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2779 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2779 transition count 5190
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2729 transition count 5190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 784 place count 2717 transition count 5166
Iterating global reduction 2 with 12 rules applied. Total rules applied 796 place count 2717 transition count 5166
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 808 place count 2717 transition count 5154
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 820 place count 2705 transition count 5154
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 918 place count 2656 transition count 5105
Applied a total of 918 rules in 738 ms. Remains 2656 /3115 variables (removed 459) and now considering 5105/5576 (removed 471) transitions.
// Phase 1: matrix 5105 rows 2656 cols
[2024-05-20 15:05:55] [INFO ] Computed 51 invariants in 57 ms
[2024-05-20 15:05:57] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2024-05-20 15:05:57] [INFO ] Invariant cache hit.
[2024-05-20 15:05:58] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:06:08] [INFO ] Implicit Places using invariants and state equation in 11254 ms returned []
Implicit Place search using SMT with State Equation took 12917 ms to find 0 implicit places.
[2024-05-20 15:06:08] [INFO ] Redundant transitions in 351 ms returned []
[2024-05-20 15:06:08] [INFO ] Invariant cache hit.
[2024-05-20 15:06:11] [INFO ] Dead Transitions using invariants and state equation in 2228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2656/3115 places, 5105/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16244 ms. Remains : 2656/3115 places, 5105/5576 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 349 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p0) p2 p1), (AND p1 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={1, 2} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={0, 1, 2} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 2} source=3 dest: 5}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 p1), acceptance={1, 2} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 2} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s96 1) (GEQ s153 1)), p0:(AND (GEQ s37 1) (GEQ s1344 1)), p1:(GEQ s851 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 319 steps with 2 reset in 12 ms.
FORMULA CANConstruction-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-00 finished in 16681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3104 transition count 5554
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3104 transition count 5554
Applied a total of 22 rules in 393 ms. Remains 3104 /3115 variables (removed 11) and now considering 5554/5576 (removed 22) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2024-05-20 15:06:11] [INFO ] Computed 51 invariants in 39 ms
[2024-05-20 15:06:13] [INFO ] Implicit Places using invariants in 1733 ms returned []
[2024-05-20 15:06:13] [INFO ] Invariant cache hit.
[2024-05-20 15:06:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:06:27] [INFO ] Implicit Places using invariants and state equation in 14316 ms returned []
Implicit Place search using SMT with State Equation took 16051 ms to find 0 implicit places.
[2024-05-20 15:06:27] [INFO ] Invariant cache hit.
[2024-05-20 15:06:30] [INFO ] Dead Transitions using invariants and state equation in 2951 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3115 places, 5554/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19399 ms. Remains : 3104/3115 places, 5554/5576 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s2423 1), p0:(LT s1126 1)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 46984 steps with 54 reset in 375 ms.
FORMULA CANConstruction-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-02 finished in 19951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3115 transition count 5239
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2778 transition count 5239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2778 transition count 5189
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2728 transition count 5189
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 787 place count 2715 transition count 5163
Iterating global reduction 2 with 13 rules applied. Total rules applied 800 place count 2715 transition count 5163
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 813 place count 2715 transition count 5150
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 826 place count 2702 transition count 5150
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 924 place count 2653 transition count 5101
Applied a total of 924 rules in 620 ms. Remains 2653 /3115 variables (removed 462) and now considering 5101/5576 (removed 475) transitions.
// Phase 1: matrix 5101 rows 2653 cols
[2024-05-20 15:06:32] [INFO ] Computed 51 invariants in 79 ms
[2024-05-20 15:06:33] [INFO ] Implicit Places using invariants in 1644 ms returned []
[2024-05-20 15:06:33] [INFO ] Invariant cache hit.
[2024-05-20 15:06:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:06:44] [INFO ] Implicit Places using invariants and state equation in 11119 ms returned []
Implicit Place search using SMT with State Equation took 12765 ms to find 0 implicit places.
[2024-05-20 15:06:45] [INFO ] Redundant transitions in 214 ms returned []
[2024-05-20 15:06:45] [INFO ] Invariant cache hit.
[2024-05-20 15:06:47] [INFO ] Dead Transitions using invariants and state equation in 2263 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3115 places, 5101/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15877 ms. Remains : 2653/3115 places, 5101/5576 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s46 1) (LT s1393 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 295 reset in 1058 ms.
Stack based approach found an accepted trace after 58659 steps with 170 reset with depth 329 and stack size 327 in 674 ms.
FORMULA CANConstruction-PT-050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-03 finished in 17704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U p1) U X(p2))))'
Support contains 5 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3103 transition count 5552
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3103 transition count 5552
Applied a total of 24 rules in 398 ms. Remains 3103 /3115 variables (removed 12) and now considering 5552/5576 (removed 24) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2024-05-20 15:06:49] [INFO ] Computed 51 invariants in 39 ms
[2024-05-20 15:06:51] [INFO ] Implicit Places using invariants in 1802 ms returned []
[2024-05-20 15:06:51] [INFO ] Invariant cache hit.
[2024-05-20 15:06:52] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:07:05] [INFO ] Implicit Places using invariants and state equation in 14367 ms returned []
Implicit Place search using SMT with State Equation took 16175 ms to find 0 implicit places.
[2024-05-20 15:07:05] [INFO ] Invariant cache hit.
[2024-05-20 15:07:08] [INFO ] Dead Transitions using invariants and state equation in 2905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3115 places, 5552/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19482 ms. Remains : 3103/3115 places, 5552/5576 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s2527 1) (GEQ s186 1) (GEQ s2922 1)), p2:(AND (GEQ s378 1) (GEQ s587 1)), p0:(AND (GEQ s186 1) (GEQ s2922 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 949 steps with 0 reset in 9 ms.
FORMULA CANConstruction-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-04 finished in 19816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1&&G((!p1||X(p2))))))))'
Support contains 4 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3104 transition count 5554
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3104 transition count 5554
Applied a total of 22 rules in 426 ms. Remains 3104 /3115 variables (removed 11) and now considering 5554/5576 (removed 22) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2024-05-20 15:07:09] [INFO ] Computed 51 invariants in 42 ms
[2024-05-20 15:07:11] [INFO ] Implicit Places using invariants in 1880 ms returned []
[2024-05-20 15:07:11] [INFO ] Invariant cache hit.
[2024-05-20 15:07:12] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:07:25] [INFO ] Implicit Places using invariants and state equation in 14507 ms returned []
Implicit Place search using SMT with State Equation took 16389 ms to find 0 implicit places.
[2024-05-20 15:07:25] [INFO ] Invariant cache hit.
[2024-05-20 15:07:28] [INFO ] Dead Transitions using invariants and state equation in 2918 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3115 places, 5554/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19735 ms. Remains : 3104/3115 places, 5554/5576 transitions.
Stuttering acceptance computed with spot in 392 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-05 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}], [{ cond=p1, acceptance={} source=7 dest: 3}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 3}, { cond=(AND p0 p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=5, aps=[p1:(LT s2408 1), p0:(LT s935 1), p2:(AND (GEQ s42 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20594 steps with 23 reset in 153 ms.
FORMULA CANConstruction-PT-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-05 finished in 20318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3104 transition count 5554
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3104 transition count 5554
Applied a total of 22 rules in 429 ms. Remains 3104 /3115 variables (removed 11) and now considering 5554/5576 (removed 22) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2024-05-20 15:07:29] [INFO ] Computed 51 invariants in 36 ms
[2024-05-20 15:07:31] [INFO ] Implicit Places using invariants in 1851 ms returned []
[2024-05-20 15:07:31] [INFO ] Invariant cache hit.
[2024-05-20 15:07:32] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:07:46] [INFO ] Implicit Places using invariants and state equation in 14861 ms returned []
Implicit Place search using SMT with State Equation took 16713 ms to find 0 implicit places.
[2024-05-20 15:07:46] [INFO ] Invariant cache hit.
[2024-05-20 15:07:49] [INFO ] Dead Transitions using invariants and state equation in 3028 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3115 places, 5554/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20173 ms. Remains : 3104/3115 places, 5554/5576 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s2930 1) (GEQ s2095 1)), p0:(GEQ s2095 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1012 steps with 0 reset in 13 ms.
FORMULA CANConstruction-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-07 finished in 20353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3115 transition count 5239
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2778 transition count 5239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2778 transition count 5189
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2728 transition count 5189
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 787 place count 2715 transition count 5163
Iterating global reduction 2 with 13 rules applied. Total rules applied 800 place count 2715 transition count 5163
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 813 place count 2715 transition count 5150
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 826 place count 2702 transition count 5150
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 924 place count 2653 transition count 5101
Applied a total of 924 rules in 636 ms. Remains 2653 /3115 variables (removed 462) and now considering 5101/5576 (removed 475) transitions.
// Phase 1: matrix 5101 rows 2653 cols
[2024-05-20 15:07:50] [INFO ] Computed 51 invariants in 53 ms
[2024-05-20 15:07:51] [INFO ] Implicit Places using invariants in 1615 ms returned []
[2024-05-20 15:07:51] [INFO ] Invariant cache hit.
[2024-05-20 15:07:52] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:08:02] [INFO ] Implicit Places using invariants and state equation in 10635 ms returned []
Implicit Place search using SMT with State Equation took 12252 ms to find 0 implicit places.
[2024-05-20 15:08:02] [INFO ] Redundant transitions in 207 ms returned []
[2024-05-20 15:08:02] [INFO ] Invariant cache hit.
[2024-05-20 15:08:04] [INFO ] Dead Transitions using invariants and state equation in 2167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3115 places, 5101/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15273 ms. Remains : 2653/3115 places, 5101/5576 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s16 1) (LT s1285 1))], 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 290 reset in 1069 ms.
Product exploration explored 100000 steps with 289 reset in 1089 ms.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 882 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 206 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
[2024-05-20 15:08:07] [INFO ] Invariant cache hit.
[2024-05-20 15:08:09] [INFO ] Implicit Places using invariants in 1560 ms returned []
[2024-05-20 15:08:09] [INFO ] Invariant cache hit.
[2024-05-20 15:08:10] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:08:20] [INFO ] Implicit Places using invariants and state equation in 10979 ms returned []
Implicit Place search using SMT with State Equation took 12542 ms to find 0 implicit places.
[2024-05-20 15:08:20] [INFO ] Redundant transitions in 209 ms returned []
[2024-05-20 15:08:20] [INFO ] Invariant cache hit.
[2024-05-20 15:08:22] [INFO ] Dead Transitions using invariants and state equation in 2234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15206 ms. Remains : 2653/2653 places, 5101/5101 transitions.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14449 steps, run visited all 1 properties in 297 ms. (steps per millisecond=48 )
Probabilistic random walk after 14449 steps, saw 11426 distinct states, run finished after 298 ms. (steps per millisecond=48 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 287 reset in 1080 ms.
Stack based approach found an accepted trace after 12539 steps with 35 reset with depth 277 and stack size 277 in 145 ms.
FORMULA CANConstruction-PT-050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-09 finished in 35127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3102 transition count 5550
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3102 transition count 5550
Applied a total of 26 rules in 393 ms. Remains 3102 /3115 variables (removed 13) and now considering 5550/5576 (removed 26) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2024-05-20 15:08:25] [INFO ] Computed 51 invariants in 39 ms
[2024-05-20 15:08:26] [INFO ] Implicit Places using invariants in 1704 ms returned []
[2024-05-20 15:08:26] [INFO ] Invariant cache hit.
[2024-05-20 15:08:27] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:08:40] [INFO ] Implicit Places using invariants and state equation in 13169 ms returned []
Implicit Place search using SMT with State Equation took 14875 ms to find 0 implicit places.
[2024-05-20 15:08:40] [INFO ] Invariant cache hit.
[2024-05-20 15:08:42] [INFO ] Dead Transitions using invariants and state equation in 2736 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3115 places, 5550/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18005 ms. Remains : 3102/3115 places, 5550/5576 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-10 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:(GEQ s343 1)], 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]]
Stuttering criterion allowed to conclude after 6039 steps with 100 reset in 45 ms.
FORMULA CANConstruction-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-10 finished in 18198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3103 transition count 5552
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3103 transition count 5552
Applied a total of 24 rules in 402 ms. Remains 3103 /3115 variables (removed 12) and now considering 5552/5576 (removed 24) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2024-05-20 15:08:43] [INFO ] Computed 51 invariants in 37 ms
[2024-05-20 15:08:45] [INFO ] Implicit Places using invariants in 1901 ms returned []
[2024-05-20 15:08:45] [INFO ] Invariant cache hit.
[2024-05-20 15:08:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:08:59] [INFO ] Implicit Places using invariants and state equation in 14003 ms returned []
Implicit Place search using SMT with State Equation took 15905 ms to find 0 implicit places.
[2024-05-20 15:08:59] [INFO ] Invariant cache hit.
[2024-05-20 15:09:01] [INFO ] Dead Transitions using invariants and state equation in 2682 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3115 places, 5552/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18990 ms. Remains : 3103/3115 places, 5552/5576 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s2099 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 12779 steps with 14 reset in 109 ms.
FORMULA CANConstruction-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-11 finished in 19212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3102 transition count 5550
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3102 transition count 5550
Applied a total of 26 rules in 399 ms. Remains 3102 /3115 variables (removed 13) and now considering 5550/5576 (removed 26) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2024-05-20 15:09:02] [INFO ] Computed 51 invariants in 36 ms
[2024-05-20 15:09:04] [INFO ] Implicit Places using invariants in 1816 ms returned []
[2024-05-20 15:09:04] [INFO ] Invariant cache hit.
[2024-05-20 15:09:05] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:09:18] [INFO ] Implicit Places using invariants and state equation in 13933 ms returned []
Implicit Place search using SMT with State Equation took 15755 ms to find 0 implicit places.
[2024-05-20 15:09:18] [INFO ] Invariant cache hit.
[2024-05-20 15:09:21] [INFO ] Dead Transitions using invariants and state equation in 2804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3115 places, 5550/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18976 ms. Remains : 3102/3115 places, 5550/5576 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s426 1) (GEQ s2745 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 931 steps with 0 reset in 11 ms.
FORMULA CANConstruction-PT-050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-12 finished in 19099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1&&F(p2))))))'
Support contains 5 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 3115 transition count 5242
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 2781 transition count 5242
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 668 place count 2781 transition count 5192
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 768 place count 2731 transition count 5192
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 779 place count 2720 transition count 5170
Iterating global reduction 2 with 11 rules applied. Total rules applied 790 place count 2720 transition count 5170
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 801 place count 2720 transition count 5159
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 812 place count 2709 transition count 5159
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 914 place count 2658 transition count 5108
Applied a total of 914 rules in 620 ms. Remains 2658 /3115 variables (removed 457) and now considering 5108/5576 (removed 468) transitions.
// Phase 1: matrix 5108 rows 2658 cols
[2024-05-20 15:09:21] [INFO ] Computed 51 invariants in 52 ms
[2024-05-20 15:09:23] [INFO ] Implicit Places using invariants in 1631 ms returned []
[2024-05-20 15:09:23] [INFO ] Invariant cache hit.
[2024-05-20 15:09:24] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:09:34] [INFO ] Implicit Places using invariants and state equation in 10593 ms returned []
Implicit Place search using SMT with State Equation took 12227 ms to find 0 implicit places.
[2024-05-20 15:09:34] [INFO ] Redundant transitions in 208 ms returned []
[2024-05-20 15:09:34] [INFO ] Invariant cache hit.
[2024-05-20 15:09:36] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2658/3115 places, 5108/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15335 ms. Remains : 2658/3115 places, 5108/5576 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s768 1), p0:(OR (GEQ s97 1) (AND (GEQ s19 1) (GEQ s152 1))), p2:(GEQ s1074 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 349 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-13 finished in 15485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3115 transition count 5240
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2779 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2779 transition count 5190
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2729 transition count 5190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 784 place count 2717 transition count 5166
Iterating global reduction 2 with 12 rules applied. Total rules applied 796 place count 2717 transition count 5166
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 808 place count 2717 transition count 5154
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 820 place count 2705 transition count 5154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 920 place count 2655 transition count 5104
Applied a total of 920 rules in 611 ms. Remains 2655 /3115 variables (removed 460) and now considering 5104/5576 (removed 472) transitions.
// Phase 1: matrix 5104 rows 2655 cols
[2024-05-20 15:09:37] [INFO ] Computed 51 invariants in 54 ms
[2024-05-20 15:09:39] [INFO ] Implicit Places using invariants in 1666 ms returned []
[2024-05-20 15:09:39] [INFO ] Invariant cache hit.
[2024-05-20 15:09:39] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:09:50] [INFO ] Implicit Places using invariants and state equation in 11417 ms returned []
Implicit Place search using SMT with State Equation took 13096 ms to find 0 implicit places.
[2024-05-20 15:09:50] [INFO ] Redundant transitions in 208 ms returned []
[2024-05-20 15:09:50] [INFO ] Invariant cache hit.
[2024-05-20 15:09:53] [INFO ] Dead Transitions using invariants and state equation in 2309 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2655/3115 places, 5104/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16236 ms. Remains : 2655/3115 places, 5104/5576 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1976 1) (AND (GEQ s85 1) (GEQ s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 785 steps with 2 reset in 12 ms.
FORMULA CANConstruction-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-14 finished in 16362 ms.
All properties solved by simple procedures.
Total runtime 322118 ms.

BK_STOP 1716217794329

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521300028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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