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-177961107700082.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700082
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-01
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-02
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-03
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-04
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-05
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-06
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-07
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-08
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-09
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-10
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-11
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-12
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-13
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-14
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779723043279

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
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
CTLFireability PT
Running Version 202604301425
[2026-05-25 15:30:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:30:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:30:46] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2026-05-25 15:30:46] [INFO ] Transformed 263 places.
[2026-05-25 15:30:46] [INFO ] Transformed 139 transitions.
[2026-05-25 15:30:46] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 142 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 53 places
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 201 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 199 transition count 137
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 199 transition count 137
Applied a total of 66 rules in 79 ms. Remains 199 /263 variables (removed 64) and now considering 137/139 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14387481268431008773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4782759646035182931.kers'
[2026-05-25 15:30:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14387481268431008773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4782759646035182931.kers]
Culling duplicate invariants (modulo rational): removing 64 columns.
Culled 64 columns in 0 ms.
// Phase 1: matrix 137 rows 135 cols 294 entries
Finished phase 1 with 125 SingleSign rule and 5 generalized
[2026-05-25 15:30:46] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4782759646035182931.kers
Total runtime 6 ms.
[2026-05-25 15:30:46] [INFO ] Implicit Places using invariants in 414 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 481 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/263 places, 137/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 136
Applied a total of 2 rules in 11 ms. Remains 197 /198 variables (removed 1) and now considering 136/137 (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-2154395546309245776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5041532625635041598.kers'
[2026-05-25 15:30:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2154395546309245776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5041532625635041598.kers]
Culling duplicate invariants (modulo rational): removing 64 columns.
Culled 64 columns in 0 ms.
// Phase 1: matrix 136 rows 133 cols 290 entries
Finished phase 1 with 125 SingleSign rule and 4 generalized
[2026-05-25 15:30:46] [INFO ] Computed 68 invariants in 0 ms
Computed 68 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5041532625635041598.kers
Total runtime 1 ms.
[2026-05-25 15:30:46] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 15:30:46] [INFO ] Invariant cache hit.
[2026-05-25 15:30:47] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 197/263 places, 136/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1005 ms. Remains : 197/263 places, 136/139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 136/136 transitions.
Applied a total of 0 rules in 9 ms. Remains 197 /197 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2026-05-25 15:30:47] [INFO ] Invariant cache hit.
[2026-05-25 15:30:47] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 15:30:47] [INFO ] Invariant cache hit.
[2026-05-25 15:30:47] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-25 15:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 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 TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 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 TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 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 TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 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 TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 4 (OVERLAPS) 136/333 variables, 197/265 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/265 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/333 variables, 0/265 constraints. Problems are: Problem set: 113 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 265 constraints, problems are : Problem set: 113 solved, 22 unsolved in 7714 ms.
Refiners :[Generalized P Invariants (flows): 68/68 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 113 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 10/10 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 2/12 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 23/56 variables, 33/45 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 13/58 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/58 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 7/63 variables, 5/63 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 2/65 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 9/74 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/74 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 9/72 variables, 6/80 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 3/83 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 0/83 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 11/83 variables, 7/90 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/83 variables, 3/93 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/83 variables, 0/93 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 8/91 variables, 1/94 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/91 variables, 0/94 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 4/95 variables, 4/98 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/95 variables, 0/98 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 8/103 variables, 13/111 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/103 variables, 0/111 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 23 (OVERLAPS) 5/108 variables, 4/115 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/108 variables, 3/118 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/108 variables, 0/118 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 26 (OVERLAPS) 3/111 variables, 1/119 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/111 variables, 0/119 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 28 (OVERLAPS) 5/116 variables, 2/121 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/116 variables, 0/121 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 30 (OVERLAPS) 9/125 variables, 3/124 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/125 variables, 0/124 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 32 (OVERLAPS) 22/147 variables, 16/140 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/147 variables, 10/150 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/147 variables, 0/150 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 35 (OVERLAPS) 15/162 variables, 6/156 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/162 variables, 0/156 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 37 (OVERLAPS) 23/185 variables, 16/172 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/185 variables, 8/180 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/185 variables, 0/180 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 40 (OVERLAPS) 10/195 variables, 5/185 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/195 variables, 0/185 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 42 (OVERLAPS) 18/213 variables, 13/198 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/213 variables, 8/206 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/213 variables, 0/206 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 45 (OVERLAPS) 12/225 variables, 6/212 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/225 variables, 0/212 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 47 (OVERLAPS) 4/229 variables, 1/213 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/229 variables, 0/213 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 49 (OVERLAPS) 14/243 variables, 11/224 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/243 variables, 3/227 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/243 variables, 0/227 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 52 (OVERLAPS) 14/257 variables, 5/232 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/257 variables, 0/232 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 54 (OVERLAPS) 21/278 variables, 12/244 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/278 variables, 3/247 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/278 variables, 0/247 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 57 (OVERLAPS) 20/298 variables, 10/257 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/298 variables, 0/257 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 59 (OVERLAPS) 21/319 variables, 15/272 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/319 variables, 7/279 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/319 variables, 0/279 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 62 (OVERLAPS) 6/325 variables, 4/283 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/325 variables, 0/283 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 64 (OVERLAPS) 5/330 variables, 2/285 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/330 variables, 0/285 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 66 (OVERLAPS) 3/333 variables, 2/287 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/333 variables, 0/287 constraints. Problems are: Problem set: 113 solved, 22 unsolved
At refinement iteration 68 (OVERLAPS) 0/333 variables, 0/287 constraints. Problems are: Problem set: 113 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 287 constraints, problems are : Problem set: 113 solved, 22 unsolved in 11712 ms.
Refiners :[Generalized P Invariants (flows): 68/68 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 22/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19499ms problems are : Problem set: 113 solved, 22 unsolved
Search for dead transitions found 113 dead transitions in 19521ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/197 places, 23/136 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 151 transition count 23
Deduced a syphon composed of 113 places in 0 ms
Applied a total of 46 rules in 4 ms. Remains 151 /197 variables (removed 46) and now considering 23/23 (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-16254560010998389267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5727485566307659922.kers'
[2026-05-25 15:31:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16254560010998389267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5727485566307659922.kers]
Culling trivial invariants: removing 113 columns.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 126 columns in 0 ms.
// Phase 1: matrix 23 rows 25 cols 54 entries
Finished phase 1 with 22 SingleSign rule and 1 generalized
[2026-05-25 15:31:07] [INFO ] Computed 128 invariants in 0 ms
Computed 128 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5727485566307659922.kers
Total runtime 1 ms.
[2026-05-25 15:31:07] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 15:31:07] [INFO ] Invariant cache hit.
[2026-05-25 15:31:07] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/197 places, 23/136 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20325 ms. Remains : 151/197 places, 23/136 transitions.
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Support contains 17 out of 38 places after structural reductions.
FORMULA IBM5964-PT-none-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:31:07] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-25 15:31:07] [INFO ] Flatten gal took : 28 ms
[2026-05-25 15:31:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:31:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:31:07] [INFO ] Input system was already deterministic with 23 transitions.
Support contains 9 out of 38 places (down from 17) after GAL structural reductions.
RANDOM walk for 254 steps (2 resets) in 23 ms. (10 steps per ms) remains 0/5 properties
[2026-05-25 15:31:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:31:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:31:07] [INFO ] Input system was already deterministic with 23 transitions.
Computed a total of 38 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 23
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.
FORMULA IBM5964-PT-none-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 23/23 transitions.
Ensure Unique test removed 10 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 23 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 22 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 22 transition count 20
Applied a total of 19 rules in 3 ms. Remains 22 /38 variables (removed 16) and now considering 20/23 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17606934007463782153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-389086720234215526.kers'
[2026-05-25 15:31:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17606934007463782153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-389086720234215526.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:31:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-389086720234215526.kers
Total runtime 1 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 48 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 20/23 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-3973436764341348110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12415189131053342869.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3973436764341348110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12415189131053342869.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:31:08] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12415189131053342869.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 15:31:08] [INFO ] Invariant cache hit.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants and state equation in 33 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/38 places, 19/23 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 20/38 places, 19/23 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:31:08] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability13953641566569053266.gal : 2 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability7500169726489366669.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/CTLFireability13953641566569053266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7500169726489366669.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.024319,4096,2,208,5,1682,6,0,101,1761,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.0246,4124,1,0,6,1682,7,1,126,1761,1
FORMULA IBM5964-PT-none-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 23/23 transitions.
Ensure Unique test removed 8 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 25 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 24 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 24 transition count 20
Applied a total of 17 rules in 4 ms. Remains 24 /38 variables (removed 14) and now considering 20/23 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14182410460771076846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17454938497147334079.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14182410460771076846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17454938497147334079.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 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:31:08] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17454938497147334079.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 35 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/38 places, 20/23 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 22 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 19
Applied a total of 2 rules in 1 ms. Remains 22 /23 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-9124548221072255299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9842304945594956286.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9124548221072255299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9842304945594956286.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 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:31:08] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9842304945594956286.kers
Total runtime 1 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 15:31:08] [INFO ] Invariant cache hit.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants and state equation in 35 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 : 22/38 places, 19/23 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 22/38 places, 19/23 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability362018279610621299.gal : 1 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3411562010227291243.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/CTLFireability362018279610621299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3411562010227291243.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 -...282
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.012498,4192,2,214,5,1702,6,0,109,1772,0


