fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499300401
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FileSystem-PT-N02I05B05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
368.792 38947.00 56962.00 512.60 FFTTFFTTTTFFTFFT normal

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.r338-smll-178021499300401.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 FileSystem-PT-N02I05B05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 11K May 27 10:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 27 10:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 27 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 27 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 27 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 27 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 27 10:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.1K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 27 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K May 27 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.6K May 27 10:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 62K Jun 10 11:57 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 FileSystem-PT-N02I05B05-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N02I05B05-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781100244172

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I05B05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 14:04:06] [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-06-10 14:04:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 14:04:07] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2026-06-10 14:04:07] [INFO ] Transformed 156 places.
[2026-06-10 14:04:07] [INFO ] Transformed 135 transitions.
[2026-06-10 14:04:07] [INFO ] Parsed PT model containing 156 places and 135 transitions and 475 arcs in 375 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Reduce places removed 5 places and 0 transitions.
Support contains 125 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 135/135 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 146 transition count 135
Applied a total of 5 rules in 34 ms. Remains 146 /151 variables (removed 5) and now considering 135/135 (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-6180224875855172860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4069389890861028270.kers'
[2026-06-10 14:04:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6180224875855172860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4069389890861028270.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 135 rows 141 cols 395 entries
Finished phase 1 with 122 SingleSign rule and 8 generalized
[2026-06-10 14:04:07] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4069389890861028270.kers
Total runtime 4 ms.
[2026-06-10 14:04:07] [INFO ] Implicit Places using invariants in 523 ms returned []
[2026-06-10 14:04:07] [INFO ] Invariant cache hit.
[2026-06-10 14:04:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-06-10 14:04:08] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-06-10 14:04:08] [INFO ] Invariant cache hit.
[2026-06-10 14:04:08] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 11/131 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 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 TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 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 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 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
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 19/34 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 13/144 variables, 3/37 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 5/42 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 2/44 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/44 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 135/279 variables, 144/188 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 25/213 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/213 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 13 (OVERLAPS) 2/281 variables, 2/215 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/215 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 15 (OVERLAPS) 0/281 variables, 0/215 constraints. Problems are: Problem set: 90 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 215 constraints, problems are : Problem set: 90 solved, 40 unsolved in 16037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 146/146 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 81/131 variables, 13/13 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 23/36 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/36 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 13/144 variables, 3/39 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 5/44 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/44 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 135/279 variables, 144/188 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 25/213 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 37/250 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/250 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 2/281 variables, 2/252 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 3/255 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/255 constraints. Problems are: Problem set: 90 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/255 constraints. Problems are: Problem set: 90 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 255 constraints, problems are : Problem set: 90 solved, 40 unsolved in 14883 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 146/146 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 40/130 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31068ms problems are : Problem set: 90 solved, 40 unsolved
Search for dead transitions found 90 dead transitions in 31092ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in LTL mode, iteration 1 : 146/151 places, 45/135 transitions.
Reduce places removed 16 places and 20 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 130 transition count 25
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 16 rules in 3 ms. Remains 130 /146 variables (removed 16) and now considering 25/45 (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-15919734819664644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7587502557435684361.kers'
[2026-06-10 14:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15919734819664644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7587502557435684361.kers]
Culling trivial invariants: removing 84 columns.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 89 columns in 0 ms.
// Phase 1: matrix 25 rows 41 cols 75 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-10 14:04:39] [INFO ] Computed 105 invariants in 0 ms
Computed 105 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7587502557435684361.kers
Total runtime 1 ms.
[2026-06-10 14:04:39] [INFO ] Implicit Places using invariants in 72 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/151 places, 25/135 transitions.
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32216 ms. Remains : 129/151 places, 25/135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 25/25 transitions.
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 25/25 (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-6619770726841647898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6114963295684629961.kers'
[2026-06-10 14:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6619770726841647898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6114963295684629961.kers]
Culling trivial invariants: removing 84 columns.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 88 columns in 0 ms.
// Phase 1: matrix 25 rows 41 cols 75 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-10 14:04:39] [INFO ] Computed 104 invariants in 0 ms
Computed 104 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6114963295684629961.kers
Total runtime 1 ms.
[2026-06-10 14:04:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-10 14:04:39] [INFO ] Invariant cache hit.
[2026-06-10 14:04:39] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2026-06-10 14:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 16/45 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 25/70 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/70 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/154 variables, and 65 constraints, problems are : Problem set: 0 solved, 20 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 20/104 constraints, State Equation: 45/129 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 16/45 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 25/70 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/70 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/154 variables, and 85 constraints, problems are : Problem set: 0 solved, 20 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 20/104 constraints, State Equation: 45/129 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1311ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1313ms
Finished structural reductions in LTL mode , in 1 iterations and 1499 ms. Remains : 129/129 places, 25/25 transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Support contains 14 out of 45 places after structural reductions.
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:04:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-06-10 14:04:41] [INFO ] Flatten gal took : 38 ms
[2026-06-10 14:04:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:04:41] [INFO ] Flatten gal took : 13 ms
[2026-06-10 14:04:41] [INFO ] Input system was already deterministic with 25 transitions.
Support contains 8 out of 45 places (down from 14) after GAL structural reductions.
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1536 resets) in 1355 ms. (29 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (477 resets) in 579 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (496 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (486 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (495 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (493 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (495 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-287586608718029252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12013110196849168993.kers'
[2026-06-10 14:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-287586608718029252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12013110196849168993.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 25 rows 41 cols 75 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-10 14:04:42] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12013110196849168993.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 33/70 variables, and 9 constraints, problems are : Problem set: 6 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 9/20 constraints, State Equation: 0/45 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 5 ms
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 6 ms
[2026-06-10 14:04:42] [INFO ] Input system was already deterministic with 25 transitions.
Computed a total of 45 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 25
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 FileSystem-PT-N02I05B05-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 25/25 transitions.
Graph (complete) has 58 edges and 45 vertex of which 37 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 37 transition count 16
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 28 transition count 16
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 19 place count 28 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 33 place count 19 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 17 transition count 10
Applied a total of 36 rules in 21 ms. Remains 17 /45 variables (removed 28) and now considering 10/25 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17039241153128092475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16730837216606422038.kers'
[2026-06-10 14:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17039241153128092475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16730837216606422038.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 10 rows 16 cols 30 entries
Finished phase 1 with 7 SingleSign rule and 3 generalized
[2026-06-10 14:04:42] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16730837216606422038.kers
Total runtime 0 ms.
[2026-06-10 14:04:42] [INFO ] Implicit Places using invariants in 45 ms returned [5, 6, 7, 9]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 13/45 places, 10/25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 10 transition count 7
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 8 transition count 5
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 8 transition count 5
Applied a total of 10 rules in 5 ms. Remains 8 /13 variables (removed 5) and now considering 5/10 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9396353420904356310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5735797157100693734.kers'
[2026-06-10 14:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9396353420904356310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5735797157100693734.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 8 cols 13 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-06-10 14:04:42] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5735797157100693734.kers
Total runtime 0 ms.
[2026-06-10 14:04:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-06-10 14:04:42] [INFO ] Invariant cache hit.
[2026-06-10 14:04:42] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 8/45 places, 5/25 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 122 ms. Remains : 8/45 places, 5/25 transitions.
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 1 ms
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 2 ms
[2026-06-10 14:04:42] [INFO ] Input system was already deterministic with 5 transitions.
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 1 ms
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 1 ms
[2026-06-10 14:04:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality10972756592783571722.gal : 1 ms
[2026-06-10 14:04:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16147092092685590823.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/CTLCardinality10972756592783571722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16147092092685590823.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,36,0.01457,3692,2,29,5,121,6,0,31,88,0


Converting to forward existential form...Done !
original formula: AF(((busy_9_11<=0)&&(inode_3_10>0)))
=> equivalent forward existential formula: [FwdG(Init,!(((busy_9_11<=0)&&(inode_3_10>0))))] = FALSE
Hit Full ! (commute/partial/dont) 3/0/2
(forward)formula 0,0,0.017362,4004,1,0,14,444,19,3,172,438,14
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 25/25 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 36 transition count 25
Applied a total of 9 rules in 1 ms. Remains 36 /45 variables (removed 9) and now considering 25/25 (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-14163202911483123885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3343516293581900227.kers'
[2026-06-10 14:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14163202911483123885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3343516293581900227.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 25 rows 36 cols 70 entries
Finished phase 1 with 22 SingleSign rule and 3 generalized
[2026-06-10 14:04:42] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3343516293581900227.kers
Total runtime 0 ms.
[2026-06-10 14:04:42] [INFO ] Implicit Places using invariants in 60 ms returned [5, 6, 7, 8, 29]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 61 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/45 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 31/45 places, 25/25 transitions.
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 3 ms
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 4 ms
[2026-06-10 14:04:42] [INFO ] Input system was already deterministic with 25 transitions.
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 4 ms
[2026-06-10 14:04:42] [INFO ] Flatten gal took : 3 ms
[2026-06-10 14:04:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5578211824717626240.gal : 1 ms
[2026-06-10 14:04:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17385723214339690905.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/CTLCardinality5578211824717626240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17385723214339690905.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,1632,0.011992,4184,2,210,5,1596,6,0,144,1279,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) * !(A((inode_2_8<=0) U AX(FALSE))))
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((inode_2_8...195
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t23, t24, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,0,0.08838,7132,1,0,116,18365,72,69,771,20321,136
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 25/25 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 35 transition count 25
Applied a total of 10 rules in 2 ms. Remains 35 /45 variables (removed 10) and now considering 25/25 (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-1928450078186209633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14245267778856471375.kers'
[2026-06-10 14:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1928450078186209633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14245267778856471375.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 25 rows 35 cols 69 entries
Finished phase 1 with 21 SingleSign rule and 4 generalized
[2026-06-10 14:04:42] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14245267778856471375.kers
Total runtime 0 ms.
[2026-06-10 14:04:43] [INFO ] Implicit Places using invariants in 49 ms returned [5, 6, 7, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/45 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 31/45 places, 25/25 transitions.
[2026-06-10 14:04:43] [INFO ] Flatten gal took : 3 ms
[2026-06-10 14:04:43] [INFO ] Flatten gal took : 3 ms
[2026-06-10 14:04:43] [INFO ] Input system was already deterministic with 25 transitions.
[2026-06-10 14:04:43] [INFO ] Flatten gal took : 2 ms
[2026-06-10 14:04:43] [INFO ] Flatten gal took : 3 ms
[2026-06-10 14:04:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13599315810743920170.gal : 1 ms
[2026-06-10 14:04:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality6043750324601080352.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/CTLCardinality13599315810743920170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6043750324601080352.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,1632,0.011821,4208,2,177,5,1656,6,0,147,1455,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.012607,4208,1,0,7,1656,7,1,212,1455,2
FORMULA FileSystem-PT-N02I05B05-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-06-10 14:04:43] [INFO ] Flatten gal took : 3 ms
[2026-06-10 14:04:43] [INFO ] Flatten gal took : 3 ms
Total runtime 36415 ms.

BK_STOP 1781100283119

--------------------
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="FileSystem-PT-N02I05B05"
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 FileSystem-PT-N02I05B05, 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 r338-smll-178021499300401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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