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

About the Execution of Smart+red for ParamProductionCell-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
475.403 275756.00 288391.00 1106.70 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.r281-smll-167863550900239.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 smartxred
Input is ParamProductionCell-PT-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r281-smll-167863550900239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1678920258835

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=smartxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-2
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 22:44:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-15 22:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:44:22] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-15 22:44:22] [INFO ] Transformed 231 places.
[2023-03-15 22:44:22] [INFO ] Transformed 202 transitions.
[2023-03-15 22:44:22] [INFO ] Found NUPN structural information;
[2023-03-15 22:44:22] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 362 ms.
Built sparse matrix representations for Structural reductions in 12 ms.24423KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 55 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 55 ms. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 26 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 22:44:22] [INFO ] Computed 59 place invariants in 40 ms
[2023-03-15 22:44:23] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-15 22:44:23] [INFO ] Invariant cache hit.
[2023-03-15 22:44:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:44:23] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2023-03-15 22:44:23] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 22:44:23] [INFO ] Invariant cache hit.
[2023-03-15 22:44:24] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1336 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2597 ms (no deadlock found). (steps per millisecond=481 )
Random directed walk for 1250000 steps, including 0 resets, run took 1493 ms (no deadlock found). (steps per millisecond=837 )
[2023-03-15 22:44:28] [INFO ] Invariant cache hit.
[2023-03-15 22:44:28] [INFO ] [Real]Absence check using 35 positive place invariants in 55 ms returned sat
[2023-03-15 22:44:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 259 ms returned sat
[2023-03-15 22:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:44:29] [INFO ] [Real]Absence check using state equation in 1347 ms returned sat
[2023-03-15 22:44:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:44:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2023-03-15 22:44:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 26 ms returned sat
[2023-03-15 22:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:44:30] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2023-03-15 22:44:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:44:30] [INFO ] [Nat]Added 68 Read/Feed constraints in 48 ms returned sat
[2023-03-15 22:44:31] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 4 ms to minimize.
[2023-03-15 22:44:31] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2023-03-15 22:44:31] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2023-03-15 22:44:31] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2023-03-15 22:44:31] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:44:31] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:44:32] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:44:32] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:44:32] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:44:32] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:44:32] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:44:33] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:44:33] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-15 22:44:33] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2023-03-15 22:44:33] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:44:33] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:44:34] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:44:34] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2023-03-15 22:44:34] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:44:34] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2023-03-15 22:44:34] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:44:34] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2023-03-15 22:44:35] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:44:35] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:44:35] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2023-03-15 22:44:35] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-15 22:44:35] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:44:35] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 0 ms to minimize.
[2023-03-15 22:44:36] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 1 ms to minimize.
[2023-03-15 22:44:36] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:44:36] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-15 22:44:36] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-15 22:44:36] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:44:37] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2023-03-15 22:44:37] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 5 ms to minimize.
[2023-03-15 22:44:37] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:44:37] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:44:37] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2023-03-15 22:44:38] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:44:38] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2023-03-15 22:44:38] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:44:38] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2023-03-15 22:44:38] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2023-03-15 22:44:38] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2023-03-15 22:44:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 44 trap constraints in 7934 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Applied a total of 64 rules in 32 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2023-03-15 22:44:38] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-15 22:44:39] [INFO ] Implicit Places using invariants in 300 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 304 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 160/231 places, 170/202 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 160 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 141 transition count 151
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 38 place count 141 transition count 145
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 135 transition count 145
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 152 place count 84 transition count 94
Applied a total of 152 rules in 10 ms. Remains 84 /160 variables (removed 76) and now considering 94/170 (removed 76) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 22:44:39] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:44:39] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-15 22:44:39] [INFO ] Invariant cache hit.
[2023-03-15 22:44:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:44:39] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 707 ms. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 2 formulas.
Finished random walk after 568 steps, including 0 resets, run visited all 92 properties in 121 ms. (steps per millisecond=4 )
Able to resolve query QuasiLiveness after proving 94 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Applied a total of 64 rules in 14 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2023-03-15 22:44:39] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-15 22:44:40] [INFO ] Implicit Places using invariants in 579 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 581 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 160/231 places, 170/202 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 160 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 141 transition count 151
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 38 place count 141 transition count 145
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 135 transition count 145
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 152 place count 84 transition count 94
Applied a total of 152 rules in 13 ms. Remains 84 /160 variables (removed 76) and now considering 94/170 (removed 76) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 22:44:40] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:44:40] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-15 22:44:40] [INFO ] Invariant cache hit.
[2023-03-15 22:44:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:44:40] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 994 ms. Remains : 84/231 places, 94/202 transitions.
Unable to solve all queries for examination Liveness. Remains :94 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 94 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 18610 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ParamProductionCell (PT), instance 2
Examination Liveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Liveness.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 231 places, 202 transitions, 846 arcs.
(potential((tk(P16)>=1) & (tk(P5)>=1)))
(potential((tk(P18)>=1)))
(potential((tk(P17)>=1) & (tk(P13)>=1)))
(potential((tk(P33)>=1)))
(potential((tk(P27)>=1) & (tk(P20)>=1)))
(potential((tk(P28)>=1) & (tk(P22)>=1)))
(potential((tk(P23)>=1) & (tk(P19)>=1)))
(potential((tk(P28)>=1) & (tk(P21)>=1) & (tk(P20)>=1)))
(potential((tk(P29)>=1) & (tk(P25)>=1)))
(potential((tk(P30)>=1) & (tk(P21)>=1)))
(potential((tk(P24)>=1) & (tk(P19)>=1)))
(potential((tk(P30)>=1) & (tk(P26)>=1) & (tk(P25)>=1)))
(potential((tk(P34)>=1) & (tk(P32)>=1)))
(potential((tk(P35)>=1) & (tk(P26)>=1)))
(potential((tk(P31)>=1) & (tk(P19)>=1)))
(potential((tk(P35)>=1) & (tk(P22)>=1) & (tk(P32)>=1)))
(potential((tk(P36)>=1) & (tk(P12)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P37)>=1) & (tk(P8)>=1)))
(potential((tk(P38)>=1)))
(potential((tk(P49)>=1) & (tk(P42)>=1)))
(potential((tk(P50)>=1) & (tk(P40)>=1)))
(potential((tk(P43)>=1) & (tk(P39)>=1)))
(potential((tk(P50)>=1) & (tk(P42)>=1) & (tk(P41)>=1)))
(potential((tk(P51)>=1) & (tk(P47)>=1)))
(potential((tk(P52)>=1) & (tk(P45)>=1)))
(potential((tk(P48)>=1) & (tk(P44)>=1)))
(potential((tk(P52)>=1) & (tk(P47)>=1) & (tk(P46)>=1)))
(potential((tk(P56)>=1) & (tk(P47)>=1)))
(potential((tk(P57)>=1) & (tk(P46)>=1)))
(potential((tk(P48)>=1) & (tk(P55)>=1)))
(potential((tk(P57)>=1) & (tk(P47)>=1) & (tk(P45)>=1)))
(potential((tk(P58)>=1) & (tk(P42)>=1)))
(potential((tk(P59)>=1) & (tk(P41)>=1)))
(potential((tk(P43)>=1) & (tk(P53)>=1)))
(potential((tk(P59)>=1) & (tk(P42)>=1) & (tk(P40)>=1)))
(potential((tk(P60)>=1) & (tk(P9)>=1)))
(potential((tk(P61)>=1) & (tk(P2)>=1)))
(potential((tk(P69)>=1)))
(potential((tk(P62)>=1)))
(potential((tk(P70)>=1) & (tk(P65)>=1)))
(potential((tk(P71)>=1) & (tk(P63)>=1)))
(potential((tk(P66)>=1) & (tk(P67)>=1)))
(potential((tk(P71)>=1) & (tk(P65)>=1) & (tk(P64)>=1)))
(potential((tk(P72)>=1) & (tk(P65)>=1)))
(potential((tk(P73)>=1) & (tk(P64)>=1)))
(potential((tk(P66)>=1) & (tk(P68)>=1)))
(potential((tk(P73)>=1) & (tk(P65)>=1) & (tk(P63)>=1)))
(potential((tk(P74)>=1) & (tk(P4)>=1)))
(potential((tk(P75)>=1) & (tk(P11)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P76)>=1)))
(potential((tk(P84)>=1) & (tk(P79)>=1)))
(potential((tk(P85)>=1) & (tk(P77)>=1)))
(potential((tk(P80)>=1) & (tk(P81)>=1)))
(potential((tk(P85)>=1) & (tk(P79)>=1) & (tk(P78)>=1)))
(potential((tk(P86)>=1) & (tk(P79)>=1)))
(potential((tk(P87)>=1) & (tk(P78)>=1)))
(potential((tk(P80)>=1) & (tk(P82)>=1)))
(potential((tk(P87)>=1) & (tk(P79)>=1) & (tk(P77)>=1)))
(potential((tk(P88)>=1) & (tk(P14)>=1)))
(potential((tk(P89)>=1) & (tk(P15)>=1)))
(potential((tk(P92)>=1)))
(potential((tk(P90)>=1) & (tk(P10)>=1)))
(potential((tk(P96)>=1)))
(potential((tk(P91)>=1)))
(potential((tk(P128)>=1)))
(potential((tk(P93)>=1) & (tk(P15)>=1)))
(potential((tk(P98)>=1) & (tk(P95)>=1)))
(potential((tk(P105)>=1) & (tk(P95)>=1)))
(potential((tk(P106)>=1) & (tk(P95)>=1)))
(potential((tk(P107)>=1) & (tk(P99)>=1)))
(potential((tk(P108)>=1) & (tk(P97)>=1)))
(potential((tk(P101)>=1) & (tk(P100)>=1)))
(potential((tk(P108)>=1) & (tk(P98)>=1) & (tk(P99)>=1)))
(potential((tk(P109)>=1) & (tk(P102)>=1)))
(potential((tk(P110)>=1) & (tk(P97)>=1)))
(potential((tk(P103)>=1) & (tk(P100)>=1)))
(potential((tk(P110)>=1) & (tk(P105)>=1) & (tk(P102)>=1)))
(potential((tk(P111)>=1) & (tk(P99)>=1)))
(potential((tk(P112)>=1) & (tk(P97)>=1)))
(potential((tk(P104)>=1) & (tk(P100)>=1)))
(potential((tk(P112)>=1) & (tk(P106)>=1) & (tk(P99)>=1)))
(potential((tk(P117)>=1) & (tk(P121)>=1)))
(potential((tk(P122)>=1) & (tk(P115)>=1)))
(potential((tk(P123)>=1) & (tk(P113)>=1)))
(potential((tk(P116)>=1) & (tk(P94)>=1)))
(potential((tk(P123)>=1) & (tk(P114)>=1) & (tk(P115)>=1)))
(potential((tk(P124)>=1) & (tk(P118)>=1)))
(potential((tk(P125)>=1) & (tk(P114)>=1)))
(potential((tk(P119)>=1) & (tk(P116)>=1)))
(potential((tk(P125)>=1) & (tk(P113)>=1) & (tk(P118)>=1)))
(potential((tk(P98)>=1) & (tk(P127)>=1)))
(potential((tk(P105)>=1) & (tk(P127)>=1)))
(potential((tk(P97)>=1) & (tk(P127)>=1)))
(potential((tk(P132)>=1) & (tk(P102)>=1)))
(potential((tk(P133)>=1) & (tk(P106)>=1)))
(potential((tk(P129)>=1) & (tk(P100)>=1)))
(potential((tk(P133)>=1) & (tk(P98)>=1) & (tk(P102)>=1)))
(potential((tk(P134)>=1) & (tk(P102)>=1)))
(potential((tk(P135)>=1) & (tk(P106)>=1)))
(potential((tk(P130)>=1) & (tk(P100)>=1)))
(potential((tk(P135)>=1) & (tk(P105)>=1) & (tk(P102)>=1)))
(potential((tk(P136)>=1) & (tk(P102)>=1)))
(potential((tk(P137)>=1) & (tk(P106)>=1)))
(potential((tk(P131)>=1) & (tk(P100)>=1)))
(potential((tk(P137)>=1) & (tk(P97)>=1) & (tk(P102)>=1)))
(potential((tk(P120)>=1) & (tk(P139)>=1)))
(potential((tk(P141)>=1) & (tk(P115)>=1)))
(potential((tk(P142)>=1) & (tk(P138)>=1)))
(potential((tk(P116)>=1) & (tk(P126)>=1)))
(potential((tk(P142)>=1) & (tk(P114)>=1) & (tk(P115)>=1)))
(potential((tk(P143)>=1) & (tk(P118)>=1)))
(potential((tk(P144)>=1) & (tk(P114)>=1)))
(potential((tk(P140)>=1) & (tk(P116)>=1)))
(potential((tk(P144)>=1) & (tk(P138)>=1) & (tk(P118)>=1)))
(potential((tk(P145)>=1) & (tk(P7)>=1)))
(potential((tk(P146)>=1) & (tk(P15)>=1)))
(potential((tk(P149)>=1)))
(potential((tk(P147)>=1) & (tk(P6)>=1)))
(potential((tk(P177)>=1)))
(potential((tk(P148)>=1)))
(potential((tk(P153)>=1)))
(potential((tk(P150)>=1) & (tk(P15)>=1)))
(potential((tk(P105)>=1) & (tk(P152)>=1)))
(potential((tk(P106)>=1) & (tk(P152)>=1)))
(potential((tk(P97)>=1) & (tk(P152)>=1)))
(potential((tk(P157)>=1) & (tk(P102)>=1)))
(potential((tk(P158)>=1) & (tk(P98)>=1)))
(potential((tk(P154)>=1) & (tk(P100)>=1)))
(potential((tk(P158)>=1) & (tk(P105)>=1) & (tk(P102)>=1)))
(potential((tk(P159)>=1) & (tk(P102)>=1)))
(potential((tk(P160)>=1) & (tk(P98)>=1)))
(potential((tk(P155)>=1) & (tk(P100)>=1)))
(potential((tk(P160)>=1) & (tk(P106)>=1) & (tk(P102)>=1)))
(potential((tk(P161)>=1) & (tk(P102)>=1)))
(potential((tk(P162)>=1) & (tk(P98)>=1)))
(potential((tk(P156)>=1) & (tk(P100)>=1)))
(potential((tk(P162)>=1) & (tk(P97)>=1) & (tk(P102)>=1)))
(potential((tk(P167)>=1) & (tk(P171)>=1)))
(potential((tk(P172)>=1) & (tk(P165)>=1)))
(potential((tk(P173)>=1) & (tk(P163)>=1)))
(potential((tk(P166)>=1) & (tk(P151)>=1)))
(potential((tk(P173)>=1) & (tk(P164)>=1) & (tk(P165)>=1)))
(potential((tk(P174)>=1) & (tk(P168)>=1)))
(potential((tk(P175)>=1) & (tk(P164)>=1)))
(potential((tk(P169)>=1) & (tk(P166)>=1)))
(potential((tk(P175)>=1) & (tk(P163)>=1) & (tk(P168)>=1)))
(potential((tk(P98)>=1) & (tk(P178)>=1)))
(potential((tk(P106)>=1) & (tk(P178)>=1)))
(potential((tk(P97)>=1) & (tk(P178)>=1)))
(potential((tk(P182)>=1) & (tk(P99)>=1)))
(potential((tk(P183)>=1) & (tk(P105)>=1)))
(potential((tk(P179)>=1) & (tk(P100)>=1)))
(potential((tk(P183)>=1) & (tk(P98)>=1) & (tk(P99)>=1)))
(potential((tk(P184)>=1) & (tk(P99)>=1)))
(potential((tk(P185)>=1) & (tk(P105)>=1)))
(potential((tk(P180)>=1) & (tk(P100)>=1)))
(potential((tk(P185)>=1) & (tk(P106)>=1) & (tk(P99)>=1)))
(potential((tk(P186)>=1) & (tk(P102)>=1)))
(potential((tk(P187)>=1) & (tk(P105)>=1)))
(potential((tk(P181)>=1) & (tk(P100)>=1)))
(potential((tk(P187)>=1) & (tk(P97)>=1) & (tk(P102)>=1)))
(potential((tk(P170)>=1) & (tk(P189)>=1)))
(potential((tk(P191)>=1) & (tk(P165)>=1)))
(potential((tk(P192)>=1) & (tk(P188)>=1)))
(potential((tk(P166)>=1) & (tk(P176)>=1)))
(potential((tk(P192)>=1) & (tk(P164)>=1) & (tk(P165)>=1)))
(potential((tk(P193)>=1) & (tk(P168)>=1)))
(potential((tk(P194)>=1) & (tk(P164)>=1)))
(potential((tk(P190)>=1) & (tk(P166)>=1)))
(potential((tk(P194)>=1) & (tk(P188)>=1) & (tk(P168)>=1)))
(potential((tk(P195)>=1) & (tk(P1)>=1)))
(potential((tk(P196)>=1) & (tk(P3)>=1)))
(potential((tk(P209)>=1)))
(potential((tk(P222)>=1)))
(potential((tk(P198)>=1) & (tk(P210)>=1)))
(potential((tk(P213)>=1) & (tk(P201)>=1)))
(potential((tk(P214)>=1) & (tk(P199)>=1)))
(potential((tk(P202)>=1) & (tk(P203)>=1)))
(potential((tk(P214)>=1) & (tk(P201)>=1) & (tk(P200)>=1)))
(potential((tk(P215)>=1) & (tk(P207)>=1)))
(potential((tk(P216)>=1) & (tk(P205)>=1)))
(potential((tk(P208)>=1) & (tk(P204)>=1)))
(potential((tk(P216)>=1) & (tk(P207)>=1) & (tk(P206)>=1)))
(potential((tk(P217)>=1) & (tk(P212)>=1)))
(potential((tk(P218)>=1) & (tk(P200)>=1)))
(potential((tk(P202)>=1) & (tk(P211)>=1)))
(potential((tk(P218)>=1) & (tk(P212)>=1) & (tk(P199)>=1)))
(potential((tk(P197)>=1) & (tk(P221)>=1)))
(potential((tk(P226)>=1) & (tk(P212)>=1)))
(potential((tk(P227)>=1) & (tk(P219)>=1)))
(potential((tk(P202)>=1) & (tk(P220)>=1)))
(potential((tk(P227)>=1) & (tk(P212)>=1) & (tk(P199)>=1)))
(potential((tk(P228)>=1) & (tk(P223)>=1)))
(potential((tk(P229)>=1) & (tk(P206)>=1)))
(potential((tk(P208)>=1) & (tk(P224)>=1)))
(potential((tk(P229)>=1) & (tk(P223)>=1) & (tk(P205)>=1)))
(potential((tk(P230)>=1) & (tk(P201)>=1)))
(potential((tk(P231)>=1) & (tk(P199)>=1)))
(potential((tk(P202)>=1) & (tk(P225)>=1)))
(potential((tk(P231)>=1) & (tk(P201)>=1) & (tk(P219)>=1)))
FORMULA Liveness TRUE TECHNIQUES IMPLICIT_RELATION DECISION_DIAGRAMS SATURATION

BK_STOP 1678920534591

--------------------
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 Liveness -timeout 180 -rebuildPNML

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="ParamProductionCell-PT-2"
export BK_EXAMINATION="Liveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is ParamProductionCell-PT-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r281-smll-167863550900239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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