fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r198-tall-174894532600367
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ShieldIIPs-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 TTTFTT?TTFTTTFTT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532600367.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldIIPs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532600367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 253K May 29 14:32 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 ShieldIIPs-PT-030A-ReachabilityFireability-2025-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749066965076

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 19:56:06] [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]
[2025-06-04 19:56:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 19:56:06] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-06-04 19:56:06] [INFO ] Transformed 753 places.
[2025-06-04 19:56:06] [INFO ] Transformed 723 transitions.
[2025-06-04 19:56:06] [INFO ] Found NUPN structural information;
[2025-06-04 19:56:06] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (24 resets) in 1901 ms. (21 steps per ms) remains 3/16 properties
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 19:56:07] [INFO ] Flatten gal took : 212 ms
[2025-06-04 19:56:07] [INFO ] Flatten gal took : 93 ms
BEST_FIRST walk for 40004 steps (8 resets) in 639 ms. (62 steps per ms) remains 3/3 properties
[2025-06-04 19:56:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5434478441823772818.gal : 71 ms
[2025-06-04 19:56:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2222877561208711119.prop : 2 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5434478441823772818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2222877561208711119.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 403 ms. (99 steps per ms) remains 3/3 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2222877561208711119.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 3/3 properties
// Phase 1: matrix 723 rows 753 cols
[2025-06-04 19:56:07] [INFO ] Computed 271 invariants in 29 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :2 after 3
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 16
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :16 after 33
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :66 after 122
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :122 after 554
At refinement iteration 2 (OVERLAPS) 181/277 variables, 86/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :554 after 30432
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 181/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :30432 after 40930
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :40930 after 84101
At refinement iteration 5 (OVERLAPS) 476/753 variables, 185/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 476/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :84101 after 949145
At refinement iteration 8 (OVERLAPS) 723/1476 variables, 753/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD size :949145 after 1.61886e+08
At refinement iteration 10 (OVERLAPS) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1476/1476 variables, and 1777 constraints, problems are : Problem set: 0 solved, 3 unsolved in 982 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem ShieldIIPs-PT-030A-ReachabilityFireability-2025-02 is UNSAT
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 181/277 variables, 86/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 181/363 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/363 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 476/753 variables, 185/548 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 476/1024 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:09] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 1/1025 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 0/1025 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.61886e+08 after 3.81334e+09
At refinement iteration 9 (OVERLAPS) 723/1476 variables, 753/1778 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1476 variables, 1/1779 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:09] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:09] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 16 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1476 variables, 3/1782 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:10] [INFO ] Deduced a trap along path composed of 16 places in 121 ms of which 91 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1476 variables, 1/1783 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1476 variables, 0/1783 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1476 variables, 0/1783 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 1783 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2099 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3201ms problems are : Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3.81334e+09 after 1.0858e+12
Parikh walk visited 0 properties in 1372 ms.
Support contains 75 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 753 transition count 722
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Partial Free-agglomeration rule applied 161 times.
Drop transitions (Partial Free agglomeration) removed 161 transitions
Iterating global reduction 0 with 161 rules applied. Total rules applied 163 place count 752 transition count 722
Applied a total of 163 rules in 132 ms. Remains 752 /753 variables (removed 1) and now considering 722/723 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 752/753 places, 722/723 transitions.
RANDOM walk for 40000 steps (20 resets) in 1035 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 282692 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :1 out of 2
Probabilistic random walk after 282692 steps, saw 160836 distinct states, run finished after 3007 ms. (steps per millisecond=94 ) properties seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 722 rows 752 cols
[2025-06-04 19:56:15] [INFO ] Computed 271 invariants in 12 ms
[2025-06-04 19:56:15] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/214 variables, 67/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 142/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 526/740 variables, 198/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 526/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/752 variables, 6/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 12/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 722/1474 variables, 752/1775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1474 variables, 4/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1474 variables, 0/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1474 variables, 0/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1474/1474 variables, and 1779 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Domain max(s): 752/752 constraints, Positive P Invariants (semi-flows): 265/265 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 752/752 constraints, ReadFeed: 4/4 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/214 variables, 67/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 142/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 526/740 variables, 198/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 526/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 1/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/752 variables, 6/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 12/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 722/1474 variables, 752/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1474 variables, 4/1780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:17] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:17] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:17] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:17] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:17] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 65536
[2025-06-04 19:56:17] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 13 ms to minimize.
SDD size :1.0858e+12 after 2.23143e+13
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:17] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1474 variables, 12/1792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1474 variables, 2/1794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:18] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1474 variables, 2/1796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:19] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1474 variables, 1/1797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1474 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1474 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1474/1474 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2935 ms.
Refiners :[Domain max(s): 752/752 constraints, Positive P Invariants (semi-flows): 265/265 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 752/752 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 3508ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 198 ms.
Support contains 72 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 722/722 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Applied a total of 2 rules in 50 ms. Remains 752 /752 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 752/752 places, 722/722 transitions.
RANDOM walk for 40000 steps (20 resets) in 559 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 297958 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 297958 steps, saw 158103 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 722 rows 752 cols
[2025-06-04 19:56:22] [INFO ] Computed 271 invariants in 18 ms
[2025-06-04 19:56:22] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/214 variables, 67/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 142/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 528/742 variables, 199/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 528/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/752 variables, 5/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 10/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 722/1474 variables, 752/1775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1474 variables, 4/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1474 variables, 0/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1474 variables, 0/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1474/1474 variables, and 1779 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Domain max(s): 752/752 constraints, Positive P Invariants (semi-flows): 266/266 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 752/752 constraints, ReadFeed: 4/4 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
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/214 variables, 67/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 142/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 528/742 variables, 199/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 528/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:23] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 2/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/752 variables, 5/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 10/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 722/1474 variables, 752/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1474 variables, 4/1781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:23] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:24] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1474 variables, 11/1792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:25] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:25] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:25] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1474 variables, 3/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1474 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1474 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1474/1474 variables, and 1795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2151 ms.
Refiners :[Domain max(s): 752/752 constraints, Positive P Invariants (semi-flows): 266/266 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 752/752 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2616ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 198 ms.
Support contains 72 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 722/722 transitions.
Applied a total of 0 rules in 33 ms. Remains 752 /752 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 752/752 places, 722/722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 722/722 transitions.
Applied a total of 0 rules in 28 ms. Remains 752 /752 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2025-06-04 19:56:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 19:56:26] [INFO ] Implicit Places using invariants in 457 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 471 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 751/752 places, 722/722 transitions.
Applied a total of 0 rules in 23 ms. Remains 751 /751 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 523 ms. Remains : 751/752 places, 722/722 transitions.
RANDOM walk for 40000 steps (20 resets) in 446 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 295858 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 295858 steps, saw 157704 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 722 rows 751 cols
[2025-06-04 19:56:29] [INFO ] Computed 270 invariants in 20 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/214 variables, 67/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 142/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 527/741 variables, 198/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 527/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/751 variables, 5/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 10/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :2.23143e+13 after 5.89999e+15
At refinement iteration 11 (OVERLAPS) 722/1473 variables, 751/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1473 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1473 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1473/1473 variables, and 1772 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 265/265 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 751/751 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
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 142/214 variables, 67/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 142/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 527/741 variables, 198/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 527/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 3/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/751 variables, 5/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 10/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 722/1473 variables, 751/1777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:30] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1473 variables, 10/1787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:31] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1473 variables, 4/1791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:32] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:32] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1473 variables, 3/1794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1473 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1473 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1473/1473 variables, and 1794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2538 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 265/265 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 3027ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 185 ms.
Support contains 72 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 722/722 transitions.
Applied a total of 0 rules in 27 ms. Remains 751 /751 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 751/751 places, 722/722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 722/722 transitions.
Applied a total of 0 rules in 21 ms. Remains 751 /751 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2025-06-04 19:56:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 19:56:33] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-06-04 19:56:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 19:56:34] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 19:56:34] [INFO ] Redundant transitions in 59 ms returned []
Running 721 sub problems to find dead transitions.
[2025-06-04 19:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 750/750 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/750 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 721 unsolved
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :5.89999e+15 after 1.14883e+17
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (OVERLAPS) 1/751 variables, 265/1020 constraints. Problems are: Problem set: 0 solved, 721 unsolved
SMT process timed out in 30254ms, After SMT, problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 30259ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31724 ms. Remains : 751/751 places, 722/722 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 19:57:04] [INFO ] Flatten gal took : 52 ms
[2025-06-04 19:57:04] [INFO ] Applying decomposition
[2025-06-04 19:57:04] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16463800572531672689.txt' '-o' '/tmp/graph16463800572531672689.bin' '-w' '/tmp/graph16463800572531672689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16463800572531672689.bin' '-l' '-1' '-v' '-w' '/tmp/graph16463800572531672689.weights' '-q' '0' '-e' '0.001'
[2025-06-04 19:57:04] [INFO ] Decomposing Gal with order
[2025-06-04 19:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 19:57:05] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-04 19:57:05] [INFO ] Flatten gal took : 309 ms
[2025-06-04 19:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 468 labels/synchronizations in 67 ms.
[2025-06-04 19:57:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12576434468630696412.gal : 19 ms
[2025-06-04 19:57:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5711247239618449372.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12576434468630696412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5711247239618449372.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5711247239618449372.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 95
Detected timeout of ITS tools.
[2025-06-04 20:27:09] [INFO ] Flatten gal took : 701 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16711523962167474111
[2025-06-04 20:27:09] [INFO ] Applying decomposition
[2025-06-04 20:27:10] [INFO ] Computing symmetric may disable matrix : 722 transitions.
[2025-06-04 20:27:10] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 20:27:10] [INFO ] Computing symmetric may enable matrix : 722 transitions.
[2025-06-04 20:27:10] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 20:27:10] [INFO ] Flatten gal took : 739 ms
[2025-06-04 20:27:12] [INFO ] Computing Do-Not-Accords matrix : 722 transitions.
[2025-06-04 20:27:12] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 20:27:12] [INFO ] Built C files in 2771ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16711523962167474111
Running compilation step : cd /tmp/ltsmin16711523962167474111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9780951674501004025.txt' '-o' '/tmp/graph9780951674501004025.bin' '-w' '/tmp/graph9780951674501004025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9780951674501004025.bin' '-l' '-1' '-v' '-w' '/tmp/graph9780951674501004025.weights' '-q' '0' '-e' '0.001'
[2025-06-04 20:27:13] [INFO ] Decomposing Gal with order
[2025-06-04 20:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 20:27:14] [INFO ] Removed a total of 563 redundant transitions.
[2025-06-04 20:27:14] [INFO ] Flatten gal took : 1166 ms
[2025-06-04 20:27:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 556 labels/synchronizations in 201 ms.
[2025-06-04 20:27:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4987712790410261638.gal : 11 ms
[2025-06-04 20:27:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1619477718887887539.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4987712790410261638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1619477718887887539.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability1619477718887887539.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 20
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :20 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 20
Compilation finished in 33236 ms.
Running link step : cd /tmp/ltsmin16711523962167474111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin16711523962167474111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030AReachabilityFireability202506==true'
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :20 after 8.93619e+42
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.356: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.683: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.763: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.891: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 1.345: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.980: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.981: Initializing POR dependencies: labels 723, guards 722
pins2lts-mc-linux64( 0/ 8), 17.717: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 17.740: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 17.735: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 17.735: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 17.742: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 17.735: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 17.741: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 17.742: There are 723 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 17.742: State length is 751, there are 722 groups
pins2lts-mc-linux64( 0/ 8), 17.742: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 17.742: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 17.742: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 17.742: Visible groups: 0 / 722, labels: 1 / 723
pins2lts-mc-linux64( 0/ 8), 17.742: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 17.742: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 17.736: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 17.736: "ShieldIIPsPT030AReachabilityFireability202506==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 17.822: ~13 levels ~960 states ~3488 transitions
pins2lts-mc-linux64( 0/ 8), 17.895: ~14 levels ~1920 states ~8264 transitions
pins2lts-mc-linux64( 0/ 8), 18.067: ~16 levels ~3840 states ~17400 transitions
pins2lts-mc-linux64( 1/ 8), 18.386: ~9 levels ~7680 states ~32384 transitions
pins2lts-mc-linux64( 5/ 8), 18.886: ~12 levels ~15360 states ~66736 transitions
pins2lts-mc-linux64( 5/ 8), 19.857: ~13 levels ~30720 states ~147416 transitions
pins2lts-mc-linux64( 5/ 8), 27.969: ~14 levels ~61440 states ~310136 transitions
pins2lts-mc-linux64( 5/ 8), 41.668: ~15 levels ~122880 states ~656632 transitions
pins2lts-mc-linux64( 5/ 8), 75.720: ~16 levels ~245760 states ~1400224 transitions
pins2lts-mc-linux64( 5/ 8), 124.883: ~18 levels ~491520 states ~2888040 transitions
pins2lts-mc-linux64( 5/ 8), 188.493: ~19 levels ~983040 states ~6136024 transitions
pins2lts-mc-linux64( 5/ 8), 259.922: ~20 levels ~1966080 states ~12513408 transitions
pins2lts-mc-linux64( 5/ 8), 425.329: ~22 levels ~3932160 states ~26138832 transitions
pins2lts-mc-linux64( 5/ 8), 719.495: ~23 levels ~7864320 states ~54933016 transitions
pins2lts-mc-linux64( 4/ 8), 836.154: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 836.249:
pins2lts-mc-linux64( 0/ 8), 836.249: mean standard work distribution: 10.2% (states) 7.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 836.249:
pins2lts-mc-linux64( 0/ 8), 836.249: Explored 7872367 states 60943516 transitions, fanout: 7.741
pins2lts-mc-linux64( 0/ 8), 836.249: Total exploration time 818.500 sec (818.410 sec minimum, 818.441 sec on average)
pins2lts-mc-linux64( 0/ 8), 836.249: States per second: 9618, Transitions per second: 74458
pins2lts-mc-linux64( 0/ 8), 836.249: Ignoring proviso: 3447979
pins2lts-mc-linux64( 0/ 8), 836.249:
pins2lts-mc-linux64( 0/ 8), 836.249: Queue width: 8B, total height: 6508688, memory: 49.66MB
pins2lts-mc-linux64( 0/ 8), 836.249: Tree memory: 365.7MB, 26.7 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 836.249: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 836.249: Stored 729 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 836.249: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 836.249: Est. total memory use: 415.4MB (~1073.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16711523962167474111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030AReachabilityFireability202506==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16711523962167474111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT030AReachabilityFireability202506==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ShieldIIPs-PT-030A"
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-5832"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-030A, 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 r198-tall-174894532600367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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