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.r018-smll-177946788100374.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 BlocksWorld-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.8K Mar 5 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 5 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 5 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.2M 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 BlocksWorld-PT-11-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779657098100

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 21:11:40] [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-05-24 21:11:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 21:11:41] [INFO ] Load time of PNML (sax parser for PT used): 692 ms
[2026-05-24 21:11:41] [INFO ] Transformed 3421 places.
[2026-05-24 21:11:41] [INFO ] Transformed 6613 transitions.
[2026-05-24 21:11:41] [INFO ] Found NUPN structural information;
[2026-05-24 21:11:41] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56]
[2026-05-24 21:11:41] [INFO ] Parsed PT model containing 3421 places and 6613 transitions and 33052 arcs in 971 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
[2026-05-24 21:11:44] [INFO ] Flatten gal took : 1347 ms
[2026-05-24 21:11:44] [INFO ] Flatten gal took : 482 ms
[2026-05-24 21:11:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4725616353873660220.gal : 300 ms
[2026-05-24 21:11:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16111842598797806235.prop : 4 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/ReachabilityCardinality4725616353873660220.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16111842598797806235.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 ...329
RANDOM walk for 40000 steps (8 resets) in 11047 ms. (3 steps per ms) remains 10/16 properties
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 717 ms. (55 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 794 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1214 ms. (32 steps per ms) remains 9/10 properties
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 962 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 913 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 611 ms. (65 steps per ms) remains 8/9 properties
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality16111842598797806235.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 800 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1763 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 736 ms. (54 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5704141123490983811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15137912648652580562.kers'
[2026-05-24 21:11:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5704141123490983811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15137912648652580562.kers]
Normalized transition count is 6612 out of 6613 initially.
Culled 0 columns in 7 ms.
// Phase 1: matrix 6612 rows 3421 cols 32718 entries
Finished phase 1 with 3306 SingleSign rule and 0 generalized
[2026-05-24 21:11:48] [INFO ] Computed 115 invariants in 48 ms
Computed 115 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-15137912648652580562.kers
Total runtime 58 ms.
[2026-05-24 21:11:48] [INFO ] State equation strengthened by 97 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3219/3420 variables, 114/114 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3420 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/3421 variables, 1/115 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3421 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10033/10034 variables, and 3536 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5092 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3421/3421 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3238/3418 variables, 113/113 constraints. Problems are: Problem set: 5 solved, 3 unsolved
SMT process timed out in 11381ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 180 out of 3421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6613/6613 transitions.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 152
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3421 transition count 6612
Applied a total of 1 rules in 48873 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6613 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48896 ms. Remains : 3421/3421 places, 6612/6613 transitions.
RANDOM walk for 40000 steps (8 resets) in 5436 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 783 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 836 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1081 ms. (36 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 279503 steps, run timeout after 6001 ms. (steps per millisecond=46 ) properties seen :0 out of 3
Probabilistic random walk after 279503 steps, saw 240526 distinct states, run finished after 6011 ms. (steps per millisecond=46 ) 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-17926189541107127521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16888295661471050946.kers'
[2026-05-24 21:12:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17926189541107127521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16888295661471050946.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 6612 rows 3421 cols 32718 entries
Finished phase 1 with 3306 SingleSign rule and 0 generalized
[2026-05-24 21:12:56] [INFO ] Computed 115 invariants in 73 ms
Computed 115 P flows in 75 ms.
Exported basis to /tmp/petrispot-output-16888295661471050946.kers
Total runtime 82 ms.
[2026-05-24 21:12:56] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3238/3418 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3418 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/3421 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3421 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6612/10033 variables, 3421/3536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10033 variables, 96/3632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10033/10033 variables, and 3632 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9170 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3421/3421 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/0 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3238/3418 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3418 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3418 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3418 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/3421 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6612/10033 variables, 3421/3540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10033 variables, 96/3636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10033 variables, 0/3636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/10033 variables, 0/3636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10033/10033 variables, and 3636 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18336 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3421/3421 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27780ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1822 ms.
Support contains 180 out of 3421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6612/6612 transitions.
Applied a total of 0 rules in 36127 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36128 ms. Remains : 3421/3421 places, 6612/6612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6612/6612 transitions.
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :152 after 14753
Applied a total of 0 rules in 35978 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6612 (removed 0) transitions.
[2026-05-24 21:14:38] [INFO ] Invariant cache hit.
[2026-05-24 21:14:48] [INFO ] Implicit Places using invariants in 9537 ms returned []
[2026-05-24 21:14:48] [INFO ] Invariant cache hit.
[2026-05-24 21:14:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-24 21:15:12] [INFO ] Implicit Places using invariants and state equation in 24632 ms returned []
Implicit Place search using SMT with State Equation took 34190 ms to find 0 implicit places.
[2026-05-24 21:15:13] [INFO ] Redundant transitions in 957 ms returned []
Running 6603 sub problems to find dead transitions.
[2026-05-24 21:15:13] [INFO ] Invariant cache hit.
[2026-05-24 21:15:13] [INFO ] State equation strengthened by 96 read => feed constraints.
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2840 is UNSAT
Problem TDEAD2898 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3188 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3304 is UNSAT
Problem TDEAD3362 is UNSAT
Problem TDEAD3420 is UNSAT
Problem TDEAD3532 is UNSAT
Problem TDEAD3642 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3960 is UNSAT
Problem TDEAD4062 is UNSAT
Problem TDEAD4162 is UNSAT
Problem TDEAD4260 is UNSAT
Problem TDEAD4356 is UNSAT
Problem TDEAD4542 is UNSAT
Problem TDEAD4632 is UNSAT
Problem TDEAD4720 is UNSAT
Problem TDEAD4806 is UNSAT
Problem TDEAD4890 is UNSAT
Problem TDEAD4972 is UNSAT
Problem TDEAD5052 is UNSAT
Problem TDEAD5130 is UNSAT
Problem TDEAD5206 is UNSAT
Problem TDEAD5280 is UNSAT
Problem TDEAD5422 is UNSAT
Problem TDEAD5490 is UNSAT
Problem TDEAD5556 is UNSAT
Problem TDEAD5620 is UNSAT
Problem TDEAD5682 is UNSAT
Problem TDEAD5742 is UNSAT
Problem TDEAD5800 is UNSAT
Problem TDEAD5856 is UNSAT
Problem TDEAD5910 is UNSAT
Problem TDEAD5962 is UNSAT
Problem TDEAD6012 is UNSAT
Problem TDEAD6150 is UNSAT
Problem TDEAD6192 is UNSAT
Problem TDEAD6232 is UNSAT
Problem TDEAD6306 is UNSAT
Problem TDEAD6340 is UNSAT
Problem TDEAD6372 is UNSAT
Problem TDEAD6430 is UNSAT
Problem TDEAD6480 is UNSAT
Problem TDEAD6502 is UNSAT
Problem TDEAD6522 is UNSAT
Problem TDEAD6540 is UNSAT
Problem TDEAD6556 is UNSAT
Problem TDEAD6570 is UNSAT
Problem TDEAD6582 is UNSAT
Problem TDEAD6592 is UNSAT
Problem TDEAD6600 is UNSAT
Problem TDEAD6606 is UNSAT
Problem TDEAD6610 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3412 variables, 98/98 constraints. Problems are: Problem set: 98 solved, 6505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3412/10033 variables, and 98 constraints, problems are : Problem set: 98 solved, 6505 unsolved in 30211 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 6554/3306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 98 solved, 6505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 9/9 constraints. Problems are: Problem set: 98 solved, 6505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/10033 variables, and 9 constraints, problems are : Problem set: 98 solved, 6505 unsolved in 30171 ms.
Refiners :[Positive P Invariants (semi-flows): 9/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 3248/3306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77822ms problems are : Problem set: 98 solved, 6505 unsolved
Search for dead transitions found 98 dead transitions in 77874ms
Found 98 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 98 transitions
Dead transitions reduction (with SMT) removed 98 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 3421/3421 places, 6514/6612 transitions.
Graph (complete) has 16440 edges and 3421 vertex of which 3374 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.7 ms
Discarding 47 places :
Also discarding 0 output transitions
Deduced a syphon composed of 2 places in 5 ms
Applied a total of 1 rules in 38111 ms. Remains 3374 /3421 variables (removed 47) and now considering 6514/6514 (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-1121300808244547303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7258966681580870081.kers'
[2026-05-24 21:17:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1121300808244547303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7258966681580870081.kers]
Culling trivial invariants: removing 2 columns.
Culled 2 columns in 7 ms.
// Phase 1: matrix 6514 rows 3372 cols 32424 entries
Finished phase 1 with 3257 SingleSign rule and 0 generalized
[2026-05-24 21:17:09] [INFO ] Computed 117 invariants in 45 ms
Computed 117 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-7258966681580870081.kers
Total runtime 53 ms.
[2026-05-24 21:17:17] [INFO ] Implicit Places using invariants in 7598 ms returned []
[2026-05-24 21:17:17] [INFO ] Invariant cache hit.
[2026-05-24 21:17:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-24 21:17:35] [INFO ] Implicit Places using invariants and state equation in 18369 ms returned []
Implicit Place search using SMT with State Equation took 25971 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3374/3421 places, 6514/6612 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 213165 ms. Remains : 3374/3421 places, 6514/6612 transitions.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 5304 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 798 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 763 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 726 ms. (55 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 330283 steps, run timeout after 6001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 330283 steps, saw 287767 distinct states, run finished after 6001 ms. (steps per millisecond=55 ) 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-1518967809760148577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-669751717438973695.kers'
[2026-05-24 21:17:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1518967809760148577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-669751717438973695.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 6514 rows 3372 cols 32424 entries
Finished phase 1 with 3257 SingleSign rule and 0 generalized
[2026-05-24 21:17:43] [INFO ] Computed 115 invariants in 44 ms
Computed 115 P flows in 45 ms.
Exported basis to /tmp/petrispot-output-669751717438973695.kers
Total runtime 54 ms.
[2026-05-24 21:17:43] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3192/3367 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3367 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/3372 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3372 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6514/9886 variables, 3372/3487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9886 variables, 16/3503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9886 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/9886 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9886/9886 variables, and 3503 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5896 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3372/3372 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 3/0 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/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3192/3367 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3367 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3367 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/3372 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3372 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6514/9886 variables, 3372/3488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9886 variables, 16/3504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9886 variables, 1/3505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9886 variables, 0/3505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/9886 variables, 0/3505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9886/9886 variables, and 3505 constraints, problems are : Problem set: 0 solved, 3 unsolved in 22051 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3372/3372 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28059ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3182 ms.
Support contains 175 out of 3372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3372/3372 places, 6514/6514 transitions.
Applied a total of 0 rules in 36503 ms. Remains 3372 /3372 variables (removed 0) and now considering 6514/6514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36507 ms. Remains : 3372/3372 places, 6514/6514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3372/3372 places, 6514/6514 transitions.
Applied a total of 0 rules in 35645 ms. Remains 3372 /3372 variables (removed 0) and now considering 6514/6514 (removed 0) transitions.
[2026-05-24 21:19:27] [INFO ] Invariant cache hit.
[2026-05-24 21:19:34] [INFO ] Implicit Places using invariants in 7216 ms returned []
[2026-05-24 21:19:34] [INFO ] Invariant cache hit.
[2026-05-24 21:19:39] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-24 21:19:50] [INFO ] Implicit Places using invariants and state equation in 16179 ms returned []
Implicit Place search using SMT with State Equation took 23397 ms to find 0 implicit places.
[2026-05-24 21:19:51] [INFO ] Redundant transitions in 943 ms returned []
Running 6505 sub problems to find dead transitions.
[2026-05-24 21:19:51] [INFO ] Invariant cache hit.
[2026-05-24 21:19:51] [INFO ] State equation strengthened by 16 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 6505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3363/9886 variables, and 98 constraints, problems are : Problem set: 0 solved, 6505 unsolved in 30415 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3372 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 6505/3257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 6505 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/9886 variables, and 98 constraints, problems are : Problem set: 0 solved, 6505 unsolved in 30238 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3372 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 3248/3257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77873ms problems are : Problem set: 0 solved, 6505 unsolved
Search for dead transitions found 0 dead transitions in 77901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137945 ms. Remains : 3372/3372 places, 6514/6514 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 79987 ms. Remains 3372 /3372 variables (removed 0) and now considering 6514/6514 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-24 21:22:29] [INFO ] Invariant cache hit.
[2026-05-24 21:22:31] [INFO ] After 1578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-24 21:22:33] [INFO ] [Nat]Absence check using 115 positive place invariants in 137 ms returned sat
[2026-05-24 21:22:40] [INFO ] After 6776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-24 21:22:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2850 ms
[2026-05-24 21:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 669 ms
TRAPS : Iteration 1
[2026-05-24 21:22:45] [INFO ] After 12381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-24 21:22:46] [INFO ] After 14840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 97125 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 21:22:48] [INFO ] Flatten gal took : 391 ms
[2026-05-24 21:22:48] [INFO ] Applying decomposition
[2026-05-24 21:22:48] [INFO ] Flatten gal took : 315 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9565434708386128241.txt' '-o' '/tmp/graph9565434708386128241.bin' '-w' '/tmp/graph9565434708386128241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9565434708386128241.bin' '-l' '-1' '-v' '-w' '/tmp/graph9565434708386128241.weights' '-q' '0' '-e' '0.001'
[2026-05-24 21:22:51] [INFO ] Decomposing Gal with order
[2026-05-24 21:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 21:22:54] [INFO ] Removed a total of 574 redundant transitions.
[2026-05-24 21:22:55] [INFO ] Flatten gal took : 3396 ms
[2026-05-24 21:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 980 labels/synchronizations in 149 ms.
[2026-05-24 21:22:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1964348420677695049.gal : 74 ms
[2026-05-24 21:22:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14603267045351299635.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/ReachabilityCardinality1964348420677695049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14603267045351299635.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 ...329
Loading property file /tmp/ReachabilityCardinality14603267045351299635.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 46
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :46 after 63
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :63 after 528
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :528 after 3371
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3371 after 3547
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3547 after 22776
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :22776 after 44308
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :44308 after 50509

BK_STOP 1779658668032

--------------------
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="BlocksWorld-PT-11"
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 BlocksWorld-PT-11, 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 r018-smll-177946788100374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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