Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700081.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is IBM5964-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 171K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-00
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-01
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-02
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-03
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-04
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-05
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-06
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-07
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-08
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-09
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-10
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-11
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-12
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-13
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-14
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779723014421

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 15:30:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:30:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:30:17] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2026-05-25 15:30:17] [INFO ] Transformed 263 places.
[2026-05-25 15:30:17] [INFO ] Transformed 139 transitions.
[2026-05-25 15:30:17] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Support contains 113 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 88 places
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 171 transition count 139
Applied a total of 92 rules in 57 ms. Remains 171 /263 variables (removed 92) and now considering 139/139 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1232241843240039358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13972208688114593028.kers'
[2026-05-25 15:30:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1232241843240039358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13972208688114593028.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 139 rows 142 cols 303 entries
Finished phase 1 with 127 SingleSign rule and 6 generalized
[2026-05-25 15:30:17] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13972208688114593028.kers
Total runtime 2 ms.
[2026-05-25 15:30:17] [INFO ] Implicit Places using invariants in 480 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 550 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/263 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 138
Applied a total of 2 rules in 13 ms. Remains 169 /170 variables (removed 1) and now considering 138/139 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4481049193870000321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9180656483137327188.kers'
[2026-05-25 15:30:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4481049193870000321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9180656483137327188.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 138 rows 140 cols 299 entries
Finished phase 1 with 127 SingleSign rule and 5 generalized
[2026-05-25 15:30:17] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9180656483137327188.kers
Total runtime 1 ms.
[2026-05-25 15:30:18] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-25 15:30:18] [INFO ] Invariant cache hit.
[2026-05-25 15:30:18] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 169/263 places, 138/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1035 ms. Remains : 169/263 places, 138/139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 138/138 transitions.
Applied a total of 0 rules in 20 ms. Remains 169 /169 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2026-05-25 15:30:18] [INFO ] Invariant cache hit.
[2026-05-25 15:30:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 15:30:18] [INFO ] Invariant cache hit.
[2026-05-25 15:30:18] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2026-05-25 15:30:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/169 variables, 6/37 constraints. Problems are: Problem set: 103 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/37 constraints. Problems are: Problem set: 103 solved, 34 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 4 (OVERLAPS) 138/307 variables, 169/206 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/206 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/206 constraints. Problems are: Problem set: 114 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 206 constraints, problems are : Problem set: 114 solved, 23 unsolved in 3759 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 114 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 98/123 variables, 3/5 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 34/157 variables, 28/33 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/33 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 2/159 variables, 2/35 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/37 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/37 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 130/289 variables, 159/196 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 23/219 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/219 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 4/293 variables, 2/221 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/221 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 6/299 variables, 4/225 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 2/227 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 0/227 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 4/303 variables, 2/229 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/229 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 4/307 variables, 2/231 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/231 constraints. Problems are: Problem set: 114 solved, 23 unsolved
At refinement iteration 21 (OVERLAPS) 0/307 variables, 0/231 constraints. Problems are: Problem set: 114 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 231 constraints, problems are : Problem set: 114 solved, 23 unsolved in 6740 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 23/137 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10565ms problems are : Problem set: 114 solved, 23 unsolved
Search for dead transitions found 114 dead transitions in 10752ms
Found 114 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 114 transitions
Dead transitions reduction (with SMT) removed 114 transitions
Starting structural reductions in LTL mode, iteration 1 : 169/169 places, 24/138 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 129 transition count 24
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 40 rules in 2 ms. Remains 129 /169 variables (removed 40) and now considering 24/24 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1752769243175682977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4807470274546544932.kers'
[2026-05-25 15:30:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1752769243175682977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4807470274546544932.kers]
Culling trivial invariants: removing 100 columns.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 103 columns in 0 ms.
// Phase 1: matrix 24 rows 26 cols 56 entries
Finished phase 1 with 23 SingleSign rule and 1 generalized
[2026-05-25 15:30:29] [INFO ] Computed 105 invariants in 0 ms
Computed 105 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4807470274546544932.kers
Total runtime 1 ms.
[2026-05-25 15:30:29] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 15:30:29] [INFO ] Invariant cache hit.
[2026-05-25 15:30:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/169 places, 24/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11340 ms. Remains : 129/169 places, 24/138 transitions.
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Support contains 8 out of 29 places after structural reductions.
FORMULA IBM5964-PT-none-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:30:30] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2026-05-25 15:30:30] [INFO ] Flatten gal took : 34 ms
[2026-05-25 15:30:30] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
FORMULA IBM5964-PT-none-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:30:30] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:30:30] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 2 out of 29 places (down from 8) after GAL structural reductions.
FORMULA IBM5964-PT-none-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 184 steps (1 resets) in 13 ms. (13 steps per ms) remains 0/2 properties
[2026-05-25 15:30:30] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:30:30] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:30:30] [INFO ] Input system was already deterministic with 24 transitions.
Computed a total of 29 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 24/24 transitions.
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 22
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 22 transition count 20
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 22 transition count 20
Applied a total of 11 rules in 3 ms. Remains 22 /29 variables (removed 7) and now considering 20/24 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2724009862852856454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2841603382760466140.kers'
[2026-05-25 15:30:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2724009862852856454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2841603382760466140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 22 cols 47 entries
Finished phase 1 with 19 SingleSign rule and 1 generalized
[2026-05-25 15:30:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2841603382760466140.kers
Total runtime 0 ms.
[2026-05-25 15:30:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 15:30:30] [INFO ] Invariant cache hit.
[2026-05-25 15:30:30] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 19 sub problems to find dead transitions.
[2026-05-25 15:30:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/42 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 24 constraints, problems are : Problem set: 0 solved, 19 unsolved in 399 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 43 constraints, problems are : Problem set: 0 solved, 19 unsolved in 481 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 889ms
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 20/24 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 22/29 places, 20/24 transitions.
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:30:31] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:30:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality7117342762747251820.gal : 2 ms
[2026-05-25 15:30:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality11627708691469782776.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7117342762747251820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11627708691469782776.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8674,0.026645,4176,2,258,5,1956,6,0,110,2154,0


Converting to forward existential form...Done !
original formula: EG((EX((EX(TRUE) * EF((merge_s00001292_input_s00000950>=1)))) + EG(AF((callToProcess_s00002538_input_s00000952<=0)))))
=> equivalent forward existential formula: [FwdG(Init,(EX((EX(TRUE) * E(TRUE U (merge_s00001292_input_s00000950>=1)))) + EG(!(EG(!((callToProcess_s00002538...191
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t7, t10, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,0.492653,19488,1,0,616,94917,74,374,637,120594,573
FORMULA IBM5964-PT-none-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 24/24 transitions.
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 22
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 22 transition count 20
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 22 transition count 20
Applied a total of 11 rules in 3 ms. Remains 22 /29 variables (removed 7) and now considering 20/24 (removed 4) transitions.
[2026-05-25 15:30:31] [INFO ] Invariant cache hit.
[2026-05-25 15:30:31] [INFO ] Implicit Places using invariants in 41 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/29 places, 20/24 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 19
Applied a total of 2 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-707802275291285347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7595453252612799139.kers'
[2026-05-25 15:30:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-707802275291285347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7595453252612799139.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 19 rows 20 cols 43 entries
Finished phase 1 with 18 SingleSign rule and 1 generalized
[2026-05-25 15:30:31] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7595453252612799139.kers
Total runtime 0 ms.
[2026-05-25 15:30:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 15:30:31] [INFO ] Invariant cache hit.
[2026-05-25 15:30:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/29 places, 19/24 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 20/29 places, 19/24 transitions.
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:30:31] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:30:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:30:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality14108026810423193502.gal : 1 ms
[2026-05-25 15:30:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3856157833797898636.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14108026810423193502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3856157833797898636.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7035,0.013685,4256,2,240,5,1943,6,0,101,2153,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.013942,4256,1,0,6,1943,7,1,125,2153,1
FORMULA IBM5964-PT-none-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 24/24 transitions.
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 22
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 22 transition count 20
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 22 transition count 20
Applied a total of 11 rules in 3 ms. Remains 22 /29 variables (removed 7) and now considering 20/24 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16247092908532236105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10417011544519015443.kers'
[2026-05-25 15:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16247092908532236105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10417011544519015443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 22 cols 47 entries
Finished phase 1 with 19 SingleSign rule and 1 generalized
[2026-05-25 15:30:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10417011544519015443.kers
Total runtime 0 ms.
[2026-05-25 15:30:32] [INFO ] Implicit Places using invariants in 31 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/29 places, 20/24 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 19
Applied a total of 2 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3103861016846594891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-974657777821349490.kers'
[2026-05-25 15:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3103861016846594891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-974657777821349490.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 19 rows 20 cols 43 entries
Finished phase 1 with 18 SingleSign rule and 1 generalized
[2026-05-25 15:30:32] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-974657777821349490.kers
Total runtime 0 ms.
[2026-05-25 15:30:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 15:30:32] [INFO ] Invariant cache hit.
[2026-05-25 15:30:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/29 places, 19/24 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 20/29 places, 19/24 transitions.
[2026-05-25 15:30:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:30:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:30:32] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-25 15:30:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:30:32] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:30:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2484861175392163940.gal : 1 ms
[2026-05-25 15:30:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality6768103382412687778.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2484861175392163940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6768103382412687778.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7035,0.013365,4264,2,240,5,1943,6,0,101,2153,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.013619,4264,1,0,6,1943,7,1,125,2153,1
FORMULA IBM5964-PT-none-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-25 15:30:32] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:30:32] [INFO ] Flatten gal took : 2 ms
Total runtime 15433 ms.

BK_STOP 1779723032230

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="IBM5964-PT-none"
export BK_EXAMINATION="CTLCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is IBM5964-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM5964-PT-none.tgz
mv IBM5964-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;