Converting to forward existential form...Done !
original formula: A((EX((callToTask_s00005897_inputCriterion_s00000937_used>=1)) + ((callToTask_s00005897_inputCriterion_s00000937_used>=1) * EF(!((((callT...397
=> equivalent forward existential formula: [((Init * !(EG(!(((callToProcess_s00005925_inputCriterion_s00000937_used<1) * E(TRUE U (decision_s00000989_activ...696
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
(forward)formula 0,1,0.279692,12784,1,0,341,54895,68,206,631,66472,322
FORMULA IBM5964-PT-none-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 23/23 transitions.
Ensure Unique test removed 10 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 23 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 22 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 22 transition count 20
Applied a total of 19 rules in 1 ms. Remains 22 /38 variables (removed 16) and now considering 20/23 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2281711668454030326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15655627796177136507.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2281711668454030326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15655627796177136507.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:31:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15655627796177136507.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 41 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 20/23 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 1 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-2382995441036012804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15272974974166009893.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2382995441036012804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15272974974166009893.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:31:08] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15272974974166009893.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 15:31:08] [INFO ] Invariant cache hit.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/38 places, 19/23 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 20/38 places, 19/23 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9669900314464688628.gal : 1 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5173512957533077883.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/CTLFireability9669900314464688628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5173512957533077883.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.012204,4192,2,208,5,1682,6,0,101,1761,0


Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,0.012558,4192,1,0,7,1682,7,1,134,1761,2
FORMULA IBM5964-PT-none-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 23/23 transitions.
Ensure Unique test removed 10 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 23 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 22 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 22 transition count 20
Applied a total of 19 rules in 2 ms. Remains 22 /38 variables (removed 16) and now considering 20/23 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3791885639062579139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16484115304294664058.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3791885639062579139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16484115304294664058.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:31:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16484115304294664058.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 34 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 20/23 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 1 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-3172246850466538474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7749845117785308601.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3172246850466538474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7749845117785308601.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:31:08] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7749845117785308601.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 15:31:08] [INFO ] Invariant cache hit.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/38 places, 19/23 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 20/38 places, 19/23 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15839583537895922147.gal : 1 ms
[2026-05-25 15:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10381486399299386199.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/CTLFireability15839583537895922147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10381486399299386199.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 -...285
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.012338,4184,2,208,5,1682,6,0,101,1761,0


Converting to forward existential form...Done !
original formula: AG(AX((EX(TRUE) * (decision_s00000989_activated<1))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EX(TRUE)))] = FALSE * [(EY(FwdU(Init,TRUE)) * !((decision_s00000989_activated<1)))] =...162
(forward)formula 0,0,0.016628,4452,1,0,9,1736,9,2,196,1761,2
FORMULA IBM5964-PT-none-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 23/23 transitions.
Ensure Unique test removed 10 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 23 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 22 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 22 transition count 20
Applied a total of 19 rules in 1 ms. Remains 22 /38 variables (removed 16) and now considering 20/23 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16190025821627136633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3155814533668365919.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16190025821627136633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3155814533668365919.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:31:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3155814533668365919.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 28 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 20/23 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 1 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-18202059735709520992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7088763953629613586.kers'
[2026-05-25 15:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18202059735709520992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7088763953629613586.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:31:08] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7088763953629613586.kers
Total runtime 0 ms.
[2026-05-25 15:31:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 15:31:08] [INFO ] Invariant cache hit.
[2026-05-25 15:31:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/38 places, 19/23 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 20/38 places, 19/23 transitions.
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:31:09] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:31:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3539411679225921624.gal : 1 ms
[2026-05-25 15:31:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1988016420793293749.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/CTLFireability3539411679225921624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1988016420793293749.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.020083,4184,2,208,5,1682,6,0,101,1761,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.020509,4184,1,0,6,1682,7,1,126,1761,1
FORMULA IBM5964-PT-none-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 23/23 transitions.
Graph (complete) has 54 edges and 38 vertex of which 6 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 5 transition count 3
Applied a total of 3 rules in 11 ms. Remains 5 /38 variables (removed 33) and now considering 3/23 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12299587295940276438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5455582520159115783.kers'
[2026-05-25 15:31:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12299587295940276438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5455582520159115783.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 3 rows 4 cols 7 entries
Finished phase 1 with 2 SingleSign rule and 1 generalized
[2026-05-25 15:31:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5455582520159115783.kers
Total runtime 0 ms.
[2026-05-25 15:31:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 15:31:09] [INFO ] Invariant cache hit.
[2026-05-25 15:31:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2026-05-25 15:31:09] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:31:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/38 places, 3/23 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 5/38 places, 3/23 transitions.
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:31:09] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:31:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8158982446510231061.gal : 1 ms
[2026-05-25 15:31:09] [INFO ] Time to serialize properties into /tmp/CTLFireability703273260261423852.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/CTLFireability8158982446510231061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability703273260261423852.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 -...282
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,4,0.002366,3748,2,12,5,35,6,0,25,20,0


Converting to forward existential form...Done !
original formula: AF((((merge_s00001290_input_s00001009>=1)&&(merge_s00001290_input_s00000950>=1))&&(process_s00000383__s00005964_input_s00001431>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((merge_s00001290_input_s00001009>=1)&&(merge_s00001290_input_s00000950>=1))&&(process_s00000383__...196
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.003693,4036,1,0,11,72,19,4,114,57,10
FORMULA IBM5964-PT-none-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:31:09] [INFO ] Flatten gal took : 3 ms
Total runtime 23649 ms.

BK_STOP 1779723069384

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CTLFireability"
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 CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700082"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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