Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912708300185.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Sudoku-PT-AN04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708300185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 38K Feb 26 09:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 224K Feb 26 09:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Feb 26 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 152K Feb 26 09:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 134K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 26 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 358K Feb 26 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 135K Feb 26 09:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 674K Feb 26 09:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 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 Sudoku-PT-AN04-CTLCardinality-00
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-01
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-02
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-03
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-04
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-05
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-06
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-07
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-08
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-09
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-10
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-11
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-12
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-13
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-14
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679199350937

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 04:15:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 04:15:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:15:52] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-19 04:15:52] [INFO ] Transformed 112 places.
[2023-03-19 04:15:52] [INFO ] Transformed 64 transitions.
[2023-03-19 04:15:52] [INFO ] Parsed PT model containing 112 places and 64 transitions and 256 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-19 04:15:52] [INFO ] Computed 48 place invariants in 11 ms
[2023-03-19 04:15:53] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-19 04:15:53] [INFO ] Invariant cache hit.
[2023-03-19 04:15:53] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-19 04:15:53] [INFO ] Invariant cache hit.
[2023-03-19 04:15:53] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2023-03-19 04:15:53] [INFO ] Flatten gal took : 27 ms
[2023-03-19 04:15:53] [INFO ] Flatten gal took : 12 ms
[2023-03-19 04:15:53] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 696 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 81) seen :43
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) 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 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
[2023-03-19 04:15:54] [INFO ] Invariant cache hit.
[2023-03-19 04:15:54] [INFO ] [Real]Absence check using 48 positive place invariants in 23 ms returned sat
[2023-03-19 04:15:54] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :36 sat :0 real:2
[2023-03-19 04:15:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-19 04:15:54] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :38 sat :0
Fused 38 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 38 atomic propositions for a total of 16 simplifications.
FORMULA Sudoku-PT-AN04-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 8 ms
[2023-03-19 04:15:54] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA Sudoku-PT-AN04-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 6 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 5 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 48/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 112/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 5 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 5 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 112/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 5 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 49 transition count 64
Applied a total of 63 rules in 2 ms. Remains 49 /112 variables (removed 63) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 51 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 51 /112 variables (removed 61) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 51/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 57 transition count 64
Applied a total of 55 rules in 2 ms. Remains 57 /112 variables (removed 55) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 57/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 51 transition count 64
Applied a total of 61 rules in 3 ms. Remains 51 /112 variables (removed 61) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/112 places, 64/64 transitions.
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:15:54] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:15:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 46 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.0 ms
Discarding 66 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 46 /112 variables (removed 66) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 46/112 places, 64/64 transitions.
[2023-03-19 04:15:55] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:15:55] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:15:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 49 transition count 64
Applied a total of 63 rules in 2 ms. Remains 49 /112 variables (removed 63) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/112 places, 64/64 transitions.
[2023-03-19 04:15:55] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:55] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:15:55] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-19 04:15:55] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:55] [INFO ] Flatten gal took : 4 ms
[2023-03-19 04:15:55] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-19 04:15:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 64 transitions and 256 arcs took 1 ms.
Total runtime 2635 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 112 NrTr: 64 NrArc: 256)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.715sec


RS generation: 0m57.313sec


-> reachability set: #nodes 2921644 (2.9e+06) #states 127,545,137 (8)



starting MCC model checker
--------------------------

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 127,545,137 (8)
.-> the formula is TRUE

FORMULA Sudoku-PT-AN04-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m18.830sec

checking: AF [EX [[AG [~ [1<=p78]] | AX [~ [1<=p11]]]]]
normalized: ~ [EG [~ [EX [[~ [EX [1<=p11]] | ~ [E [true U 1<=p78]]]]]]]

abstracting: (1<=p78)
states: 17,723,659 (7)
abstracting: (1<=p11)
states: 56,650,501 (7)
.
before gc: list nodes free: 64697

after gc: idd nodes used:7832745, unused:56167255; list nodes free:246710349
..
before gc: list nodes free: 1372377

after gc: idd nodes used:18884801, unused:45115199; list nodes free:198790809

before gc: list nodes free: 1902912

after gc: idd nodes used:12782412, unused:51217588; list nodes free:226203386
.MC time: 6m25.718sec

