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-171683761100447.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 ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761100447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 172K 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 ShieldPPPs-PT-010B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716969303210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 07:55:04] [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-29 07:55:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 07:55:04] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-29 07:55:04] [INFO ] Transformed 683 places.
[2024-05-29 07:55:04] [INFO ] Transformed 633 transitions.
[2024-05-29 07:55:04] [INFO ] Found NUPN structural information;
[2024-05-29 07:55:04] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 233 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 (21 resets) in 1585 ms. (25 steps per ms) remains 2/16 properties
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 07:55:05] [INFO ] Flatten gal took : 162 ms
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 2/2 properties
[2024-05-29 07:55:05] [INFO ] Flatten gal took : 103 ms
[2024-05-29 07:55:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8884643801320877142.gal : 34 ms
[2024-05-29 07:55:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18297869608149919701.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/ReachabilityCardinality8884643801320877142.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18297869608149919701.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 2/2 properties

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 ...329
// Phase 1: matrix 633 rows 683 cols
Loading property file /tmp/ReachabilityCardinality18297869608149919701.prop.
[2024-05-29 07:55:05] [INFO ] Computed 111 invariants in 15 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :19 after 576
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :576 after 11916
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :11916 after 3.63285e+08
SDD proceeding with computation,2 properties remain. new max is 512
All remaining problems are real, not stopping.
SDD size :3.63285e+08 after 6.58714e+16
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.58714e+16 after 2.48259e+27
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.48259e+27 after 2.48259e+27
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.48259e+27 after 2.48259e+27
At refinement iteration 2 (OVERLAPS) 650/683 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/683 variables, 650/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 633/1316 variables, 683/1477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1316 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1316 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 1477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1206 ms.
Refiners :[Domain max(s): 683/683 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 683/683 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/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 650/683 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/683 variables, 650/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.48259e+27 after 2.48259e+27
[2024-05-29 07:55:07] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 25 ms to minimize.
[2024-05-29 07:55:07] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.48259e+27 after 2.48259e+27
[2024-05-29 07:55:07] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 2 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 4 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 11 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 9 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 15 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-29 07:55:08] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 3 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 25 places in 468 ms of which 2 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 16 ms to minimize.
[2024-05-29 07:55:09] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2024-05-29 07:55:10] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.48259e+27 after 2.48259e+27
[2024-05-29 07:55:10] [INFO ] Deduced a trap composed of 23 places in 894 ms of which 2 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 20/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 25 places in 442 ms of which 2 ms to minimize.
[2024-05-29 07:55:11] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
SMT process timed out in 6301ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 633/633 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 683 transition count 571
Reduce places removed 62 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 621 transition count 568
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 618 transition count 568
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 130 place count 618 transition count 519
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 228 place count 569 transition count 519
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 291 place count 506 transition count 456
Iterating global reduction 3 with 63 rules applied. Total rules applied 354 place count 506 transition count 456
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 354 place count 506 transition count 435
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 396 place count 485 transition count 435
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 668 place count 349 transition count 299
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 746 place count 349 transition count 299
Applied a total of 746 rules in 319 ms. Remains 349 /683 variables (removed 334) and now considering 299/633 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 349/683 places, 299/633 transitions.
RANDOM walk for 40000 steps (21 resets) in 1240 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 1/2 properties
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
// Phase 1: matrix 299 rows 349 cols
[2024-05-29 07:55:12] [INFO ] Computed 111 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/337 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/349 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 299/648 variables, 349/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 460 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 105/105 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 349/349 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/337 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 5 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.48259e+27 after 2.48259e+27
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 07:55:13] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 07:55:14] [INFO ] Deduced a trap composed of 7 places in 717 ms of which 4 ms to minimize.
[2024-05-29 07:55:14] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 13/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/349 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 07:55:14] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:55:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 299/648 variables, 349/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 07:55:15] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:55:15] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:55:15] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/648 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2592 ms.
Refiners :[Positive P Invariants (semi-flows): 105/105 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 2854ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 18 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 299/299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 349 transition count 297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 347 transition count 297
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 347 transition count 293
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 343 transition count 293
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 32 place count 333 transition count 283
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 333 transition count 283
Applied a total of 35 rules in 38 ms. Remains 333 /349 variables (removed 16) and now considering 283/299 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 333/349 places, 283/299 transitions.
RANDOM walk for 40000 steps (9 resets) in 386 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.48259e+27 after 2.48259e+27
Interrupted probabilistic random walk after 696594 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 696594 steps, saw 489908 distinct states, run finished after 3005 ms. (steps per millisecond=231 ) properties seen :0
// Phase 1: matrix 283 rows 333 cols
[2024-05-29 07:55:18] [INFO ] Computed 111 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 305/323 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/333 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 283/616 variables, 333/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/616 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 616/616 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 106/106 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 333/333 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 305/323 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:19] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 13/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/333 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 283/616 variables, 333/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/616 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 616/616 variables, and 458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 106/106 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 1253ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 18 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 283/283 transitions.
Applied a total of 0 rules in 10 ms. Remains 333 /333 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 333/333 places, 283/283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 283/283 transitions.
Applied a total of 0 rules in 12 ms. Remains 333 /333 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2024-05-29 07:55:20] [INFO ] Invariant cache hit.
[2024-05-29 07:55:20] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-29 07:55:20] [INFO ] Invariant cache hit.
[2024-05-29 07:55:20] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-29 07:55:20] [INFO ] Redundant transitions in 18 ms returned []
Running 282 sub problems to find dead transitions.
[2024-05-29 07:55:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/333 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 9 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:55:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:26] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:55:28] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:28] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:55:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:55:28] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:55:28] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
SDD size :2.48259e+27 after 2.48259e+27
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:55:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:30] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:55:30] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 8 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:55:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:55:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 18/189 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:35] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 283/616 variables, 333/523 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:39] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:55:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:55:41] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 9/532 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 3 ms to minimize.
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 07:55:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:55:43] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:43] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:55:43] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-29 07:55:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 10/542 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:55:46] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:55:47] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 20/562 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/616 variables, and 562 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 106/106 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/333 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 118/229 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:55:52] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:55:52] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:55:52] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:55:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:55:53] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:55:53] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-29 07:55:53] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:55:53] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-29 07:55:53] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.48259e+27 after 2.48259e+27
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 283/616 variables, 333/571 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 282/853 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 07:56:04] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:56:05] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:56:05] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-29 07:56:06] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:56:11] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:56:11] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 6/859 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/616 variables, and 859 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 106/106 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 133/133 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60783 ms. Remains : 333/333 places, 283/283 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 07:56:21] [INFO ] Flatten gal took : 54 ms
[2024-05-29 07:56:21] [INFO ] Applying decomposition
[2024-05-29 07:56:21] [INFO ] Flatten gal took : 34 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/graph15430663259402028106.txt' '-o' '/tmp/graph15430663259402028106.bin' '-w' '/tmp/graph15430663259402028106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15430663259402028106.bin' '-l' '-1' '-v' '-w' '/tmp/graph15430663259402028106.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:56:21] [INFO ] Decomposing Gal with order
[2024-05-29 07:56:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:56:21] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-29 07:56:21] [INFO ] Flatten gal took : 87 ms
[2024-05-29 07:56:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 07:56:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality771078879837457095.gal : 15 ms
[2024-05-29 07:56:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9420209088865311467.prop : 0 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/ReachabilityCardinality771078879837457095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9420209088865311467.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 ...306
Loading property file /tmp/ReachabilityCardinality9420209088865311467.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 4463
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4463 after 4.10795e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.10795e+07 after 4.22046e+22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.11737e+28 after 2.43263e+29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.43263e+29 after 6.7997e+34
ITS-tools command line returned an error code 137
[2024-05-29 08:11:13] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17128856393450798953
[2024-05-29 08:11:13] [INFO ] Applying decomposition
[2024-05-29 08:11:13] [INFO ] Computing symmetric may disable matrix : 283 transitions.
[2024-05-29 08:11:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:11:13] [INFO ] Computing symmetric may enable matrix : 283 transitions.
[2024-05-29 08:11:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:11:13] [INFO ] Flatten gal took : 15 ms
[2024-05-29 08:11:13] [INFO ] Computing Do-Not-Accords matrix : 283 transitions.
[2024-05-29 08:11:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:11:13] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17128856393450798953
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/graph13595812636223611710.txt' '-o' '/tmp/graph13595812636223611710.bin' '-w' '/tmp/graph13595812636223611710.weights'
Running compilation step : cd /tmp/ltsmin17128856393450798953;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13595812636223611710.bin' '-l' '-1' '-v' '-w' '/tmp/graph13595812636223611710.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:11:13] [INFO ] Decomposing Gal with order
[2024-05-29 08:11:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:11:13] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-29 08:11:13] [INFO ] Flatten gal took : 68 ms
[2024-05-29 08:11:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 215 labels/synchronizations in 25 ms.
[2024-05-29 08:11:13] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability497789477031529515.gal : 6 ms
[2024-05-29 08:11:13] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13059539291091279554.prop : 0 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/ReachabilityFireability497789477031529515.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13059539291091279554.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 ...307
Loading property file /tmp/ReachabilityFireability13059539291091279554.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 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 631477
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :631477 after 2.60726e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.60726e+08 after 6.86558e+09
Compilation finished in 990 ms.
Running link step : cd /tmp/ltsmin17128856393450798953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17128856393450798953;'/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' 'ShieldPPPsPT010BReachabilityFireability202410==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.86558e+09 after 1.25854e+12
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Initializing POR dependencies: labels 284, guards 283
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.852: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 0.911: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.913: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.913: There are 284 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.913: State length is 333, there are 283 groups
pins2lts-mc-linux64( 0/ 8), 0.913: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.913: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.913: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.913: Visible groups: 0 / 283, labels: 1 / 284
pins2lts-mc-linux64( 0/ 8), 0.913: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.913: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.912: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.912: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.914: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.914: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.912: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.913: "ShieldPPPsPT010BReachabilityFireability202410==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.930: ~5 levels ~960 states ~7416 transitions
pins2lts-mc-linux64( 0/ 8), 0.942: ~6 levels ~1920 states ~14112 transitions
pins2lts-mc-linux64( 0/ 8), 0.974: ~6 levels ~3840 states ~27712 transitions
pins2lts-mc-linux64( 0/ 8), 1.069: ~8 levels ~7680 states ~53704 transitions
pins2lts-mc-linux64( 0/ 8), 1.252: ~9 levels ~15360 states ~105576 transitions
pins2lts-mc-linux64( 0/ 8), 1.613: ~11 levels ~30720 states ~215784 transitions
pins2lts-mc-linux64( 0/ 8), 2.371: ~12 levels ~61440 states ~439200 transitions
pins2lts-mc-linux64( 0/ 8), 3.730: ~13 levels ~122880 states ~900816 transitions
pins2lts-mc-linux64( 7/ 8), 6.183: ~10 levels ~245760 states ~1842456 transitions
pins2lts-mc-linux64( 4/ 8), 10.481: ~12 levels ~491520 states ~3768032 transitions
pins2lts-mc-linux64( 6/ 8), 18.527: ~12 levels ~983040 states ~7291056 transitions
pins2lts-mc-linux64( 6/ 8), 35.122: ~14 levels ~1966080 states ~15099744 transitions
pins2lts-mc-linux64( 6/ 8), 69.106: ~15 levels ~3932160 states ~30490848 transitions
pins2lts-mc-linux64( 6/ 8), 151.854: ~17 levels ~7864320 states ~63422072 transitions
pins2lts-mc-linux64( 6/ 8), 312.313: ~18 levels ~15728640 states ~130672296 transitions
pins2lts-mc-linux64( 6/ 8), 626.360: ~20 levels ~31457280 states ~268859104 transitions
pins2lts-mc-linux64( 6/ 8), 1275.947: ~22 levels ~62914560 states ~548764024 transitions
pins2lts-mc-linux64( 1/ 8), 1469.713: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1469.766:
pins2lts-mc-linux64( 0/ 8), 1469.766: mean standard work distribution: 2.5% (states) 3.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1469.766:
pins2lts-mc-linux64( 0/ 8), 1469.766: Explored 69233796 states 670294237 transitions, fanout: 9.682
pins2lts-mc-linux64( 0/ 8), 1469.766: Total exploration time 1468.850 sec (1468.810 sec minimum, 1468.819 sec on average)
pins2lts-mc-linux64( 0/ 8), 1469.766: States per second: 47135, Transitions per second: 456339
pins2lts-mc-linux64( 0/ 8), 1469.766: Ignoring proviso: 35966794
pins2lts-mc-linux64( 0/ 8), 1469.766:
pins2lts-mc-linux64( 0/ 8), 1469.766: Queue width: 8B, total height: 37965562, memory: 289.65MB
pins2lts-mc-linux64( 0/ 8), 1469.766: Tree memory: 1072.3MB, 10.5 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1469.766: Tree fill ratio (roots/leafs): 79.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1469.766: Stored 284 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1469.766: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1469.766: Est. total memory use: 1361.9MB (~1313.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17128856393450798953;'/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' 'ShieldPPPsPT010BReachabilityFireability202410==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17128856393450798953;'/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' 'ShieldPPPsPT010BReachabilityFireability202410==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)
Detected timeout of ITS tools.
[2024-05-29 08:36:37] [INFO ] Applying decomposition
[2024-05-29 08:36:37] [INFO ] Flatten gal took : 14 ms
[2024-05-29 08:36:37] [INFO ] Decomposing Gal with order
[2024-05-29 08:36:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:36:37] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-29 08:36:37] [INFO ] Flatten gal took : 23 ms
[2024-05-29 08:36:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 69 ms.
[2024-05-29 08:36:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6804610181432006942.gal : 12 ms
[2024-05-29 08:36:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability690173713431833560.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/ReachabilityFireability6804610181432006942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability690173713431833560.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 ...306
Loading property file /tmp/ReachabilityFireability690173713431833560.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 2.71428e+11
ITS-tools command line returned an error code 137
[2024-05-29 08:45:25] [INFO ] Flatten gal took : 21 ms
[2024-05-29 08:45:25] [INFO ] Input system was already deterministic with 283 transitions.
[2024-05-29 08:45:25] [INFO ] Transformed 333 places.
[2024-05-29 08:45:25] [INFO ] Transformed 283 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-29 08:45:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4885296898957987448.gal : 5 ms
[2024-05-29 08:45:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16404491034199697940.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/ReachabilityFireability4885296898957987448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16404491034199697940.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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability16404491034199697940.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 190
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :190 after 3970
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3970 after 93328
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :93328 after 93703
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :93703 after 97326
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :97326 after 157792
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :157792 after 199153
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :199153 after 4.09034e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.09034e+06 after 5.88651e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.88651e+06 after 2.97251e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.97251e+07 after 6.54765e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.54765e+08 after 1.43186e+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="ShieldPPPs-PT-010B"
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 ShieldPPPs-PT-010B, 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-171683761100447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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