fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r490-tall-167912708200145
Last Updated
May 14, 2023

About the Execution of Marcie+red for Sudoku-COL-BN09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6836.491 3600000.00 3645723.00 8793.00 ?F??????T?????T? 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-167912708200145.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-COL-BN09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708200145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:08 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 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 146K 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-COL-BN09-CTLCardinality-00
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-01
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-02
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-03
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-04
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-05
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-06
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-07
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-08
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-09
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-10
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-11
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-12
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-13
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-14
FORMULA_NAME Sudoku-COL-BN09-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679193854014

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-COL-BN09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 02:44:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 02:44:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:44:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-19 02:44:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 02:44:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 670 ms
[2023-03-19 02:44:16] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
[2023-03-19 02:44:16] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2023-03-19 02:44:16] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
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 1 formulas.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10042 steps, including 120 resets, run finished after 85 ms. (steps per millisecond=118 ) properties (out of 64) seen :37
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=215 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=215 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=215 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 3 ms. (steps per millisecond=359 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 3 ms. (steps per millisecond=359 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 3 ms. (steps per millisecond=359 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=215 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=134 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=215 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1078 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=269 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-19 02:44:16] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 02:44:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 02:44:16] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :14 sat :1 real:12
[2023-03-19 02:44:16] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :14 sat :1 real:12
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 02:44:16] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :1 real:12
[2023-03-19 02:44:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 02:44:16] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :24 sat :3
[2023-03-19 02:44:16] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 02:44:16] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :3
Fused 27 Parikh solutions to 2 different solutions.
Finished Parikh walk after 12 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 2 ms.
Successfully simplified 24 atomic propositions for a total of 16 simplifications.
FORMULA Sudoku-COL-BN09-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 02:44:16] [INFO ] Flatten gal took : 16 ms
[2023-03-19 02:44:16] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2023-03-19 02:44:16] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 41 ms.
[2023-03-19 02:44:16] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2023-03-19 02:44:16] [INFO ] Computed 324 place invariants in 25 ms
[2023-03-19 02:44:17] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-19 02:44:17] [INFO ] Invariant cache hit.
[2023-03-19 02:44:17] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2023-03-19 02:44:17] [INFO ] Invariant cache hit.
[2023-03-19 02:44:18] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1310 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2023-03-19 02:44:18] [INFO ] Flatten gal took : 122 ms
[2023-03-19 02:44:18] [INFO ] Flatten gal took : 87 ms
[2023-03-19 02:44:19] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 1726 ms. (steps per millisecond=5 ) properties (out of 62) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-19 02:44:21] [INFO ] Invariant cache hit.
[2023-03-19 02:44:23] [INFO ] [Real]Absence check using 324 positive place invariants in 64 ms returned sat
[2023-03-19 02:44:23] [INFO ] After 863ms SMT Verify possible using all constraints in real domain returned unsat :12 sat :0 real:13
[2023-03-19 02:44:24] [INFO ] [Nat]Absence check using 324 positive place invariants in 64 ms returned sat
[2023-03-19 02:44:34] [INFO ] After 9902ms SMT Verify possible using state equation in natural domain returned unsat :22 sat :3
[2023-03-19 02:44:44] [INFO ] After 19937ms SMT Verify possible using trap constraints in natural domain returned unsat :22 sat :3
Attempting to minimize the solution found.
Minimization took 4183 ms.
[2023-03-19 02:44:48] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :2
Fused 25 Parikh solutions to 3 different solutions.
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=15 )
Parikh walk visited 3 properties in 14 ms.
Successfully simplified 22 atomic propositions for a total of 14 simplifications.
[2023-03-19 02:44:48] [INFO ] Flatten gal took : 52 ms
[2023-03-19 02:44:48] [INFO ] Flatten gal took : 56 ms
[2023-03-19 02:44:49] [INFO ] Input system was already deterministic with 729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 71 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:49] [INFO ] Flatten gal took : 40 ms
[2023-03-19 02:44:49] [INFO ] Flatten gal took : 41 ms
[2023-03-19 02:44:49] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:49] [INFO ] Flatten gal took : 82 ms
[2023-03-19 02:44:49] [INFO ] Flatten gal took : 39 ms
[2023-03-19 02:44:49] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 56 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 324/1053 places, 729/729 transitions.
[2023-03-19 02:44:49] [INFO ] Flatten gal took : 33 ms
[2023-03-19 02:44:49] [INFO ] Flatten gal took : 39 ms
[2023-03-19 02:44:49] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:49] [INFO ] Flatten gal took : 58 ms
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 51 ms
[2023-03-19 02:44:50] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 31 ms
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 34 ms
[2023-03-19 02:44:50] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 32 ms
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 34 ms
[2023-03-19 02:44:50] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 9 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 324/1053 places, 729/729 transitions.
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 27 ms
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 27 ms
[2023-03-19 02:44:50] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.5 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 324/1053 places, 729/729 transitions.
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 27 ms
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 29 ms
[2023-03-19 02:44:50] [INFO ] Input system was already deterministic with 729 transitions.
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=11 )
FORMULA Sudoku-COL-BN09-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 35 ms
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 34 ms
[2023-03-19 02:44:50] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 324/1053 places, 729/729 transitions.
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 26 ms
[2023-03-19 02:44:50] [INFO ] Flatten gal took : 28 ms
[2023-03-19 02:44:50] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 19 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 324/1053 places, 729/729 transitions.
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 26 ms
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 28 ms
[2023-03-19 02:44:51] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 30 ms
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 33 ms
[2023-03-19 02:44:51] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 31 ms
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 34 ms
[2023-03-19 02:44:51] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1053/1053 places, 729/729 transitions.
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 31 ms
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 31 ms
[2023-03-19 02:44:51] [INFO ] Input system was already deterministic with 729 transitions.
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 36 ms
[2023-03-19 02:44:51] [INFO ] Flatten gal took : 37 ms
[2023-03-19 02:44:51] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2023-03-19 02:44:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 4 ms.
Total runtime 36324 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: 1053 NrTr: 729 NrArc: 3645)

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

net check time: 0m 0.000sec

init dd package: 0m 2.639sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9309560 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097068 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-COL-BN09"
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-COL-BN09, 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-167912708200145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN09.tgz
mv Sudoku-COL-BN09 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 ;