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.r354-tall-178024402800142.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 LastZero-PT-N22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 8.0K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 173K May 27 10:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 661K May 27 10:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 20K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 33K May 27 10:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 91K May 27 10:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 4.1M Jun 10 11:58 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 LastZero-PT-N22-ReachabilityCardinality-2024-00
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-01
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-02
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-03
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-04
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-05
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-06
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-07
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-08
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-09
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-10
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-11
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-12
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-13
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-14
FORMULA_NAME LastZero-PT-N22-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781100033319

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-10 14:00:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 14:00:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 14:00:34] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2026-06-10 14:00:34] [INFO ] Transformed 1104 places.
[2026-06-10 14:00:35] [INFO ] Transformed 13135 transitions.
[2026-06-10 14:00:35] [INFO ] Parsed PT model containing 1104 places and 13135 transitions and 40373 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 530 places in 47 ms
Reduce places removed 530 places and 8581 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (596 resets) in 1686 ms. (23 steps per ms) remains 3/4 properties
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (53 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (53 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 368 ms. (108 steps per ms) remains 3/3 properties
[2026-06-10 14:00:36] [INFO ] Flow matrix only has 4323 transitions (discarded 231 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2119304938178385898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9243025968815455011.kers'
[2026-06-10 14:00:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2119304938178385898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9243025968815455011.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 4323 rows 572 cols 12187 entries
Finished phase 1 with 550 SingleSign rule and 0 generalized
[2026-06-10 14:00:36] [INFO ] Computed 23 invariants in 11 ms
Computed 23 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-9243025968815455011.kers
Total runtime 17 ms.
[2026-06-10 14:00:36] [INFO ] State equation strengthened by 506 read => feed constraints.
[2026-06-10 14:00:36] [INFO ] Flatten gal took : 546 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2026-06-10 14:00:36] [INFO ] Flatten gal took : 157 ms
At refinement iteration 1 (OVERLAPS) 146/163 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2026-06-10 14:00:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8283030203470949899.gal : 112 ms
[2026-06-10 14:00:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4642184508535935245.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8283030203470949899.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4642184508535935245.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 3 (OVERLAPS) 2262/2425 variables, 163/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2425 variables, 17/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2425 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 898/3323 variables, 167/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3323 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality4642184508535935245.prop.
At refinement iteration 8 (INCLUDED_ONLY) 0/3323 variables, 212/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3323 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 69/3392 variables, 37/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3392 variables, 32/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3392 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1164/4556 variables, 122/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 40
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :40 after 153
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :153 after 2112
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2112 after 59361
At refinement iteration 14 (INCLUDED_ONLY) 0/4556 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :59361 after 5.75793e+06
At refinement iteration 15 (OVERLAPS) 334/4890 variables, 200/962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4890 variables, 11/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4890 variables, 123/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4890 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Reachability property LastZero-PT-N22-ReachabilityCardinality-2024-14 is true.
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 19 (OVERLAPS) 6/4896 variables, 6/1102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4896 variables, 0/1102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/4896 variables, 0/1102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4896/4896 variables, and 1102 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4073 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 573/573 constraints, ReadFeed: 506/506 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/124 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2042/2166 variables, 124/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2166 variables, 6/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2166 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 858/3024 variables, 153/290 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3024 variables, 3/293 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3024 variables, 184/477 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3024 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 69/3093 variables, 37/514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3093 variables, 32/546 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3093 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 834/3927 variables, 122/668 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3927 variables, 0/668 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 826/4753 variables, 186/854 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4753 variables, 6/860 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4753 variables, 138/998 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4753 variables, 2/1000 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4753 variables, 0/1000 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 7/4760 variables, 1/1001 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4760 variables, 3/1004 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4760 variables, 0/1004 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SMT process timed out in 9307ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 4554/4554 transitions.
Graph (complete) has 4828 edges and 573 vertex of which 550 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.13 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 0 with 253 rules applied. Total rules applied 254 place count 550 transition count 4301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 254 place count 550 transition count 4300
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 256 place count 549 transition count 4300
Applied a total of 256 rules in 195 ms. Remains 549 /573 variables (removed 24) and now considering 4300/4554 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 549/573 places, 4300/4554 transitions.
RANDOM walk for 40000 steps (908 resets) in 981 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (60 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (60 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 159061 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 159061 steps, saw 32272 distinct states, run finished after 3008 ms. (steps per millisecond=52 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11455567764012504995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7974577493147804566.kers'
[2026-06-10 14:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11455567764012504995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7974577493147804566.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 4300 rows 548 cols 12141 entries
Finished phase 1 with 527 SingleSign rule and 0 generalized
[2026-06-10 14:00:49] [INFO ] Computed 22 invariants in 18 ms
Computed 22 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-7974577493147804566.kers
Total runtime 24 ms.
[2026-06-10 14:00:49] [INFO ] State equation strengthened by 484 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Reachability property LastZero-PT-N22-ReachabilityCardinality-2024-07 is true.
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 3 (OVERLAPS) 2042/2166 variables, 124/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2166 variables, 6/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2166 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 858/3024 variables, 153/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3024 variables, 3/293 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3024 variables, 184/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3024 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 69/3093 variables, 37/514 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3093 variables, 32/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3093 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 824/3917 variables, 112/658 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3917 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 801/4718 variables, 170/828 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4718 variables, 6/834 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4718 variables, 132/966 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4718 variables, 0/966 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 89/4807 variables, 48/1014 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4807 variables, 3/1017 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4807 variables, 6/1023 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4807 variables, 0/1023 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 9/4816 variables, 3/1026 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4816 variables, 0/1026 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 13/4829 variables, 7/1033 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4829 variables, 1/1034 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4829 variables, 3/1037 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4829 variables, 0/1037 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/4830 variables, 1/1038 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4830 variables, 0/1038 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/4834 variables, 2/1040 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4834 variables, 0/1040 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 9/4843 variables, 5/1045 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4843 variables, 1/1046 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4843 variables, 2/1048 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4843 variables, 0/1048 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/4844 variables, 1/1049 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4844 variables, 0/1049 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/4845 variables, 1/1050 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4845 variables, 0/1050 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 4/4849 variables, 3/1053 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4849 variables, 1/1054 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4849 variables, 1/1055 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/4849 variables, 0/1055 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/4849 variables, 0/1055 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4849/4849 variables, and 1055 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2386 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 549/549 constraints, ReadFeed: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 462/486 variables, 24/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 2/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 251/737 variables, 42/69 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 2/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/737 variables, 21/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 31/768 variables, 16/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 15/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/768 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 575/1343 variables, 73/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1343 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 873/2216 variables, 114/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2216 variables, 3/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2216 variables, 73/386 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2216 variables, 1/387 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2216 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 94/2310 variables, 50/437 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2310 variables, 3/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2310 variables, 3/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2310 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 489/2799 variables, 51/494 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2799 variables, 0/494 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 397/3196 variables, 88/582 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3196 variables, 3/585 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3196 variables, 51/636 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3196 variables, 0/636 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 51/3247 variables, 28/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3247 variables, 2/666 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3247 variables, 2/668 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3247 variables, 0/668 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 430/3677 variables, 50/718 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3677 variables, 0/718 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 431/4108 variables, 84/802 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4108 variables, 3/805 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4108 variables, 57/862 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/4108 variables, 0/862 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 55/4163 variables, 30/892 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/4163 variables, 2/894 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4163 variables, 3/897 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4163 variables, 0/897 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 305/4468 variables, 33/930 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4468 variables, 0/930 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 345/4813 variables, 54/984 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4813 variables, 2/986 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4813 variables, 48/1034 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4813 variables, 0/1034 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 36/4849 variables, 19/1053 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4849 variables, 1/1054 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4849 variables, 2/1056 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/4849 variables, 0/1056 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 0/4849 variables, 0/1056 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4849/4849 variables, and 1056 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3181 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 549/549 constraints, ReadFeed: 484/484 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5666ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=12 )
FORMULA LastZero-PT-N22-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 20178 ms.

BK_STOP 1781100054759

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="LastZero-PT-N22"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N22, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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