About the Execution of Marcie+red for Sudoku-PT-AN11
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7096.915 | 3600000.00 | 3640613.00 | 9443.40 | ??F???F?T?F?F?F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r490-tall-167912708400241.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-AN11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708400241
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 275K Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.1M Feb 26 09:06 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 297K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 510K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 755K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 26 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 161K 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 746K 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-AN11-CTLCardinality-00
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-01
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-02
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-03
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-04
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-05
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-06
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-07
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-08
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-09
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-10
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-11
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-12
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-13
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-14
FORMULA_NAME Sudoku-PT-AN11-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679216630282
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-AN11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 09:03:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 09:03:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:03:52] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-19 09:03:52] [INFO ] Transformed 1694 places.
[2023-03-19 09:03:52] [INFO ] Transformed 1331 transitions.
[2023-03-19 09:03:52] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 103 ms.
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 22 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 09:03:52] [INFO ] Computed 363 place invariants in 39 ms
[2023-03-19 09:03:52] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-19 09:03:52] [INFO ] Invariant cache hit.
[2023-03-19 09:03:53] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2023-03-19 09:03:53] [INFO ] Invariant cache hit.
[2023-03-19 09:03:54] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2156 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2023-03-19 09:03:54] [INFO ] Flatten gal took : 151 ms
[2023-03-19 09:03:55] [INFO ] Flatten gal took : 98 ms
[2023-03-19 09:03:55] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1400 ms. (steps per millisecond=7 ) properties (out of 71) seen :49
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-19 09:03:57] [INFO ] Invariant cache hit.
[2023-03-19 09:03:58] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:21
[2023-03-19 09:03:59] [INFO ] [Nat]Absence check using 363 positive place invariants in 77 ms returned sat
[2023-03-19 09:04:03] [INFO ] After 2752ms SMT Verify possible using state equation in natural domain returned unsat :18 sat :4
[2023-03-19 09:04:06] [INFO ] After 5912ms SMT Verify possible using trap constraints in natural domain returned unsat :18 sat :4
Attempting to minimize the solution found.
Minimization took 2496 ms.
[2023-03-19 09:04:09] [INFO ] After 10859ms SMT Verify possible using all constraints in natural domain returned unsat :18 sat :4
Fused 22 Parikh solutions to 4 different solutions.
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=17 )
Parikh walk visited 4 properties in 32 ms.
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
[2023-03-19 09:04:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 09:04:09] [INFO ] Flatten gal took : 69 ms
FORMULA Sudoku-PT-AN11-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 09:04:09] [INFO ] Flatten gal took : 72 ms
[2023-03-19 09:04:09] [INFO ] Input system was already deterministic with 1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 6 formulas.
FORMULA Sudoku-PT-AN11-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 30 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:09] [INFO ] Flatten gal took : 41 ms
[2023-03-19 09:04:09] [INFO ] Flatten gal took : 43 ms
[2023-03-19 09:04:09] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 7 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:09] [INFO ] Flatten gal took : 54 ms
[2023-03-19 09:04:09] [INFO ] Flatten gal took : 54 ms
[2023-03-19 09:04:09] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 29 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 53 ms
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 49 ms
[2023-03-19 09:04:10] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 44 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 49 ms
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 48 ms
[2023-03-19 09:04:10] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 8 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 35 ms
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 43 ms
[2023-03-19 09:04:10] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 21 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 45 ms
[2023-03-19 09:04:10] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 358 are kept as prefixes of interest. Removing 1336 places using SCC suffix rule.5 ms
Discarding 1336 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 55 ms. Remains 358 /1694 variables (removed 1336) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 358/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 32 ms
[2023-03-19 09:04:10] [INFO ] Flatten gal took : 35 ms
[2023-03-19 09:04:11] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 25 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 34 ms
FORMULA Sudoku-PT-AN11-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:04:11] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1327 places and 0 transitions.
Iterating post reduction 0 with 1327 rules applied. Total rules applied 1327 place count 367 transition count 1331
Applied a total of 1327 rules in 23 ms. Remains 367 /1694 variables (removed 1327) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 367/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 33 ms
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:04:11] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 369 are kept as prefixes of interest. Removing 1325 places using SCC suffix rule.3 ms
Discarding 1325 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 32 ms. Remains 369 /1694 variables (removed 1325) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 369/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 33 ms
FORMULA Sudoku-PT-AN11-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:04:11] [INFO ] Input system was already deterministic with 1331 transitions.
Support contains 0 out of 369 places (down from 9) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 23 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 363/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 32 ms
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 35 ms
[2023-03-19 09:04:11] [INFO ] Input system was already deterministic with 1331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1325 places and 0 transitions.
Iterating post reduction 0 with 1325 rules applied. Total rules applied 1325 place count 369 transition count 1331
Applied a total of 1325 rules in 23 ms. Remains 369 /1694 variables (removed 1325) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 369/1694 places, 1331/1331 transitions.
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 33 ms
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:04:11] [INFO ] Input system was already deterministic with 1331 transitions.
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 48 ms
[2023-03-19 09:04:11] [INFO ] Flatten gal took : 48 ms
[2023-03-19 09:04:12] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-19 09:04:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 7 ms.
Total runtime 20291 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: 1694 NrTr: 1331 NrArc: 5324)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.174sec
net check time: 0m 0.000sec
init dd package: 0m 2.740sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9004888 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16055860 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.001sec
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-AN11"
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-AN11, 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-167912708400241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 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 '
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 ;