checking: EG [[1<=p9 | 1<=p13]]
normalized: EG [[1<=p9 | 1<=p13]]

abstracting: (1<=p13)
states: 56,650,501 (7)
abstracting: (1<=p9)
states: 56,650,501 (7)

before gc: list nodes free: 2148406

after gc: idd nodes used:7551805, unused:56448195; list nodes free:249572494
..
before gc: list nodes free: 2302364

after gc: idd nodes used:13150916, unused:50849084; list nodes free:225091994
.MC time: 5m44.177sec

checking: EX [A [EG [1<=p49] U E [1<=p14 U EX [0<=0]]]]
normalized: EX [[~ [EG [~ [E [1<=p14 U EX [0<=0]]]]] & ~ [E [~ [E [1<=p14 U EX [0<=0]]] U [~ [E [1<=p14 U EX [0<=0]]] & ~ [EG [1<=p49]]]]]]]

abstracting: (1<=p49)
states: 17,723,659 (7)

before gc: list nodes free: 3539302

after gc: idd nodes used:5437301, unused:58562699; list nodes free:259243515
.
EG iterations: 1
abstracting: (0<=0)
states: 127,545,137 (8)
.abstracting: (1<=p14)
states: 56,650,501 (7)
abstracting: (0<=0)
states: 127,545,137 (8)
.abstracting: (1<=p14)
states: 56,650,501 (7)

before gc: list nodes free: 2031834

after gc: idd nodes used:4423250, unused:59576750; list nodes free:263786675
abstracting: (0<=0)
states: 127,545,137 (8)
MC time: 5m 5.250sec

checking: EF [[AF [1<=p31] & [EF [EX [~ [p39<=0]]] & EG [p74<=0]]]]
normalized: E [true U [[EG [p74<=0] & E [true U EX [~ [p39<=0]]]] & ~ [EG [~ [1<=p31]]]]]

abstracting: (1<=p31)
states: 17,723,659 (7)
..
before gc: list nodes free: 2544770

after gc: idd nodes used:11755833, unused:52244167; list nodes free:231676278
.MC time: 4m30.678sec

checking: AF [EG [[~ [p89<=p25] | [~ [1<=p110] | [~ [p21<=p41] & ~ [p90<=1]]]]]]
normalized: ~ [EG [~ [EG [[[[~ [p90<=1] & ~ [p21<=p41]] | ~ [1<=p110]] | ~ [p89<=p25]]]]]]

abstracting: (p89<=p25)
states: 78,648,748 (7)
abstracting: (1<=p110)
states: 56,650,501 (7)
abstracting: (p21<=p41)
states: 112,871,246 (8)

before gc: list nodes free: 2073698

after gc: idd nodes used:12394433, unused:51605567; list nodes free:228690505
abstracting: (p90<=1)
states: 127,545,137 (8)

before gc: list nodes free: 1750809

after gc: idd nodes used:17724398, unused:46275602; list nodes free:205436377
.MC time: 4m 1.672sec

checking: AG [EF [~ [10<=sum(p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80)]]]
normalized: ~ [E [true U ~ [E [true U ~ [10<=sum(p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80)]]]]]

abstracting: (10<=sum(p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80))
states: 7,434,065 (6)
-> the formula is TRUE

FORMULA Sudoku-PT-AN04-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m39.390sec

checking: AG [[E [p73<=p60 U p42<=p70] | A [p80<=0 U [[EX [1<=p87] | [EF [p35<=p71] & [p3<=p13 & 1<=p93]]] | [AG [1<=p79] | [[1<=p85 & 1<=p80] | [1<=p17 & [p80<=p110 & ~ [p47<=1]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[[[[1<=p17 & [p80<=p110 & ~ [p47<=1]]] | [1<=p85 & 1<=p80]] | ~ [E [true U ~ [1<=p79]]]] | [[[p3<=p13 & 1<=p93] & E [true U p35<=p71]] | EX [1<=p87]]]]]] & ~ [E [~ [[[[[1<=p17 & [p80<=p110 & ~ [p47<=1]]] | [1<=p85 & 1<=p80]] | ~ [E [true U ~ [1<=p79]]]] | [[[p3<=p13 & 1<=p93] & E [true U p35<=p71]] | EX [1<=p87]]]] U [~ [p80<=0] & ~ [[[[[1<=p17 & [p80<=p110 & ~ [p47<=1]]] | [1<=p85 & 1<=p80]] | ~ [E [true U ~ [1<=p79]]]] | [[[p3<=p13 & 1<=p93] & E [true U p35<=p71]] | EX [1<=p87]]]]]]]] | E [p73<=p60 U p42<=p70]]]]]

