Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 11K Feb 25 21:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 21:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 21:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 21:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678367628721

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 13:13:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 13:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:13:51] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-09 13:13:51] [INFO ] Transformed 3682 places.
[2023-03-09 13:13:51] [INFO ] Transformed 6720 transitions.
[2023-03-09 13:13:51] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-040-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1500 places :
Symmetric choice reduction at 0 with 1500 rule applications. Total rules 1500 place count 2182 transition count 3720
Iterating global reduction 0 with 1500 rules applied. Total rules applied 3000 place count 2182 transition count 3720
Applied a total of 3000 rules in 525 ms. Remains 2182 /3682 variables (removed 1500) and now considering 3720/6720 (removed 3000) transitions.
// Phase 1: matrix 3720 rows 2182 cols
[2023-03-09 13:13:52] [INFO ] Computed 81 place invariants in 65 ms
[2023-03-09 13:13:53] [INFO ] Implicit Places using invariants in 1439 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]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1470 ms to find 40 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2142/3682 places, 3720/6720 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2103 transition count 3681
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2103 transition count 3681
Applied a total of 78 rules in 343 ms. Remains 2103 /2142 variables (removed 39) and now considering 3681/3720 (removed 39) transitions.
// Phase 1: matrix 3681 rows 2103 cols
[2023-03-09 13:13:54] [INFO ] Computed 41 place invariants in 46 ms
[2023-03-09 13:13:55] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2023-03-09 13:13:55] [INFO ] Invariant cache hit.
[2023-03-09 13:13:56] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:14:02] [INFO ] Implicit Places using invariants and state equation in 6995 ms returned []
Implicit Place search using SMT with State Equation took 8094 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2103/3682 places, 3681/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10435 ms. Remains : 2103/3682 places, 3681/6720 transitions.
Support contains 41 out of 2103 places after structural reductions.
[2023-03-09 13:14:02] [INFO ] Flatten gal took : 259 ms
[2023-03-09 13:14:02] [INFO ] Flatten gal took : 172 ms
[2023-03-09 13:14:03] [INFO ] Input system was already deterministic with 3681 transitions.
Support contains 39 out of 2103 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 25) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-09 13:14:03] [INFO ] Invariant cache hit.
[2023-03-09 13:14:04] [INFO ] [Real]Absence check using 41 positive place invariants in 59 ms returned sat
[2023-03-09 13:14:04] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:15
[2023-03-09 13:14:05] [INFO ] [Nat]Absence check using 41 positive place invariants in 55 ms returned sat
[2023-03-09 13:14:07] [INFO ] After 1909ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :8
[2023-03-09 13:14:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:14:09] [INFO ] After 1858ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :9 sat :8
[2023-03-09 13:14:11] [INFO ] After 4030ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :8
Attempting to minimize the solution found.
Minimization took 1390 ms.
[2023-03-09 13:14:12] [INFO ] After 8383ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :8
Fused 17 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 124 ms.
Support contains 13 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Drop transitions removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 263 place count 2103 transition count 3418
Reduce places removed 263 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 264 rules applied. Total rules applied 527 place count 1840 transition count 3417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 528 place count 1839 transition count 3417
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 528 place count 1839 transition count 3377
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 608 place count 1799 transition count 3377
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 620 place count 1787 transition count 3353
Iterating global reduction 3 with 12 rules applied. Total rules applied 632 place count 1787 transition count 3353
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 641 place count 1787 transition count 3344
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 650 place count 1778 transition count 3344
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 742 place count 1732 transition count 3298
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 743 place count 1732 transition count 3298
Applied a total of 743 rules in 1287 ms. Remains 1732 /2103 variables (removed 371) and now considering 3298/3681 (removed 383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1287 ms. Remains : 1732/2103 places, 3298/3681 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3298 rows 1732 cols
[2023-03-09 13:14:14] [INFO ] Computed 41 place invariants in 31 ms
[2023-03-09 13:14:14] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:14:15] [INFO ] [Nat]Absence check using 41 positive place invariants in 24 ms returned sat
[2023-03-09 13:14:16] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:14:16] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:14:16] [INFO ] After 636ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 13:14:17] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-09 13:14:17] [INFO ] After 2741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 1732 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1732/1732 places, 3298/3298 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1732 transition count 3297
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1731 transition count 3297
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 1727 transition count 3289
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 1727 transition count 3289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1726 transition count 3288
Applied a total of 12 rules in 397 ms. Remains 1726 /1732 variables (removed 6) and now considering 3288/3298 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 1726/1732 places, 3288/3298 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3288 rows 1726 cols
[2023-03-09 13:14:18] [INFO ] Computed 41 place invariants in 41 ms
[2023-03-09 13:14:18] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:14:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 32 ms returned sat
[2023-03-09 13:14:19] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:14:19] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:14:20] [INFO ] After 453ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:14:20] [INFO ] After 715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-09 13:14:20] [INFO ] After 2342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 1726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1726/1726 places, 3288/3288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1725 transition count 3286
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1725 transition count 3286
Applied a total of 2 rules in 245 ms. Remains 1725 /1726 variables (removed 1) and now considering 3286/3288 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 1725/1726 places, 3286/3288 transitions.
Incomplete random walk after 10000 steps, including 35 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 143174 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143174 steps, saw 44678 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3286 rows 1725 cols
[2023-03-09 13:14:24] [INFO ] Computed 41 place invariants in 48 ms
[2023-03-09 13:14:24] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:14:24] [INFO ] [Nat]Absence check using 41 positive place invariants in 37 ms returned sat
[2023-03-09 13:14:25] [INFO ] After 736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:14:25] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:14:25] [INFO ] After 399ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:14:26] [INFO ] After 562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-09 13:14:26] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 3286/3286 transitions.
Applied a total of 0 rules in 182 ms. Remains 1725 /1725 variables (removed 0) and now considering 3286/3286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 1725/1725 places, 3286/3286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 3286/3286 transitions.
Applied a total of 0 rules in 143 ms. Remains 1725 /1725 variables (removed 0) and now considering 3286/3286 (removed 0) transitions.
[2023-03-09 13:14:26] [INFO ] Invariant cache hit.
[2023-03-09 13:14:27] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2023-03-09 13:14:27] [INFO ] Invariant cache hit.
[2023-03-09 13:14:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:14:46] [INFO ] Implicit Places using invariants and state equation in 18945 ms returned []
Implicit Place search using SMT with State Equation took 20093 ms to find 0 implicit places.
[2023-03-09 13:14:47] [INFO ] Redundant transitions in 223 ms returned []
[2023-03-09 13:14:47] [INFO ] Invariant cache hit.
[2023-03-09 13:14:48] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21952 ms. Remains : 1725/1725 places, 3286/3286 transitions.
Graph (trivial) has 3195 edges and 1725 vertex of which 1636 / 1725 are part of one of the 40 SCC in 8 ms
Free SCC test removed 1596 places
Drop transitions removed 3152 transitions
Reduce isomorphic transitions removed 3152 transitions.
Graph (complete) has 258 edges and 129 vertex of which 15 are kept as prefixes of interest. Removing 114 places using SCC suffix rule.0 ms
Discarding 114 places :
Also discarding 108 output transitions
Drop transitions removed 108 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 10 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 8 transition count 11
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 8 transition count 11
Applied a total of 28 rules in 18 ms. Remains 8 /1725 variables (removed 1717) and now considering 11/3286 (removed 3275) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2023-03-09 13:14:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 13:14:48] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:14:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 13:14:48] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:14:48] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 13:14:48] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA CANConstruction-PT-040-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA CANConstruction-PT-040-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 161 stable transitions
FORMULA CANConstruction-PT-040-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2084 transition count 3643
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2084 transition count 3643
Applied a total of 38 rules in 239 ms. Remains 2084 /2103 variables (removed 19) and now considering 3643/3681 (removed 38) transitions.
// Phase 1: matrix 3643 rows 2084 cols
[2023-03-09 13:14:49] [INFO ] Computed 41 place invariants in 52 ms
[2023-03-09 13:14:50] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2023-03-09 13:14:50] [INFO ] Invariant cache hit.
[2023-03-09 13:14:51] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:15:12] [INFO ] Implicit Places using invariants and state equation in 21823 ms returned []
Implicit Place search using SMT with State Equation took 23020 ms to find 0 implicit places.
[2023-03-09 13:15:12] [INFO ] Invariant cache hit.
[2023-03-09 13:15:13] [INFO ] Dead Transitions using invariants and state equation in 1633 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2103 places, 3643/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24896 ms. Remains : 2084/2103 places, 3643/3681 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s240 s1427)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1732 ms.
Product exploration explored 100000 steps with 50000 reset in 1529 ms.
Computed a total of 122 stabilizing places and 161 stable transitions
Computed a total of 122 stabilizing places and 161 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLCardinality-00 finished in 28614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 4 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2084 transition count 3644
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2084 transition count 3644
Applied a total of 38 rules in 248 ms. Remains 2084 /2103 variables (removed 19) and now considering 3644/3681 (removed 37) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2023-03-09 13:15:17] [INFO ] Computed 41 place invariants in 37 ms
[2023-03-09 13:15:18] [INFO ] Implicit Places using invariants in 1354 ms returned []
[2023-03-09 13:15:18] [INFO ] Invariant cache hit.
[2023-03-09 13:15:19] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:15:38] [INFO ] Implicit Places using invariants and state equation in 19669 ms returned []
Implicit Place search using SMT with State Equation took 21026 ms to find 0 implicit places.
[2023-03-09 13:15:38] [INFO ] Invariant cache hit.
[2023-03-09 13:15:40] [INFO ] Dead Transitions using invariants and state equation in 1625 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2103 places, 3644/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22914 ms. Remains : 2084/2103 places, 3644/3681 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(LEQ s1279 s1591), p0:(GT s639 s561)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5297 steps with 8 reset in 51 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-03 finished in 23270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2083 transition count 3642
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2083 transition count 3642
Applied a total of 40 rules in 234 ms. Remains 2083 /2103 variables (removed 20) and now considering 3642/3681 (removed 39) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2023-03-09 13:15:40] [INFO ] Computed 41 place invariants in 41 ms
[2023-03-09 13:15:41] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2023-03-09 13:15:41] [INFO ] Invariant cache hit.
[2023-03-09 13:15:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:16:02] [INFO ] Implicit Places using invariants and state equation in 20597 ms returned []
Implicit Place search using SMT with State Equation took 21682 ms to find 0 implicit places.
[2023-03-09 13:16:02] [INFO ] Invariant cache hit.
[2023-03-09 13:16:04] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2103 places, 3642/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23727 ms. Remains : 2083/2103 places, 3642/3681 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1059 s748)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1424 ms.
Product exploration explored 100000 steps with 50000 reset in 1202 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLCardinality-11 finished in 26546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(p1))||G(p1)))))'
Support contains 4 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2084 transition count 3644
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2084 transition count 3644
Applied a total of 38 rules in 183 ms. Remains 2084 /2103 variables (removed 19) and now considering 3644/3681 (removed 37) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2023-03-09 13:16:07] [INFO ] Computed 41 place invariants in 39 ms
[2023-03-09 13:16:08] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2023-03-09 13:16:08] [INFO ] Invariant cache hit.
[2023-03-09 13:16:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:16:27] [INFO ] Implicit Places using invariants and state equation in 19383 ms returned []
Implicit Place search using SMT with State Equation took 20484 ms to find 0 implicit places.
[2023-03-09 13:16:27] [INFO ] Invariant cache hit.
[2023-03-09 13:16:29] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2103 places, 3644/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22399 ms. Remains : 2084/2103 places, 3644/3681 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s405 s1040) (LEQ s1601 s915)), p1:(LEQ s405 s1040)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 146 reset in 518 ms.
Stack based approach found an accepted trace after 26698 steps with 37 reset with depth 711 and stack size 711 in 149 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-12 finished in 23206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Drop transitions removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 264 place count 2103 transition count 3417
Reduce places removed 264 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 265 rules applied. Total rules applied 529 place count 1839 transition count 3416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 530 place count 1838 transition count 3416
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 530 place count 1838 transition count 3377
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 608 place count 1799 transition count 3377
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 628 place count 1779 transition count 3337
Iterating global reduction 3 with 20 rules applied. Total rules applied 648 place count 1779 transition count 3337
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 16 rules applied. Total rules applied 664 place count 1779 transition count 3321
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 680 place count 1763 transition count 3321
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 758 place count 1724 transition count 3282
Applied a total of 758 rules in 427 ms. Remains 1724 /2103 variables (removed 379) and now considering 3282/3681 (removed 399) transitions.
// Phase 1: matrix 3282 rows 1724 cols
[2023-03-09 13:16:30] [INFO ] Computed 41 place invariants in 35 ms
[2023-03-09 13:16:31] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2023-03-09 13:16:31] [INFO ] Invariant cache hit.
[2023-03-09 13:16:32] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:16:53] [INFO ] Implicit Places using invariants and state equation in 21542 ms returned []
Implicit Place search using SMT with State Equation took 22598 ms to find 0 implicit places.
[2023-03-09 13:16:53] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-09 13:16:53] [INFO ] Invariant cache hit.
[2023-03-09 13:16:55] [INFO ] Dead Transitions using invariants and state equation in 1406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1724/2103 places, 3282/3681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24651 ms. Remains : 1724/2103 places, 3282/3681 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s55 s524)], 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 336 steps with 1 reset in 3 ms.
FORMULA CANConstruction-PT-040-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLCardinality-13 finished in 24748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((p1||F(p2))))))))'
Support contains 5 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 3681/3681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2085 transition count 3646
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2085 transition count 3646
Applied a total of 36 rules in 213 ms. Remains 2085 /2103 variables (removed 18) and now considering 3646/3681 (removed 35) transitions.
// Phase 1: matrix 3646 rows 2085 cols
[2023-03-09 13:16:55] [INFO ] Computed 41 place invariants in 37 ms
[2023-03-09 13:16:56] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2023-03-09 13:16:56] [INFO ] Invariant cache hit.
[2023-03-09 13:16:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:17:16] [INFO ] Implicit Places using invariants and state equation in 20512 ms returned []
Implicit Place search using SMT with State Equation took 21564 ms to find 0 implicit places.
[2023-03-09 13:17:16] [INFO ] Invariant cache hit.
[2023-03-09 13:17:18] [INFO ] Dead Transitions using invariants and state equation in 1562 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2085/2103 places, 3646/3681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23354 ms. Remains : 2085/2103 places, 3646/3681 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-040-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s1613 s1646), p1:(GT s1853 s996), p2:(GT 1 s961)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 924 ms.
Product exploration explored 100000 steps with 33333 reset in 1126 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLCardinality-15 finished in 25710 ms.
All properties solved by simple procedures.
Total runtime 209845 ms.

BK_STOP 1678367841040

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-040, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690600643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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