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.r130-smll-177955808900111.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 FamilyReunion-PT-L00020M0002C001P001G001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808900111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 61K Mar 6 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 418K Mar 6 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Mar 6 07:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 280K Mar 6 07:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Mar 15 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 15 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Mar 15 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 15 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Mar 6 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 349K Mar 6 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 124K Mar 6 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Mar 6 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Mar 15 10:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779742855072

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-25 21:00:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 21:00:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 21:00:57] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2026-05-25 21:00:57] [INFO ] Transformed 3271 places.
[2026-05-25 21:00:57] [INFO ] Transformed 2753 transitions.
[2026-05-25 21:00:57] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 94 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 11 places and 0 transitions.
RANDOM walk for 40000 steps (32 resets) in 3473 ms. (11 steps per ms) remains 3/16 properties
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 820 ms. (48 steps per ms) remains 3/3 properties
[2026-05-25 21:00:59] [INFO ] Flatten gal took : 657 ms
BEST_FIRST walk for 40003 steps (8 resets) in 690 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 682 ms. (58 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4646507945961314071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14306709656825059264.kers'
[2026-05-25 21:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4646507945961314071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14306709656825059264.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2753 rows 3260 cols 7900 entries
Finished phase 1 with 1605 SingleSign rule and 907 generalized
[2026-05-25 21:01:00] [INFO ] Computed 748 invariants in 68 ms
Computed 748 P flows in 74 ms.
Exported basis to /tmp/petrispot-output-14306709656825059264.kers
Total runtime 78 ms.
[2026-05-25 21:01:00] [INFO ] Flatten gal took : 547 ms
[2026-05-25 21:01:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13766289109124740868.gal : 310 ms
Excessive predecessor constraint size, skipping predecessor.
[2026-05-25 21:01:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16040241498775635051.prop : 8 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/ReachabilityCardinality13766289109124740868.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16040241498775635051.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 ...330
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality16040241498775635051.prop.
At refinement iteration 1 (OVERLAPS) 1282/1425 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1425 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1425 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/1427 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1427 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1757/3184 variables, 642/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3184 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 74/3258 variables, 41/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3258 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3260 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3260 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6013/6013 variables, and 4008 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5127 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 687/687 constraints, State Equation: 3260/3260 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1282/1425 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1425 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1425 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/1427 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1427 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1757/3184 variables, 642/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 12152ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 143 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 3039 are kept as prefixes of interest. Removing 221 places using SCC suffix rule.11 ms
Discarding 221 places :
Also discarding 156 output transitions
Drop transitions (Output transitions of discarded places.) removed 156 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 362 places :
Implicit places reduction removed 362 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 918 transitions
Trivial Post-agglo rules discarded 918 transitions
Performed 918 trivial Post agglomeration. Transition count delta: 918
Iterating post reduction 0 with 1291 rules applied. Total rules applied 1292 place count 2677 transition count 1668
Reduce places removed 918 places and 0 transitions.
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Iterating post reduction 1 with 1010 rules applied. Total rules applied 2302 place count 1759 transition count 1576
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 2394 place count 1667 transition count 1576
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 236 Pre rules applied. Total rules applied 2394 place count 1667 transition count 1340
Deduced a syphon composed of 236 places in 3 ms
Ensure Unique test removed 95 places
Reduce places removed 331 places and 0 transitions.
Iterating global reduction 3 with 567 rules applied. Total rules applied 2961 place count 1336 transition count 1340
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 33 rules applied. Total rules applied 2994 place count 1331 transition count 1312
Reduce places removed 28 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 31 rules applied. Total rules applied 3025 place count 1303 transition count 1309
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3028 place count 1300 transition count 1309
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 3028 place count 1300 transition count 1306
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 3034 place count 1297 transition count 1306
Discarding 211 places :
Symmetric choice reduction at 6 with 211 rule applications. Total rules 3245 place count 1086 transition count 1084
Iterating global reduction 6 with 211 rules applied. Total rules applied 3456 place count 1086 transition count 1084
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 41 places :
Implicit places reduction removed 41 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 6 with 195 rules applied. Total rules applied 3651 place count 1045 transition count 930
Reduce places removed 134 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 7 with 139 rules applied. Total rules applied 3790 place count 911 transition count 925
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 3795 place count 906 transition count 925
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 38 Pre rules applied. Total rules applied 3795 place count 906 transition count 887
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 9 with 76 rules applied. Total rules applied 3871 place count 868 transition count 887
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3872 place count 867 transition count 886
Iterating global reduction 9 with 1 rules applied. Total rules applied 3873 place count 867 transition count 886
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3873 place count 867 transition count 885
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3875 place count 866 transition count 885
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 9 with 188 rules applied. Total rules applied 4063 place count 772 transition count 791
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4065 place count 771 transition count 791
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4066 place count 771 transition count 790
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 4071 place count 771 transition count 785
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 4076 place count 766 transition count 785
Free-agglomeration rule (complex) applied 71 times.
Iterating global reduction 10 with 71 rules applied. Total rules applied 4147 place count 766 transition count 714
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 10 with 71 rules applied. Total rules applied 4218 place count 695 transition count 714
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 11 with 14 rules applied. Total rules applied 4232 place count 695 transition count 714
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4234 place count 693 transition count 712
Applied a total of 4234 rules in 1114 ms. Remains 693 /3260 variables (removed 2567) and now considering 712/2753 (removed 2041) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1124 ms. Remains : 693/3260 places, 712/2753 transitions.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 20
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :20 after 125
RANDOM walk for 40000 steps (136 resets) in 1017 ms. (39 steps per ms) remains 1/3 properties
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :125 after 4950
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6660974222685698078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15863587646020817659.kers'
[2026-05-25 21:01:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6660974222685698078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15863587646020817659.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 712 rows 693 cols 2385 entries
Finished phase 1 with 344 SingleSign rule and 172 generalized
[2026-05-25 21:01:13] [INFO ] Computed 177 invariants in 10 ms
Computed 177 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-15863587646020817659.kers
Total runtime 12 ms.
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4950 after 11250
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 442/481 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 206/687 variables, 152/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :11250 after 95500
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :95500 after 117900
At refinement iteration 5 (OVERLAPS) 706/1393 variables, 687/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1393 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/1403 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1403 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1405 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1405 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1405 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1405/1405 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Generalized P Invariants (flows): 177/177 constraints, State Equation: 693/693 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 442/481 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 206/687 variables, 152/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 706/1393 variables, 687/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1393 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/1403 variables, 5/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1403 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1405 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1405 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1405 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1405/1405 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 855 ms.
Refiners :[Generalized P Invariants (flows): 177/177 constraints, State Equation: 693/693 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1604ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 13 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 18288 ms.

BK_STOP 1779742875444

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="ReachabilityFireability"
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 FamilyReunion-PT-L00020M0002C001P001G001, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955808900111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-L00020M0002C001P001G001 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;