abstracting: (p42<=p70)
states: 112,871,246 (8)
abstracting: (p73<=p60)
states: 112,128,071 (8)
abstracting: (1<=p87)
states: 56,650,501 (7)

before gc: list nodes free: 2350864

after gc: idd nodes used:13669629, unused:50330371; list nodes free:223068437
.abstracting: (p35<=p71)
states: 112,871,246 (8)
abstracting: (1<=p93)
states: 56,650,501 (7)
abstracting: (p3<=p13)
states: 96,528,689 (7)
abstracting: (1<=p79)
states: 17,723,659 (7)
abstracting: (1<=p80)
states: 56,650,501 (7)
abstracting: (1<=p85)
states: 56,650,501 (7)
abstracting: (p47<=1)
states: 127,545,137 (8)
abstracting: (p80<=p110)
states: 95,708,446 (7)
abstracting: (1<=p17)
states: 17,723,659 (7)
abstracting: (p80<=0)
states: 70,894,636 (7)
abstracting: (1<=p87)
states: 56,650,501 (7)
MC time: 3m47.822sec

checking: EX [AF [~ [A [~ [AX [1<=0]] U [sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=sum(p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96) & sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=64]]]]]
normalized: EX [~ [EG [[~ [EG [~ [[sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=sum(p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96) & sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=64]]]] & ~ [E [~ [[sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=sum(p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96) & sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=64]] U [~ [EX [~ [1<=0]]] & ~ [[sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=sum(p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96) & sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=64]]]]]]]]]

abstracting: (sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=64)
MC time: 3m18.000sec

checking: E [~ [EX [0<=0]] U EG [EF [[sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16) & sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)]]]]
normalized: E [~ [EX [0<=0]] U EG [E [true U [sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16) & sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)]]]]

abstracting: (sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)<=sum(p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0))
MC time: 2m54.000sec

checking: AF [EX [[AG [~ [1<=p78]] | AX [~ [1<=p11]]]]]
normalized: ~ [EG [~ [EX [[~ [EX [1<=p11]] | ~ [E [true U 1<=p78]]]]]]]

abstracting: (1<=p78)
states: 17,723,659 (7)
abstracting: (1<=p11)
states: 56,650,501 (7)

before gc: list nodes free: 1689465

after gc: idd nodes used:27714018, unused:36285982; list nodes free:161400331
.
before gc: list nodes free: 2322014

after gc: idd nodes used:28979763, unused:35020237; list nodes free:155849852
.
before gc: list nodes free: 2044646

after gc: idd nodes used:28296914, unused:35703086; list nodes free:159106530
.
before gc: list nodes free: 2710590

after gc: idd nodes used:29532822, unused:34467178; list nodes free:153778206
.
before gc: list nodes free: 2729302

after gc: idd nodes used:29717370, unused:34282630; list nodes free:152959663
.
before gc: list nodes free: 2220939

after gc: idd nodes used:35847607, unused:28152393; list nodes free:125828027
......
EG iterations: 9
-> the formula is TRUE

FORMULA Sudoku-PT-AN04-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6048808 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098124 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1766 (27), effective:64 (1)

initing FirstDep: 0m 0.000sec


iterations count:113 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 384 sec


net_ddint.h:600: Timeout: after 341 sec


iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 303 sec


net_ddint.h:600: Timeout: after 269 sec


net_ddint.h:600: Timeout: after 239 sec


iterations count:553 (8), effective:35 (0)

iterations count:113 (1), effective:1 (0)

iterations count:113 (1), effective:1 (0)

iterations count:64 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 226 sec


idd.h:1025: Timeout: after 197 sec


idd.h:1025: Timeout: after 173 sec


iterations count:113 (1), effective:1 (0)

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="Sudoku-PT-AN04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Sudoku-PT-AN04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912708300185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN04.tgz
mv Sudoku-PT-AN04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;