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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 185K 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 ShieldPPPt-PT-010B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717010627123

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 19:23:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:23:48] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-29 19:23:48] [INFO ] Transformed 783 places.
[2024-05-29 19:23:48] [INFO ] Transformed 713 transitions.
[2024-05-29 19:23:48] [INFO ] Found NUPN structural information;
[2024-05-29 19:23:48] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:23:49] [INFO ] Flatten gal took : 151 ms
RANDOM walk for 40000 steps (8 resets) in 1609 ms. (24 steps per ms) remains 3/13 properties
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 19:23:49] [INFO ] Flatten gal took : 69 ms
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
[2024-05-29 19:23:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14024084556310493264.gal : 57 ms
[2024-05-29 19:23:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4390558048209997343.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/ReachabilityCardinality14024084556310493264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4390558048209997343.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 ...329
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 3/3 properties
Loading property file /tmp/ReachabilityCardinality4390558048209997343.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 861 ms. (46 steps per ms) remains 3/3 properties
// Phase 1: matrix 713 rows 783 cols
[2024-05-29 19:23:49] [INFO ] Computed 111 invariants in 21 ms
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :19 after 289
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :289 after 7515
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :7515 after 1.93828e+08
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.93828e+08 after 3.61401e+15
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.61401e+15 after 1.96785e+29
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.96785e+29 after 1.96785e+29
At refinement iteration 2 (OVERLAPS) 693/783 variables, 111/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 693/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.96785e+29 after 1.96785e+29
At refinement iteration 5 (OVERLAPS) 713/1496 variables, 783/1677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1496 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.96785e+29 after 1.96785e+29
At refinement iteration 7 (OVERLAPS) 0/1496 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 1677 constraints, problems are : Problem set: 0 solved, 3 unsolved in 845 ms.
Refiners :[Domain max(s): 783/783 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 693/783 variables, 111/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 693/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 20 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
Reachability property ShieldPPPt-PT-010B-ReachabilityCardinality-2024-00 is true.
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.96785e+29 after 1.96785e+29
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 13 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:23:51] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.96785e+29 after 1.96785e+29
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:23:52] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 20/914 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 0/914 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 713/1496 variables, 783/1697 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1496 variables, 2/1699 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 19:23:53] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-29 19:23:53] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.96785e+29 after 1.96785e+29
[2024-05-29 19:23:53] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:23:53] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-29 19:23:54] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:23:54] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-29 19:23:54] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:23:54] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-29 19:23:54] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:23:54] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-29 19:23:55] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:23:55] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1496 variables, 12/1711 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 1711 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5016 ms.
Refiners :[Domain max(s): 783/783 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 32/32 constraints]
After SMT, in 5952ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 783 transition count 580
Reduce places removed 133 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 151 rules applied. Total rules applied 284 place count 650 transition count 562
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 302 place count 632 transition count 562
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 302 place count 632 transition count 523
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 380 place count 593 transition count 523
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 433 place count 540 transition count 470
Iterating global reduction 3 with 53 rules applied. Total rules applied 486 place count 540 transition count 470
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 486 place count 540 transition count 449
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 528 place count 519 transition count 449
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 806 place count 380 transition count 310
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 832 place count 367 transition count 310
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 843 place count 367 transition count 299
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 854 place count 356 transition count 299
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 873 place count 356 transition count 299
Applied a total of 873 rules in 217 ms. Remains 356 /783 variables (removed 427) and now considering 299/713 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 356/783 places, 299/713 transitions.
RANDOM walk for 40000 steps (8 resets) in 684 ms. (58 steps per ms) remains 1/2 properties
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
// Phase 1: matrix 299 rows 356 cols
[2024-05-29 19:23:56] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 19:23:56] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 311/356 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 299/655 variables, 356/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 31/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 356/356 constraints, ReadFeed: 31/31 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/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 311/356 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:23:56] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:23:56] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:23:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:23:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1.96785e+29 after 1.96785e+29
At refinement iteration 4 (OVERLAPS) 299/655 variables, 356/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 31/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:23:56] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:23:57] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:23:57] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:23:57] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
[2024-05-29 19:23:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:23:57] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:23:57] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2024-05-29 19:23:57] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/655 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 356/356 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1380ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 173 ms.
Support contains 45 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 299/299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 356 transition count 287
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 344 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 343 transition count 286
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 26 place count 343 transition count 278
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 335 transition count 278
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 334 transition count 277
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 334 transition count 277
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 88 place count 312 transition count 255
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 306 transition count 255
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 306 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 305 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 305 transition count 254
Applied a total of 107 rules in 62 ms. Remains 305 /356 variables (removed 51) and now considering 254/299 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 305/356 places, 254/299 transitions.
RANDOM walk for 40000 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 854437 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :0 out of 1
Probabilistic random walk after 854437 steps, saw 508104 distinct states, run finished after 3004 ms. (steps per millisecond=284 ) properties seen :0
// Phase 1: matrix 254 rows 305 cols
[2024-05-29 19:24:01] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 19:24:01] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/305 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 254/559 variables, 305/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 47/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 463 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 305/305 constraints, ReadFeed: 47/47 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/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/305 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 254/559 variables, 305/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 47/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:24:01] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/559 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 305/305 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1034ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 43 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 254/254 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 304 transition count 253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 303 transition count 252
Applied a total of 4 rules in 23 ms. Remains 303 /305 variables (removed 2) and now considering 252/254 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 303/305 places, 252/254 transitions.
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.96785e+29 after 1.96785e+29
Interrupted probabilistic random walk after 919238 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :0 out of 1
Probabilistic random walk after 919238 steps, saw 550612 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
// Phase 1: matrix 252 rows 303 cols
[2024-05-29 19:24:05] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:24:05] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 260/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 252/555 variables, 303/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 47/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 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/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 260/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 8 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/555 variables, 303/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 47/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 43 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 252/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 303 /303 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 303/303 places, 252/252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 252/252 transitions.
Applied a total of 0 rules in 6 ms. Remains 303 /303 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-29 19:24:07] [INFO ] Invariant cache hit.
[2024-05-29 19:24:07] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 19:24:07] [INFO ] Invariant cache hit.
[2024-05-29 19:24:07] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-29 19:24:07] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-29 19:24:07] [INFO ] Redundant transitions in 12 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-29 19:24:07] [INFO ] Invariant cache hit.
[2024-05-29 19:24:07] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 19:24:09] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:24:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:24:11] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:24:11] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:24:11] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 19:24:11] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:24:11] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 252/555 variables, 303/441 constraints. Problems are: Problem set: 0 solved, 251 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.96785e+29 after 1.96785e+29
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 47/488 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 488 constraints, problems are : Problem set: 0 solved, 251 unsolved in 15214 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 27/138 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/555 variables, 303/441 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 47/488 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 251/739 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 19:24:28] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:24:28] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:24:28] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:24:28] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-29 19:24:29] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-29 19:24:30] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:24:32] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:24:32] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:24:32] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:24:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 10/749 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 19:24:38] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 251 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :1.96785e+29 after 1.96785e+29
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 750 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 38/38 constraints]
After SMT, in 45282ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 45285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45899 ms. Remains : 303/303 places, 252/252 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 303 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 303 transition count 250
Applied a total of 44 rules in 38 ms. Remains 303 /303 variables (removed 0) and now considering 250/252 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 250 rows 303 cols
[2024-05-29 19:24:52] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 19:24:52] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:24:53] [INFO ] [Nat]Absence check using 111 positive place invariants in 14 ms returned sat
[2024-05-29 19:24:53] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 19:24:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:24:53] [INFO ] After 67ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:24:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 682 ms
TRAPS : Iteration 1
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 338 ms
TRAPS : Iteration 2
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 212 ms
TRAPS : Iteration 3
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:24:54] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 652 ms
TRAPS : Iteration 4
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 5
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:24:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 356 ms
TRAPS : Iteration 6
[2024-05-29 19:24:55] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:24:56] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:24:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
TRAPS : Iteration 7
[2024-05-29 19:24:56] [INFO ] After 2964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 19:24:56] [INFO ] After 3260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 19:24:56] [INFO ] Flatten gal took : 37 ms
[2024-05-29 19:24:56] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:24:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17698911627023121535.gal : 20 ms
[2024-05-29 19:24:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1114364147927819619.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/ReachabilityCardinality17698911627023121535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1114364147927819619.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 ...329
Loading property file /tmp/ReachabilityCardinality1114364147927819619.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 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 55
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :55 after 649
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :649 after 16201
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :16201 after 2.22177e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.22177e+06 after 2.2245e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.2245e+06 after 2.27796e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.27796e+06 after 2.81573e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.81573e+06 after 2.22087e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.22087e+07 after 1.14975e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.14975e+10 after 1.94359e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.94359e+11 after 3.9253e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.9253e+14 after 5.86898e+18
Detected timeout of ITS tools.
[2024-05-29 19:25:11] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:25:11] [INFO ] Applying decomposition
[2024-05-29 19:25:11] [INFO ] Flatten gal took : 15 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/graph3027379960335714010.txt' '-o' '/tmp/graph3027379960335714010.bin' '-w' '/tmp/graph3027379960335714010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3027379960335714010.bin' '-l' '-1' '-v' '-w' '/tmp/graph3027379960335714010.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:25:11] [INFO ] Decomposing Gal with order
[2024-05-29 19:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:25:11] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 19:25:11] [INFO ] Flatten gal took : 54 ms
[2024-05-29 19:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 17 ms.
[2024-05-29 19:25:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality895835493076854781.gal : 12 ms
[2024-05-29 19:25:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4950973109940303946.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/ReachabilityCardinality895835493076854781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4950973109940303946.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/ReachabilityCardinality4950973109940303946.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 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 469801
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.11016e+08 after 1.86666e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.86666e+09 after 1.05647e+15
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34092 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 19:25:27] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:25:27] [INFO ] Applying decomposition
[2024-05-29 19:25:27] [INFO ] Flatten gal took : 24 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/graph1270423170276924561.txt' '-o' '/tmp/graph1270423170276924561.bin' '-w' '/tmp/graph1270423170276924561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1270423170276924561.bin' '-l' '-1' '-v' '-w' '/tmp/graph1270423170276924561.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:25:27] [INFO ] Decomposing Gal with order
[2024-05-29 19:25:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:25:27] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 19:25:27] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:25:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 19:25:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3101545607123804376.gal : 12 ms
[2024-05-29 19:25:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2270514346229351920.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/ReachabilityCardinality3101545607123804376.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2270514346229351920.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/ReachabilityCardinality2270514346229351920.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 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1.53043e+11
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.19654e+29 after 4.91259e+29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.91259e+29 after 4.94347e+29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.94347e+29 after 3.60716e+30
ITS-tools command line returned an error code 137
[2024-05-29 19:38:25] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4342119691039603611
[2024-05-29 19:38:25] [INFO ] Applying decomposition
[2024-05-29 19:38:25] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-29 19:38:25] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:38:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:38:25] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-29 19:38:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:38:25] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
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/graph13322091463545724392.txt' '-o' '/tmp/graph13322091463545724392.bin' '-w' '/tmp/graph13322091463545724392.weights'
[2024-05-29 19:38:25] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13322091463545724392.bin' '-l' '-1' '-v' '-w' '/tmp/graph13322091463545724392.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:38:25] [INFO ] Decomposing Gal with order
[2024-05-29 19:38:25] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4342119691039603611
[2024-05-29 19:38:25] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin4342119691039603611;'/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-29 19:38:26] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-29 19:38:26] [INFO ] Flatten gal took : 35 ms
[2024-05-29 19:38:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 41 ms.
[2024-05-29 19:38:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6658722938382096221.gal : 6 ms
[2024-05-29 19:38:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10319819547272411040.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/ReachabilityCardinality6658722938382096221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10319819547272411040.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/ReachabilityCardinality10319819547272411040.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :315 after 943
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :943 after 1885
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1885 after 1885
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1885 after 915625
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7.17012e+07 after 6.08883e+13
Compilation finished in 767 ms.
Running link step : cd /tmp/ltsmin4342119691039603611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4342119691039603611;'/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' 'ShieldPPPtPT010BReachabilityCardinality202401==true'
Detected timeout of ITS tools.
[2024-05-29 20:03:18] [INFO ] Applying decomposition
[2024-05-29 20:03:18] [INFO ] Flatten gal took : 27 ms
[2024-05-29 20:03:18] [INFO ] Decomposing Gal with order
[2024-05-29 20:03:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:03:18] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-29 20:03:18] [INFO ] Flatten gal took : 44 ms
[2024-05-29 20:03:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 40 ms.
[2024-05-29 20:03:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10847219607256285464.gal : 19 ms
[2024-05-29 20:03:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18225794487322765224.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/ReachabilityCardinality10847219607256285464.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18225794487322765224.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 ...309
Loading property file /tmp/ReachabilityCardinality18225794487322765224.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 16201
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.3652e+06 after 1.12331e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.12331e+08 after 9.94657e+13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.94657e+13 after 2.34371e+20
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: 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.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.153: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.159: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.182: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.196: Initializing POR dependencies: labels 253, guards 252
pins2lts-mc-linux64( 0/ 8), 0.801: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 0.813: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.811: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.814: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.814: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.812: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.815: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.814: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.814: There are 253 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.814: State length is 303, there are 252 groups
pins2lts-mc-linux64( 5/ 8), 0.813: "ShieldPPPtPT010BReachabilityCardinality202401==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.814: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.814: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.814: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.814: Visible groups: 0 / 252, labels: 1 / 253
pins2lts-mc-linux64( 0/ 8), 0.814: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.814: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.878: ~4 levels ~960 states ~9336 transitions
pins2lts-mc-linux64( 4/ 8), 0.899: ~5 levels ~1920 states ~19296 transitions
pins2lts-mc-linux64( 4/ 8), 0.946: ~5 levels ~3840 states ~38216 transitions
pins2lts-mc-linux64( 0/ 8), 1.041: ~7 levels ~7680 states ~83616 transitions
pins2lts-mc-linux64( 4/ 8), 1.213: ~7 levels ~15360 states ~146000 transitions
pins2lts-mc-linux64( 0/ 8), 1.549: ~8 levels ~30720 states ~331648 transitions
pins2lts-mc-linux64( 3/ 8), 2.094: ~6 levels ~61440 states ~508152 transitions
pins2lts-mc-linux64( 3/ 8), 3.138: ~7 levels ~122880 states ~1013848 transitions
pins2lts-mc-linux64( 3/ 8), 4.983: ~8 levels ~245760 states ~2087544 transitions
pins2lts-mc-linux64( 3/ 8), 8.195: ~9 levels ~491520 states ~4227168 transitions
pins2lts-mc-linux64( 1/ 8), 14.078: ~10 levels ~983040 states ~9190184 transitions
pins2lts-mc-linux64( 6/ 8), 26.558: ~12 levels ~1966080 states ~17918160 transitions
pins2lts-mc-linux64( 0/ 8), 53.435: ~16 levels ~3932160 states ~39425656 transitions
pins2lts-mc-linux64( 0/ 8), 118.198: ~17 levels ~7864320 states ~80155360 transitions
pins2lts-mc-linux64( 0/ 8), 272.153: ~19 levels ~15728640 states ~161003664 transitions
pins2lts-mc-linux64( 0/ 8), 561.952: ~21 levels ~31457280 states ~322978544 transitions
pins2lts-mc-linux64( 0/ 8), 1172.094: ~23 levels ~62914560 states ~664644352 transitions
pins2lts-mc-linux64( 6/ 8), 1837.714: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1837.750:
pins2lts-mc-linux64( 0/ 8), 1837.750: mean standard work distribution: 7.6% (states) 4.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1837.750:
pins2lts-mc-linux64( 0/ 8), 1837.750: Explored 83674942 states 919243129 transitions, fanout: 10.986
pins2lts-mc-linux64( 0/ 8), 1837.750: Total exploration time 1836.930 sec (1836.900 sec minimum, 1836.914 sec on average)
pins2lts-mc-linux64( 0/ 8), 1837.750: States per second: 45552, Transitions per second: 500424
pins2lts-mc-linux64( 0/ 8), 1837.750: Ignoring proviso: 34415612
pins2lts-mc-linux64( 0/ 8), 1837.750:
pins2lts-mc-linux64( 0/ 8), 1837.750: Queue width: 8B, total height: 51048128, memory: 389.47MB
pins2lts-mc-linux64( 0/ 8), 1837.750: Tree memory: 1053.6MB, 8.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1837.750: Tree fill ratio (roots/leafs): 99.0%/11.0%
pins2lts-mc-linux64( 0/ 8), 1837.750: Stored 253 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1837.750: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1837.750: Est. total memory use: 1443.1MB (~1413.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4342119691039603611;'/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' 'ShieldPPPtPT010BReachabilityCardinality202401==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4342119691039603611;'/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' 'ShieldPPPtPT010BReachabilityCardinality202401==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)

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-010B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761500622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;