fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303546000614
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for TokenRing-PT-015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3766.512 3600000.00 13851229.00 1028.40 TTTTTTFTTF?F?FTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303546000614.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TokenRing-PT-015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546000614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 46M
-rw-r--r-- 1 mcc users 334K Apr 29 14:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 29 14:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 29 14:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 29 14:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 117K May 9 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 429K May 9 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 9 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M May 9 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 285K Apr 29 15:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 29 15:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6M Apr 29 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21M Apr 29 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K May 9 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K May 9 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.7M May 10 09:34 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 TokenRing-PT-015-ReachabilityCardinality-00
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-01
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-02
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-03
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-04
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-05
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-06
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-07
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-08
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-09
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-10
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-11
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-12
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-13
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-14
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654272792063

Running Version 202205111006
[2022-06-03 16:13:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-03 16:13:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:13:13] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2022-06-03 16:13:13] [INFO ] Transformed 256 places.
[2022-06-03 16:13:13] [INFO ] Transformed 3616 transitions.
[2022-06-03 16:13:13] [INFO ] Found NUPN structural information;
[2022-06-03 16:13:13] [INFO ] Completing missing partition info from NUPN : creating a component with [State_14_5, State_12_6, State_14_7, State_12_2, State_1_11, State_10_3, State_8_5, State_15_5, State_1_14, State_0_10, State_10_15, State_6_4, State_8_14, State_2_3, State_3_12, State_15_13, State_4_7, State_2_11, State_6_8, State_0_6, State_7_1, State_3_7, State_5_0, State_13_12, State_11_15, State_11_11, State_9_14, State_5_4, State_13_8, State_4_8, State_7_3, State_9_2, State_14_9, State_13_15, State_12_4, State_10_5, State_3_10, State_14_3, State_12_14, State_2_1, State_6_15, State_5_14, State_13_6, State_6_6, State_10_8, State_11_0, State_1_13, State_15_3, State_8_0, State_1_0, State_11_5, State_3_13, State_15_8, State_9_4, State_4_10, State_9_9, State_7_11, State_8_3, State_0_12, State_2_9, State_7_8, State_5_6, State_4_5, State_0_7]
[2022-06-03 16:13:13] [INFO ] Parsed PT model containing 256 places and 3616 transitions in 331 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 83 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-015-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 7) seen :3
FORMULA TokenRing-PT-015-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:13:15] [INFO ] Computed 16 place invariants in 36 ms
[2022-06-03 16:13:16] [INFO ] After 881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 16:13:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-06-03 16:13:17] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-03 16:13:17] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2022-06-03 16:13:18] [INFO ] After 787ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-06-03 16:13:18] [INFO ] After 1181ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 267 ms.
[2022-06-03 16:13:18] [INFO ] After 2324ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA TokenRing-PT-015-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TokenRing-PT-015-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1447 ms.
Support contains 50 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 177 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9682 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 539247 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
Interrupted Best-First random walk after 540430 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 0
Interrupted probabilistic random walk after 2781965 steps, run timeout after 57001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 2781965 steps, saw 434156 distinct states, run finished after 57003 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:14:37] [INFO ] Computed 16 place invariants in 10 ms
[2022-06-03 16:14:37] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:14:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-06-03 16:14:37] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:14:38] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2022-06-03 16:14:38] [INFO ] After 727ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:14:39] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 279 ms.
[2022-06-03 16:14:39] [INFO ] After 2138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1356 ms.
Support contains 50 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 91 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 87 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:14:40] [INFO ] Computed 16 place invariants in 9 ms
[2022-06-03 16:14:41] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:14:41] [INFO ] Computed 16 place invariants in 12 ms
[2022-06-03 16:14:41] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2022-06-03 16:14:47] [INFO ] Implicit Places using invariants and state equation in 5889 ms returned []
Implicit Place search using SMT with State Equation took 6192 ms to find 0 implicit places.
[2022-06-03 16:14:47] [INFO ] Redundant transitions in 296 ms returned []
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:14:47] [INFO ] Computed 16 place invariants in 16 ms
[2022-06-03 16:14:48] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9497 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 490291 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 402702 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=80 ) properties seen 0
Interrupted probabilistic random walk after 2720143 steps, run timeout after 57001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 2720143 steps, saw 425248 distinct states, run finished after 57001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:16:05] [INFO ] Computed 16 place invariants in 13 ms
[2022-06-03 16:16:05] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:16:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-06-03 16:16:05] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:16:05] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2022-06-03 16:16:06] [INFO ] After 743ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:16:06] [INFO ] After 1141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 269 ms.
[2022-06-03 16:16:07] [INFO ] After 2075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1169 ms.
Support contains 50 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 72 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 59 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:16:08] [INFO ] Computed 16 place invariants in 12 ms
[2022-06-03 16:16:08] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:16:08] [INFO ] Computed 16 place invariants in 10 ms
[2022-06-03 16:16:09] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2022-06-03 16:16:15] [INFO ] Implicit Places using invariants and state equation in 6383 ms returned []
Implicit Place search using SMT with State Equation took 6680 ms to find 0 implicit places.
[2022-06-03 16:16:15] [INFO ] Redundant transitions in 295 ms returned []
// Phase 1: matrix 3616 rows 256 cols
[2022-06-03 16:16:15] [INFO ] Computed 16 place invariants in 15 ms
[2022-06-03 16:16:16] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Graph (trivial) has 2332 edges and 256 vertex of which 193 / 256 are part of one of the 15 SCC in 6 ms
Free SCC test removed 178 places
Drop transitions removed 2322 transitions
Ensure Unique test removed 1052 transitions
Reduce isomorphic transitions removed 3374 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 78 transition count 236
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 72 transition count 233
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 69 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 69 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 68 transition count 232
Drop transitions removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 3 with 147 rules applied. Total rules applied 168 place count 68 transition count 85
Applied a total of 168 rules in 29 ms. Remains 68 /256 variables (removed 188) and now considering 85/3616 (removed 3531) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 85 rows 68 cols
[2022-06-03 16:16:16] [INFO ] Computed 16 place invariants in 1 ms
[2022-06-03 16:16:16] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:16:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-06-03 16:16:16] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:16:16] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-03 16:16:16] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:16:17] [INFO ] Flatten gal took : 32 ms
[2022-06-03 16:16:17] [INFO ] Flatten gal took : 10 ms
[2022-06-03 16:16:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10464442773574790619.gal : 5 ms
[2022-06-03 16:16:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18432577735526207894.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10464442773574790619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18432577735526207894.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality18432577735526207894.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 18144
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18144 after 3.81024e+07
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,4.62944e+09,8.35985,4216,2,136,10,1559,8,0,445,458,0
Total reachable state count : 4629441600

Verifying 2 reachability properties.
Invariant property TokenRing-PT-015-ReachabilityCardinality-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
TokenRing-PT-015-ReachabilityCardinality-10,1.93914e+07,8.36099,4216,2,176,10,1559,8,0,454,458,0
Invariant property TokenRing-PT-015-ReachabilityCardinality-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
TokenRing-PT-015-ReachabilityCardinality-12,1,8.36538,4456,2,69,10,1559,8,0,503,458,0
[2022-06-03 16:16:25] [INFO ] Flatten gal took : 210 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6503890772940417945
[2022-06-03 16:16:25] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2022-06-03 16:16:25] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6503890772940417945
Running compilation step : cd /tmp/ltsmin6503890772940417945;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 16:16:26] [INFO ] Applying decomposition
[2022-06-03 16:16:26] [INFO ] Flatten gal took : 142 ms
[2022-06-03 16:16:26] [INFO ] Flatten gal took : 336 ms
Compilation finished in 8681 ms.
Running link step : cd /tmp/ltsmin6503890772940417945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6503890772940417945;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'TokenRingPT015ReachabilityCardinality10==true'
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6503890772940417945;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'TokenRingPT015ReachabilityCardinality10==true'
Running LTSmin : cd /tmp/ltsmin6503890772940417945;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'TokenRingPT015ReachabilityCardinality12==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="TokenRing-PT-015"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is TokenRing-PT-015, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303546000614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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