Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r147-tall-162089137900234.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-1, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089137900234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 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 1620947929094

Running Version 0
[2021-05-13 23:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-13 23:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:18:50] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-13 23:18:50] [INFO ] Transformed 231 places.
[2021-05-13 23:18:50] [INFO ] Transformed 202 transitions.
[2021-05-13 23:18:50] [INFO ] Found NUPN structural information;
[2021-05-13 23:18:50] [INFO ] Parsed PT model containing 231 places and 202 transitions in 107 ms.
Built sparse matrix representations for Structural reductions in 5 ms.18851KB memory used
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:18:51] [INFO ] Computed 59 place invariants in 17 ms
[2021-05-13 23:18:51] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:18:51] [INFO ] Computed 59 place invariants in 10 ms
[2021-05-13 23:18:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:18:51] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2021-05-13 23:18:51] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:18:51] [INFO ] Computed 59 place invariants in 4 ms
[2021-05-13 23:18:51] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2831 ms (no deadlock found). (steps per millisecond=441 )
Random directed walk for 1250000 steps, including 0 resets, run took 2466 ms (no deadlock found). (steps per millisecond=506 )
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:18:56] [INFO ] Computed 59 place invariants in 8 ms
[2021-05-13 23:18:57] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2021-05-13 23:18:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 123 ms returned sat
[2021-05-13 23:18:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:58] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2021-05-13 23:18:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2021-05-13 23:18:58] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-13 23:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:59] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2021-05-13 23:18:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:18:59] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2021-05-13 23:18:59] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2021-05-13 23:18:59] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2021-05-13 23:18:59] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:18:59] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:18:59] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:18:59] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2021-05-13 23:18:59] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:19:00] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:19:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 2301 ms
Starting structural reductions, 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 2 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
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
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 76 place count 193 transition count 164
Applied a total of 76 rules in 63 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:19:01] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-13 23:19:02] [INFO ] Implicit Places using invariants in 187 ms returned [1, 2, 9, 14, 15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 71, 77, 78, 80, 92, 93, 95, 97, 98, 119, 132, 133, 135, 137, 138, 160, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 195 ms to find 46 implicit places.
// Phase 1: matrix 164 rows 147 cols
[2021-05-13 23:19:02] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-13 23:19:02] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 147/231 places, 164/202 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 147 transition count 137
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 120 transition count 137
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 54 place count 120 transition count 130
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 113 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 111 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 111 transition count 128
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 152 place count 71 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 70 transition count 87
Applied a total of 154 rules in 22 ms. Remains 70 /147 variables (removed 77) and now considering 87/164 (removed 77) transitions.
// Phase 1: matrix 87 rows 70 cols
[2021-05-13 23:19:02] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-13 23:19:02] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 87 rows 70 cols
[2021-05-13 23:19:02] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-13 23:19:02] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-13 23:19:02] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 70/231 places, 87/202 transitions.
[2021-05-13 23:19:02] [INFO ] Initial state test concluded for 1 properties.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 86) seen :62
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 87 rows 70 cols
[2021-05-13 23:19:02] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-13 23:19:02] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-13 23:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:19:02] [INFO ] [Real]Absence check using state equation in 95 ms returned unsat :0 sat :24 real:0
[2021-05-13 23:19:02] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-13 23:19:02] [INFO ] [Real]Added 67 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:19:02] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:24
[2021-05-13 23:19:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2021-05-13 23:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:19:02] [INFO ] [Nat]Absence check using state equation in 86 ms returned unsat :0 sat :24
[2021-05-13 23:19:02] [INFO ] [Nat]Added 67 Read/Feed constraints in 4 ms returned sat
Attempting to minimize the solution found.
Minimization took 71 ms.
[2021-05-13 23:19:03] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :24
Incomplete Parikh walk after 1730 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=216 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1720 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=215 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1680 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=210 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1660 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=237 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1560 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=222 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1570 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=224 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1620 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=231 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1600 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=228 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1720 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=215 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1710 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=213 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1710 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=213 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1710 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=213 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1670 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=208 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1650 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=235 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1680 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=210 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1680 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=210 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1550 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=193 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1560 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=173 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1570 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=224 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1570 steps, including 24 resets, run finished after 6 ms. (steps per millisecond=261 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1610 steps, including 25 resets, run finished after 6 ms. (steps per millisecond=268 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1590 steps, including 24 resets, run finished after 6 ms. (steps per millisecond=265 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1610 steps, including 25 resets, run finished after 6 ms. (steps per millisecond=268 ) properties (out of 24) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1610 steps, including 25 resets, run finished after 6 ms. (steps per millisecond=268 ) properties (out of 24) seen :0 could not realise parikh vector
Support contains 17 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/70 places, 87/87 transitions.
[2021-05-13 23:19:03] [INFO ] Flatten gal took : 33 ms
[2021-05-13 23:19:03] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:19:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10759014475348624742.gal : 6 ms
[2021-05-13 23:19:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9086525461846804993.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10759014475348624742.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9086525461846804993.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10759014475348624742.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9086525461846804993.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9086525461846804993.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :13 after 20
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :21 after 28
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :28 after 50
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :503 after 505
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,505,0.040252,5000,2,543,13,2461,30,0,394,1723,0
Total reachable state count : 505

Verifying 24 reachability properties.
Reachability property qltransition_13 does not hold.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST

BK_STOP 1620947944532

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-1"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-1, 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 r147-tall-162089137900234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 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 ;