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.r550-tall-171734899000270.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 FireWire-PT-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-13-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717366173127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-02 22:09:34] [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-06-02 22:09:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:09:34] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 22:09:34] [INFO ] Transformed 205 places.
[2024-06-02 22:09:34] [INFO ] Transformed 610 transitions.
[2024-06-02 22:09:34] [INFO ] Found NUPN structural information;
[2024-06-02 22:09:34] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:09:35] [INFO ] Flatten gal took : 232 ms
RANDOM walk for 40000 steps (1178 resets) in 2106 ms. (18 steps per ms) remains 7/11 properties
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 22:09:35] [INFO ] Flatten gal took : 154 ms
BEST_FIRST walk for 40003 steps (251 resets) in 427 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (237 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
[2024-06-02 22:09:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14910819505236752675.gal : 28 ms
[2024-06-02 22:09:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2086786697827517638.prop : 3 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/ReachabilityCardinality14910819505236752675.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2086786697827517638.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (233 resets) in 85 ms. (465 steps per ms) remains 7/7 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
BEST_FIRST walk for 40003 steps (234 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality2086786697827517638.prop.
BEST_FIRST walk for 40004 steps (249 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 25
BEST_FIRST walk for 40003 steps (23 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :25 after 45
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :45 after 65
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :65 after 105
BEST_FIRST walk for 40004 steps (250 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :105 after 166
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :166 after 239
[2024-06-02 22:09:35] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
// Phase 1: matrix 504 rows 205 cols
[2024-06-02 22:09:35] [INFO ] Computed 10 invariants in 14 ms
[2024-06-02 22:09:35] [INFO ] State equation strengthened by 73 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :239 after 342
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :342 after 941
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem FireWire-PT-13-ReachabilityCardinality-2024-08 is UNSAT
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-13-ReachabilityCardinality-2024-11 is UNSAT
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 126/201 variables, 9/84 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 126/210 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/204 variables, 1/211 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 3/214 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Reachability property FireWire-PT-13-ReachabilityCardinality-2024-03 is true.
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :941 after 8052
At refinement iteration 8 (OVERLAPS) 503/707 variables, 204/418 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 72/490 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/707 variables, 0/490 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/708 variables, 1/491 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/708 variables, 1/492 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/708 variables, 0/492 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/709 variables, 1/493 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/709 variables, 0/493 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/709 variables, 0/493 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 709/709 variables, and 493 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1048 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 154/194 variables, 8/48 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 154/202 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 15 ms to minimize.
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :8052 after 14528
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 5/207 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/202 variables, 2/209 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 8/217 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/218 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/218 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 503/705 variables, 202/420 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/705 variables, 72/492 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/705 variables, 2/494 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 0/494 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/708 variables, 3/497 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 3/500 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/708 variables, 2/502 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 22:09:38] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/708 variables, 1/503 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/708 variables, 0/503 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/709 variables, 1/504 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/709 variables, 0/504 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/709 variables, 0/504 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 709/709 variables, and 504 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1825 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 7/7 constraints]
After SMT, in 3002ms problems are : Problem set: 3 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :14528 after 26714
Parikh walk visited 0 properties in 1300 ms.
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 542/542 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 536
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 536
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 198 transition count 528
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 198 transition count 528
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 198 transition count 526
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 196 transition count 520
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 196 transition count 520
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 194 transition count 516
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 194 transition count 516
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 193 transition count 515
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 193 transition count 509
Applied a total of 35 rules in 111 ms. Remains 193 /205 variables (removed 12) and now considering 509/542 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 193/205 places, 509/542 transitions.
RANDOM walk for 40000 steps (1279 resets) in 390 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (269 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (256 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (310 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :26714 after 76452
Interrupted probabilistic random walk after 681426 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :1 out of 4
Probabilistic random walk after 681426 steps, saw 161331 distinct states, run finished after 3005 ms. (steps per millisecond=226 ) properties seen :1
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:09:43] [INFO ] Flow matrix only has 479 transitions (discarded 30 similar events)
// Phase 1: matrix 479 rows 193 cols
[2024-06-02 22:09:43] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 22:09:43] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 145/178 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/190 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 479/669 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 70/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/672 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:43] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2024-06-02 22:09:43] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/672 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 275 constraints, problems are : Problem set: 0 solved, 3 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 145/178 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:44] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/190 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:44] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 3 ms to minimize.
[2024-06-02 22:09:44] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 3 ms to minimize.
[2024-06-02 22:09:44] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 479/669 variables, 190/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 70/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:44] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:09:44] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:09:45] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :76452 after 495361
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/672 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/672 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/672 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 672/672 variables, and 285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 2114ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 393 ms.
Support contains 33 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 509/509 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 511
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 192 transition count 509
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 192 transition count 507
Applied a total of 6 rules in 37 ms. Remains 192 /193 variables (removed 1) and now considering 507/509 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 192/193 places, 507/509 transitions.
RANDOM walk for 40000 steps (1260 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (286 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (266 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (274 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 668784 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 3
Probabilistic random walk after 668784 steps, saw 159041 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-06-02 22:09:49] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
// Phase 1: matrix 478 rows 192 cols
[2024-06-02 22:09:49] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 22:09:49] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/177 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 478/667 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 72/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/670 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/670 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/670 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 278 constraints, problems are : Problem set: 0 solved, 3 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/177 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/189 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:50] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:50] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:09:50] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:09:50] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 478/667 variables, 189/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/667 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/667 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/670 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:50] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/670 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:51] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/670 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/670 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/670 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 288 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 2346ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 712 ms.
Support contains 33 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 507/507 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 192/192 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 507/507 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2024-06-02 22:09:52] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 22:09:52] [INFO ] Invariant cache hit.
[2024-06-02 22:09:52] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 22:09:52] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 22:09:52] [INFO ] Invariant cache hit.
[2024-06-02 22:09:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 22:09:52] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [20, 78, 140]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 414 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/192 places, 507/507 transitions.
Applied a total of 0 rules in 10 ms. Remains 189 /189 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 434 ms. Remains : 189/192 places, 507/507 transitions.
RANDOM walk for 40000 steps (1256 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (276 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (280 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (283 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :495361 after 1.25233e+06
Interrupted probabilistic random walk after 699954 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 3
Probabilistic random walk after 699954 steps, saw 167265 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2024-06-02 22:09:55] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
// Phase 1: matrix 478 rows 189 cols
[2024-06-02 22:09:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:09:55] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/181 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 474/655 variables, 181/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 70/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/667 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/667 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/667 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 271 constraints, problems are : Problem set: 0 solved, 3 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/181 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 474/655 variables, 181/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 70/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/667 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/667 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/667 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/667 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/667 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/667 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/667 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 277 constraints, problems are : Problem set: 0 solved, 3 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 1566ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 697 ms.
Support contains 33 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 507/507 transitions.
Applied a total of 0 rules in 11 ms. Remains 189 /189 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 189/189 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 189 /189 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2024-06-02 22:09:58] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 22:09:58] [INFO ] Invariant cache hit.
[2024-06-02 22:09:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:09:58] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 22:09:58] [INFO ] Invariant cache hit.
[2024-06-02 22:09:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 22:09:58] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-06-02 22:09:58] [INFO ] Redundant transitions in 30 ms returned []
Running 506 sub problems to find dead transitions.
[2024-06-02 22:09:58] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 22:09:58] [INFO ] Invariant cache hit.
[2024-06-02 22:09:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 22:10:02] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:10:02] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:10:02] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-06-02 22:10:02] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:10:02] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:10:03] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:10:04] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:10:04] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (OVERLAPS) 478/667 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 72/276 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 22:10:12] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:10:14] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
Reachability property FireWire-PT-13-ReachabilityCardinality-2024-05 is true.
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-13-ReachabilityCardinality-2024-02 is true.
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :1.25233e+06 after 7.82632e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 8 (OVERLAPS) 0/667 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 278 constraints, problems are : Problem set: 0 solved, 506 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 506 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (OVERLAPS) 478/667 variables, 189/206 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 506/784 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 22:10:38] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 3 ms to minimize.
[2024-06-02 22:10:45] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-02 22:10:46] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 3/787 constraints. Problems are: Problem set: 0 solved, 506 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/667 variables, and 787 constraints, problems are : Problem set: 0 solved, 506 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 13/13 constraints]
After SMT, in 60646ms problems are : Problem set: 0 solved, 506 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61102 ms. Remains : 189/189 places, 507/507 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 143 edges and 189 vertex of which 28 / 189 are part of one of the 6 SCC in 3 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 97 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 163 transition count 370
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 163 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 163 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 160 transition count 362
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 160 transition count 362
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 157 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 157 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 154 transition count 347
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 154 transition count 347
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 151 transition count 339
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 151 transition count 339
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 149 transition count 334
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 149 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 148 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 148 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 147 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 147 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 146 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 146 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 145 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 145 transition count 325
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 142 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 73 place count 142 transition count 301
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 1 with 2 rules applied. Total rules applied 75 place count 142 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 140 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 77 place count 140 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 139 transition count 298
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 3 with 2 rules applied. Total rules applied 81 place count 138 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 137 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 137 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 87 place count 137 transition count 293
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 4 with 2 rules applied. Total rules applied 89 place count 136 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 135 transition count 248
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 135 transition count 248
Free-agglomeration rule applied 9 times with reduction of 5 identical transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 100 place count 135 transition count 234
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 111 place count 126 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 126 transition count 231
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 126 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 125 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 125 transition count 231
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 117 place count 125 transition count 231
Applied a total of 117 rules in 98 ms. Remains 125 /189 variables (removed 64) and now considering 231/507 (removed 276) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:10:59] [INFO ] Flow matrix only has 230 transitions (discarded 1 similar events)
// Phase 1: matrix 230 rows 125 cols
[2024-06-02 22:10:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:10:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:10:59] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:10:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:10:59] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:10:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:10:59] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:10:59] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-06-02 22:10:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:10:59] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-06-02 22:10:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
TRAPS : Iteration 1
[2024-06-02 22:10:59] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:10:59] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:10:59] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:10:59] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:10:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16185935886604565451.gal : 4 ms
[2024-06-02 22:10:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11587095136645407885.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/ReachabilityCardinality16185935886604565451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11587095136645407885.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11587095136645407885.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 69
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :69 after 101
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :101 after 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 368
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :368 after 2045
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2045 after 9587
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9587 after 157801
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :157801 after 479939
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :479939 after 1.43172e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.59994e+07,1.53594,50048,2,3947,17,122247,7,0,740,190517,0
Total reachable state count : 65999412

Verifying 1 reachability properties.
Reachability property FireWire-PT-13-ReachabilityCardinality-2024-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-13-ReachabilityCardinality-2024-06,821,1.53842,50048,2,516,17,122247,7,0,748,190517,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 2091 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 22:11:01] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:11:01] [INFO ] Applying decomposition
[2024-06-02 22:11:01] [INFO ] Flatten gal took : 26 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/graph15562562979838127638.txt' '-o' '/tmp/graph15562562979838127638.bin' '-w' '/tmp/graph15562562979838127638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15562562979838127638.bin' '-l' '-1' '-v' '-w' '/tmp/graph15562562979838127638.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:11:01] [INFO ] Decomposing Gal with order
[2024-06-02 22:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:11:01] [INFO ] Removed a total of 911 redundant transitions.
[2024-06-02 22:11:01] [INFO ] Flatten gal took : 88 ms
[2024-06-02 22:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 25 ms.
[2024-06-02 22:11:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality980890156607944715.gal : 8 ms
[2024-06-02 22:11:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality552375307595175269.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/ReachabilityCardinality980890156607944715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality552375307595175269.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 ...305
Loading property file /tmp/ReachabilityCardinality552375307595175269.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 1025
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1025 after 1621
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1621 after 1.18239e+06
Reachability property FireWire-PT-13-ReachabilityCardinality-2024-06 is true.
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.10618e+08,241.511,2725208,5753,128,2.02348e+06,2625,978,2.13186e+07,98,22610,0
Total reachable state count : 410618182

Verifying 1 reachability properties.
Reachability property FireWire-PT-13-ReachabilityCardinality-2024-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-13-ReachabilityCardinality-2024-06,2,241.647,2725208,86,15,2.02348e+06,2625,1003,2.13186e+07,107,22610,0
All properties solved without resorting to model-checking.
Total runtime 329282 ms.

BK_STOP 1717366503584

--------------------
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="FireWire-PT-13"
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 FireWire-PT-13, 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 r550-tall-171734899000270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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