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.r329-tall-167889202400714.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 ltsminxred
Input is ResAllocation-PT-R003C050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202400714
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 360K 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 ResAllocation-PT-R003C050-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679165822968

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 18:57:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 18:57:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:57:04] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-18 18:57:04] [INFO ] Transformed 300 places.
[2023-03-18 18:57:04] [INFO ] Transformed 200 transitions.
[2023-03-18 18:57:04] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 166 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2023-03-18 18:57:04] [INFO ] Computed 150 place invariants in 20 ms
[2023-03-18 18:57:05] [INFO ] Implicit Places using invariants in 475 ms returned [295, 297]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 502 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 298/300 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 298/300 places, 200/200 transitions.
Support contains 166 out of 298 places after structural reductions.
[2023-03-18 18:57:05] [INFO ] Flatten gal took : 49 ms
[2023-03-18 18:57:05] [INFO ] Flatten gal took : 27 ms
[2023-03-18 18:57:05] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 158 out of 298 places (down from 166) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 73) seen :66
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 200 rows 298 cols
[2023-03-18 18:57:06] [INFO ] Computed 148 place invariants in 6 ms
[2023-03-18 18:57:06] [INFO ] [Real]Absence check using 148 positive place invariants in 22 ms returned sat
[2023-03-18 18:57:06] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-18 18:57:06] [INFO ] [Nat]Absence check using 148 positive place invariants in 21 ms returned sat
[2023-03-18 18:57:06] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-18 18:57:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 5 ms to minimize.
[2023-03-18 18:57:06] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-18 18:57:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-18 18:57:07] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
[2023-03-18 18:57:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 4 ms to minimize.
[2023-03-18 18:57:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 229 ms
[2023-03-18 18:57:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 18:57:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2023-03-18 18:57:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2023-03-18 18:57:07] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-18 18:57:07] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 7 ms.
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 250 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 250 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 99 place count 248 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 248 transition count 150
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 247 transition count 149
Free-agglomeration rule (complex) applied 47 times.
Iterating global reduction 2 with 47 rules applied. Total rules applied 149 place count 247 transition count 102
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t26.t27 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 2 edges and 107 vertex of which 2 / 107 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 2 with 42 rules applied. Total rules applied 191 place count 106 transition count 61
Reduce places removed 78 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 119 rules applied. Total rules applied 310 place count 28 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 320 place count 22 transition count 16
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 322 place count 22 transition count 14
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 324 place count 20 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 324 place count 20 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 327 place count 18 transition count 13
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 329 place count 18 transition count 11
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 337 place count 12 transition count 9
Applied a total of 337 rules in 76 ms. Remains 12 /298 variables (removed 286) and now considering 9/200 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 12/298 places, 9/200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 19 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 18 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 15 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 21 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 12 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 14 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 13 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 14 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 28 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 13 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 11 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 12 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 11 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 11 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 11 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 11 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 10 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 10 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 9 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 10 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 9 ms
[2023-03-18 18:57:07] [INFO ] Flatten gal took : 9 ms
[2023-03-18 18:57:07] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 0 with 88 rules applied. Total rules applied 88 place count 254 transition count 156
Applied a total of 88 rules in 14 ms. Remains 254 /298 variables (removed 44) and now considering 156/200 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 254/298 places, 156/200 transitions.
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 6 ms
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 6 ms
[2023-03-18 18:57:08] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 8 ms
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 8 ms
[2023-03-18 18:57:08] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 256 transition count 158
Applied a total of 84 rules in 14 ms. Remains 256 /298 variables (removed 42) and now considering 158/200 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 256/298 places, 158/200 transitions.
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 6 ms
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 7 ms
[2023-03-18 18:57:08] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 8 ms
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 9 ms
[2023-03-18 18:57:08] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 249 transition count 151
Applied a total of 98 rules in 13 ms. Remains 249 /298 variables (removed 49) and now considering 151/200 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 249/298 places, 151/200 transitions.
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 6 ms
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 6 ms
[2023-03-18 18:57:08] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 8 ms
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 9 ms
[2023-03-18 18:57:08] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 9 ms
[2023-03-18 18:57:08] [INFO ] Flatten gal took : 8 ms
[2023-03-18 18:57:08] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 18:57:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 298 places, 200 transitions and 890 arcs took 2 ms.
Total runtime 3880 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/481/ctl_0_ --ctl=/tmp/481/ctl_1_ --ctl=/tmp/481/ctl_2_ --ctl=/tmp/481/ctl_3_ --ctl=/tmp/481/ctl_4_ --ctl=/tmp/481/ctl_5_ --ctl=/tmp/481/ctl_6_ --ctl=/tmp/481/ctl_7_ --ctl=/tmp/481/ctl_8_ --ctl=/tmp/481/ctl_9_ --ctl=/tmp/481/ctl_10_ --ctl=/tmp/481/ctl_11_ --ctl=/tmp/481/ctl_12_ --ctl=/tmp/481/ctl_13_ --ctl=/tmp/481/ctl_14_ --ctl=/tmp/481/ctl_15_ --mu-par --mu-opt
FORMULA ResAllocation-PT-R003C050-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C050-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679165889870

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name ResAllocation-PT-R003C050-CTLFireability-00
ctl formula formula --ctl=/tmp/481/ctl_0_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-01
ctl formula formula --ctl=/tmp/481/ctl_1_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-02
ctl formula formula --ctl=/tmp/481/ctl_2_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-03
ctl formula formula --ctl=/tmp/481/ctl_3_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-04
ctl formula formula --ctl=/tmp/481/ctl_4_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-05
ctl formula formula --ctl=/tmp/481/ctl_5_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-06
ctl formula formula --ctl=/tmp/481/ctl_6_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-07
ctl formula formula --ctl=/tmp/481/ctl_7_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-08
ctl formula formula --ctl=/tmp/481/ctl_8_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-09
ctl formula formula --ctl=/tmp/481/ctl_9_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-10
ctl formula formula --ctl=/tmp/481/ctl_10_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-11
ctl formula formula --ctl=/tmp/481/ctl_11_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-12
ctl formula formula --ctl=/tmp/481/ctl_12_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-13
ctl formula formula --ctl=/tmp/481/ctl_13_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-14
ctl formula formula --ctl=/tmp/481/ctl_14_
ctl formula name ResAllocation-PT-R003C050-CTLFireability-15
ctl formula formula --ctl=/tmp/481/ctl_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 298 places, 200 transitions and 890 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 200->100 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 298; there are 100 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 1330 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.060 real 0.220 user 0.040 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 4.87175380081244e+28 states, 2644 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/481/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_15_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_14_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/481/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_13_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/481/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_4_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/481/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/481/ctl_8_ holds for the initial state
pnml2lts-sym: group_next: 3506 nodes total
pnml2lts-sym: group_explored: 2310 nodes, 2144 short vectors total
pnml2lts-sym: max token count: 1

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="ResAllocation-PT-R003C050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ResAllocation-PT-R003C050, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202400714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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