Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 426K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716914182173

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-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 16:36:23] [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]
[2024-05-28 16:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:36:23] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2024-05-28 16:36:23] [INFO ] Transformed 1253 places.
[2024-05-28 16:36:23] [INFO ] Transformed 1203 transitions.
[2024-05-28 16:36:23] [INFO ] Found NUPN structural information;
[2024-05-28 16:36:23] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 2506 ms. (15 steps per ms) remains 3/16 properties
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 884 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 819 ms. (48 steps per ms) remains 3/3 properties
[2024-05-28 16:36:25] [INFO ] Flatten gal took : 805 ms
BEST_FIRST walk for 40004 steps (8 resets) in 732 ms. (54 steps per ms) remains 3/3 properties
[2024-05-28 16:36:25] [INFO ] Flatten gal took : 136 ms
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:36:25] [INFO ] Computed 451 invariants in 20 ms
[2024-05-28 16:36:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18030426943917578615.gal : 58 ms
[2024-05-28 16:36:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15634602013398610622.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18030426943917578615.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15634602013398610622.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15634602013398610622.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 242/375 variables, 118/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 242/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 878/1253 variables, 333/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 878/1704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1203/2456 variables, 1253/2957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2456 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2456 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
SDD proceeding with computation,3 properties remain. new max is 4
After SMT solving in domain Real declared 2456/2456 variables, and 2957 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1622 ms.
SDD size :2 after 3
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
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
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :66 after 131
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :131 after 321
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :321 after 22229
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :22229 after 40435
At refinement iteration 2 (OVERLAPS) 242/375 variables, 118/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 242/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :40435 after 83841
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :83841 after 949113
At refinement iteration 5 (OVERLAPS) 878/1253 variables, 333/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 878/1704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:36:28] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 24 ms to minimize.
[2024-05-28 16:36:28] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:36:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :949113 after 1.61886e+08
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 3/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1203/2456 variables, 1253/2960 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.61886e+08 after 3.81332e+09
At refinement iteration 10 (INCLUDED_ONLY) 0/2456 variables, 3/2963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:36:30] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:36:30] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3.81332e+09 after 1.08579e+12
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 6/2969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 2969 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5030 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 7022ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 289 times.
Drop transitions (Partial Free agglomeration) removed 289 transitions
Iterating global reduction 0 with 289 rules applied. Total rules applied 293 place count 1251 transition count 1201
Applied a total of 293 rules in 662 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 688 ms. Remains : 1251/1253 places, 1201/1203 transitions.
RANDOM walk for 40000 steps (12 resets) in 1905 ms. (20 steps per ms) remains 2/3 properties
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 483 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 2/2 properties
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:36:34] [INFO ] Computed 451 invariants in 43 ms
[2024-05-28 16:36:34] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 221/335 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 221/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 896/1231 variables, 335/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 896/1672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/1672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/1251 variables, 10/1682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1251 variables, 20/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1201/2452 variables, 1251/2953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2452 variables, 4/2957 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2452 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2452 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2957 constraints, problems are : Problem set: 0 solved, 2 unsolved in 820 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 441/441 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 221/335 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 221/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:36:35] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 896/1231 variables, 335/777 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 896/1673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:36:35] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1231 variables, 5/1678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1231 variables, 2/1680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1231 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 20/1251 variables, 10/1690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 20/1710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:36:36] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 4/1714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1251 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1201/2452 variables, 1251/2965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 4/2969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1.08579e+12 after 2.23143e+13
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 2/2971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:36:38] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 12 ms to minimize.
[2024-05-28 16:36:39] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:36:39] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2024-05-28 16:36:39] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 6 places in 1890 ms of which 29 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2024-05-28 16:36:45] [INFO ] Deduced a trap composed of 9 places in 2389 ms of which 24 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 10/2981 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:36:48] [INFO ] Deduced a trap composed of 5 places in 2093 ms of which 32 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2452 variables, 1/2982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :2.23143e+13 after 5.89999e+15
At refinement iteration 20 (INCLUDED_ONLY) 0/2452 variables, 0/2982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2452 variables, 0/2982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 2982 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15071 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 441/441 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 16016ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3218 ms.
Support contains 53 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 33 times.
Drop transitions (Partial Free agglomeration) removed 33 transitions
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 1251 transition count 1201
Applied a total of 33 rules in 126 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 1251/1251 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 683 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 452 ms. (88 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 169069 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 169069 steps, saw 158034 distinct states, run finished after 3017 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:36:56] [INFO ] Computed 451 invariants in 31 ms
[2024-05-28 16:36:56] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 116/169 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 116/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1060/1229 variables, 386/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1060/1669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 0/1669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/1251 variables, 11/1680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1251 variables, 22/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1201/2452 variables, 1251/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2452 variables, 4/2957 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2452 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2452 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2957 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1689 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 116/169 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 116/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:36:58] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1060/1229 variables, 386/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 1060/1670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:36:59] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 5 ms to minimize.
[2024-05-28 16:36:59] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:36:59] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-05-28 16:36:59] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 4/1674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 0/1674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 22/1251 variables, 11/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 22/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:36:59] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 1/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1201/2452 variables, 1251/2959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 4/2963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 1/2964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:37:07] [INFO ] Deduced a trap composed of 15 places in 5872 ms of which 32 ms to minimize.
[2024-05-28 16:37:08] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:37:08] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:37:08] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:37:08] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:37:09] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 10/2974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 0/2974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:09] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:37:09] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/2452 variables, 2/2976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:10] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2452 variables, 1/2977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2452 variables, 0/2977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/2452 variables, 1/2978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2452 variables, 0/2978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2452 variables, 0/2978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 2978 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12395 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 14164ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1797 ms.
Support contains 53 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 45 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 43 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:37:12] [INFO ] Invariant cache hit.
[2024-05-28 16:37:14] [INFO ] Implicit Places using invariants in 1172 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1196 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 64 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1304 ms. Remains : 1250/1251 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 1054 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 544 ms. (73 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :5.89999e+15 after 1.14883e+17
Interrupted probabilistic random walk after 168964 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 168964 steps, saw 157940 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:37:17] [INFO ] Computed 450 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 116/169 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 116/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1059/1228 variables, 385/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1228 variables, 1059/1667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1228 variables, 0/1667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/1250 variables, 11/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1250 variables, 22/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1201/2451 variables, 1250/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2451 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2451/2451 variables, and 2950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 439/439 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 116/169 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 116/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:18] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1059/1228 variables, 385/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1228 variables, 1059/1668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:18] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:37:18] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:37:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1228 variables, 7/1675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1228 variables, 0/1675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 22/1250 variables, 11/1686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1250 variables, 22/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1250 variables, 2/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1250 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1201/2451 variables, 1250/2960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2451 variables, 1/2961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:37:20] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:37:21] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 5 ms to minimize.
[2024-05-28 16:37:21] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:37:23] [INFO ] Deduced a trap composed of 29 places in 1800 ms of which 3 ms to minimize.
[2024-05-28 16:37:23] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:37:24] [INFO ] Deduced a trap composed of 9 places in 1079 ms of which 1 ms to minimize.
[2024-05-28 16:37:25] [INFO ] Deduced a trap composed of 17 places in 1080 ms of which 0 ms to minimize.
[2024-05-28 16:37:26] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2451 variables, 8/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2451 variables, 0/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2451 variables, 0/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2451/2451 variables, and 2969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8312 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 439/439 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 9109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1851 ms.
Support contains 53 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 32 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 30 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:37:28] [INFO ] Invariant cache hit.
[2024-05-28 16:37:29] [INFO ] Implicit Places using invariants in 841 ms returned []
[2024-05-28 16:37:29] [INFO ] Invariant cache hit.
[2024-05-28 16:37:31] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2550 ms to find 0 implicit places.
[2024-05-28 16:37:31] [INFO ] Redundant transitions in 163 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:37:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 11/1260 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2451 variables, and 1260 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30043 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/439 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 11/1260 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SDD proceeding with computation,3 properties remain. new max is 524288
SDD size :1.14883e+17 after 2.85878e+19
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 1/1250 variables, 439/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:38:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:38:28] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:38:28] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:38:30] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:38:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:38:30] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:38:30] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:38:31] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:38:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:38:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:38:31] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:38:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:38:31] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:38:32] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:38:32] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2451 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30034 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 439/439 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 19/19 constraints]
After SMT, in 61141ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 61171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63943 ms. Remains : 1250/1250 places, 1201/1201 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 16:38:32] [INFO ] Flatten gal took : 84 ms
[2024-05-28 16:38:32] [INFO ] Applying decomposition
[2024-05-28 16:38:32] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7547662627583242442.txt' '-o' '/tmp/graph7547662627583242442.bin' '-w' '/tmp/graph7547662627583242442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7547662627583242442.bin' '-l' '-1' '-v' '-w' '/tmp/graph7547662627583242442.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:38:33] [INFO ] Decomposing Gal with order
[2024-05-28 16:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:38:33] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:38:33] [INFO ] Flatten gal took : 149 ms
[2024-05-28 16:38:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 768 labels/synchronizations in 149 ms.
[2024-05-28 16:38:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6348311040699123412.gal : 24 ms
[2024-05-28 16:38:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14416877318074440772.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6348311040699123412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14416877318074440772.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14416877318074440772.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 79
ITS-tools command line returned an error code 137
[2024-05-28 16:52:40] [INFO ] Flatten gal took : 87 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7171964441011448250
[2024-05-28 16:52:40] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2024-05-28 16:52:40] [INFO ] Applying decomposition
[2024-05-28 16:52:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:40] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2024-05-28 16:52:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:40] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6324527851299054312.txt' '-o' '/tmp/graph6324527851299054312.bin' '-w' '/tmp/graph6324527851299054312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6324527851299054312.bin' '-l' '-1' '-v' '-w' '/tmp/graph6324527851299054312.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:52:41] [INFO ] Decomposing Gal with order
[2024-05-28 16:52:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:52:41] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2024-05-28 16:52:41] [INFO ] Removed a total of 939 redundant transitions.
[2024-05-28 16:52:41] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:41] [INFO ] Flatten gal took : 96 ms
[2024-05-28 16:52:41] [INFO ] Built C files in 497ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7171964441011448250
Running compilation step : cd /tmp/ltsmin7171964441011448250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 16:52:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1059 labels/synchronizations in 55 ms.
[2024-05-28 16:52:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11038315849764495039.gal : 15 ms
[2024-05-28 16:52:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7672584388572307277.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11038315849764495039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7672584388572307277.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability7672584388572307277.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2518
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2518 after 2518
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2518 after 2518
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2518 after 2518
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2518 after 2518
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2518 after 2518
Compilation finished in 5514 ms.
Running link step : cd /tmp/ltsmin7171964441011448250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin7171964441011448250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050AReachabilityFireability202402==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :376465 after 376465
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.172: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.172: Initializing POR dependencies: labels 1202, guards 1201
pins2lts-mc-linux64( 2/ 8), 0.179: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.182: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.210: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.243: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.256: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.261: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 50.853: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 50.943: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 50.941: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 50.943: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 50.946: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 50.946: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 50.946: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 50.945: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 50.948: "ShieldIIPsPT050AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 50.949: There are 1202 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 50.949: State length is 1250, there are 1201 groups
pins2lts-mc-linux64( 0/ 8), 50.949: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 50.949: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 50.949: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 50.949: Visible groups: 0 / 1201, labels: 1 / 1202
pins2lts-mc-linux64( 0/ 8), 50.949: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 50.950: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 51.139: ~12 levels ~960 states ~3312 transitions
pins2lts-mc-linux64( 0/ 8), 51.261: ~13 levels ~1920 states ~7192 transitions
pins2lts-mc-linux64( 0/ 8), 51.509: ~15 levels ~3840 states ~14968 transitions
pins2lts-mc-linux64( 0/ 8), 51.978: ~16 levels ~7680 states ~32328 transitions
pins2lts-mc-linux64( 0/ 8), 52.953: ~17 levels ~15360 states ~71312 transitions
pins2lts-mc-linux64( 0/ 8), 54.875: ~18 levels ~30720 states ~152760 transitions
pins2lts-mc-linux64( 0/ 8), 58.735: ~20 levels ~61440 states ~326360 transitions
pins2lts-mc-linux64( 3/ 8), 66.446: ~13 levels ~122880 states ~733024 transitions
pins2lts-mc-linux64( 3/ 8), 82.261: ~14 levels ~245760 states ~1544072 transitions
pins2lts-mc-linux64( 3/ 8), 115.997: ~16 levels ~491520 states ~3275400 transitions
pins2lts-mc-linux64( 3/ 8), 182.623: ~17 levels ~983040 states ~6801208 transitions
pins2lts-mc-linux64( 3/ 8), 324.744: ~18 levels ~1966080 states ~14522040 transitions
pins2lts-mc-linux64( 2/ 8), 599.025: ~20 levels ~3932160 states ~30585752 transitions
pins2lts-mc-linux64( 3/ 8), 923.249: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 923.336:
pins2lts-mc-linux64( 0/ 8), 923.336: mean standard work distribution: 4.3% (states) 5.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 923.336:
pins2lts-mc-linux64( 0/ 8), 923.336: Explored 5574863 states 44816073 transitions, fanout: 8.039
pins2lts-mc-linux64( 0/ 8), 923.336: Total exploration time 872.380 sec (872.320 sec minimum, 872.346 sec on average)
pins2lts-mc-linux64( 0/ 8), 923.336: States per second: 6390, Transitions per second: 51372
pins2lts-mc-linux64( 0/ 8), 923.336: Ignoring proviso: 2216876
pins2lts-mc-linux64( 0/ 8), 923.336:
pins2lts-mc-linux64( 0/ 8), 923.336: Queue width: 8B, total height: 4843536, memory: 36.95MB
pins2lts-mc-linux64( 0/ 8), 923.336: Tree memory: 335.5MB, 33.8 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 923.336: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 923.336: Stored 1228 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 923.336: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 923.336: Est. total memory use: 372.4MB (~1061.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7171964441011448250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050AReachabilityFireability202402==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7171964441011448250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050AReachabilityFireability202402==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:840)
ITS-tools command line returned an error code 137
[2024-05-28 17:13:29] [INFO ] Applying decomposition
[2024-05-28 17:13:29] [INFO ] Flatten gal took : 62 ms
[2024-05-28 17:13:29] [INFO ] Decomposing Gal with order
[2024-05-28 17:13:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:13:29] [INFO ] Removed a total of 1124 redundant transitions.
[2024-05-28 17:13:29] [INFO ] Flatten gal took : 84 ms
[2024-05-28 17:13:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1023 labels/synchronizations in 66 ms.
[2024-05-28 17:13:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8907306891619913958.gal : 12 ms
[2024-05-28 17:13:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13174310246821004525.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability8907306891619913958.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13174310246821004525.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability13174310246821004525.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 8
ITS-tools command line returned an error code 137
[2024-05-28 17:20:48] [INFO ] Flatten gal took : 66 ms
[2024-05-28 17:20:48] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-28 17:20:48] [INFO ] Transformed 1250 places.
[2024-05-28 17:20:48] [INFO ] Transformed 1201 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 17:20:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15192355039213418151.gal : 8 ms
[2024-05-28 17:20:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10853960506290135198.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15192355039213418151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10853960506290135198.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...375
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability10853960506290135198.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 66
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :66 after 268
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :268 after 3053
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3053 after 9229
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9229 after 44030
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :44030 after 522892
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :522892 after 5.70838e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.70838e+06 after 1.1018e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.1018e+07 after 1.76303e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.76303e+07 after 5.93892e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.93892e+07 after 1.03017e+09
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.03017e+09 after 1.7208e+09

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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-050A"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-050A, 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 r356-tall-171683760500151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;