Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446700238.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S02J04T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446700238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K 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 PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716914432076

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 16:40:33] [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-28 16:40:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:40:34] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-28 16:40:34] [INFO ] Transformed 752 places.
[2024-05-28 16:40:34] [INFO ] Transformed 1572 transitions.
[2024-05-28 16:40:34] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (10 resets) in 3652 ms. (10 steps per ms) remains 10/16 properties
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 16:40:35] [INFO ] Flatten gal took : 433 ms
[2024-05-28 16:40:35] [INFO ] Flatten gal took : 104 ms
[2024-05-28 16:40:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3737179088241455004.gal : 142 ms
[2024-05-28 16:40:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8419132354574892257.prop : 14 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/ReachabilityCardinality3737179088241455004.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8419132354574892257.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (10 resets) in 1428 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 403 ms. (99 steps per ms) remains 10/10 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 ...328
Loading property file /tmp/ReachabilityCardinality8419132354574892257.prop.
BEST_FIRST walk for 40000 steps (8 resets) in 1165 ms. (34 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 1037 ms. (38 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 23
BEST_FIRST walk for 40003 steps (9 resets) in 1160 ms. (34 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :23 after 41
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :41 after 241
BEST_FIRST walk for 40001 steps (10 resets) in 611 ms. (65 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :241 after 247
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :247 after 263
BEST_FIRST walk for 40004 steps (8 resets) in 995 ms. (40 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 521 ms. (76 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :263 after 983
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :983 after 1073
BEST_FIRST walk for 40002 steps (10 resets) in 550 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 392 ms. (101 steps per ms) remains 10/10 properties
[2024-05-28 16:40:38] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-28 16:40:38] [INFO ] Computed 54 invariants in 180 ms
[2024-05-28 16:40:38] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1073 after 1393
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1393 after 2768
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 58/656 variables, 10/28 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 2/30 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 96/752 variables, 24/54 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 806 constraints, problems are : Problem set: 9 solved, 1 unsolved in 3229 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/170 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/177 variables, 4/7 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 525/702 variables, 16/23 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-05-28 16:40:44] [INFO ] Deduced a trap composed of 426 places in 617 ms of which 84 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :2768 after 7796
[2024-05-28 16:40:45] [INFO ] Deduced a trap composed of 419 places in 846 ms of which 17 ms to minimize.
[2024-05-28 16:40:45] [INFO ] Deduced a trap composed of 422 places in 425 ms of which 5 ms to minimize.
[2024-05-28 16:40:45] [INFO ] Deduced a trap composed of 422 places in 454 ms of which 6 ms to minimize.
[2024-05-28 16:40:46] [INFO ] Deduced a trap composed of 432 places in 379 ms of which 5 ms to minimize.
[2024-05-28 16:40:46] [INFO ] Deduced a trap composed of 435 places in 371 ms of which 4 ms to minimize.
[2024-05-28 16:40:47] [INFO ] Deduced a trap composed of 413 places in 475 ms of which 4 ms to minimize.
[2024-05-28 16:40:47] [INFO ] Deduced a trap composed of 416 places in 539 ms of which 4 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 425 places in 526 ms of which 14 ms to minimize.
SMT process timed out in 9886ms, After SMT, problems are : Problem set: 9 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 750 transition count 1329
Reduce places removed 83 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 667 transition count 1327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 172 place count 665 transition count 1327
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 172 place count 665 transition count 1250
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 326 place count 588 transition count 1250
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 480 place count 511 transition count 1173
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 502 place count 511 transition count 1151
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 524 place count 489 transition count 1151
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 525 place count 489 transition count 1151
Applied a total of 525 rules in 397 ms. Remains 489 /752 variables (removed 263) and now considering 1151/1412 (removed 261) transitions.
Running 1149 sub problems to find dead transitions.
[2024-05-28 16:40:48] [INFO ] Flow matrix only has 1131 transitions (discarded 20 similar events)
// Phase 1: matrix 1131 rows 489 cols
[2024-05-28 16:40:48] [INFO ] Computed 52 invariants in 28 ms
[2024-05-28 16:40:48] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :7796 after 24119
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:41:00] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2024-05-28 16:41:02] [INFO ] Deduced a trap composed of 40 places in 896 ms of which 3 ms to minimize.
[2024-05-28 16:41:02] [INFO ] Deduced a trap composed of 56 places in 343 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :24119 after 94070
[2024-05-28 16:41:03] [INFO ] Deduced a trap composed of 208 places in 891 ms of which 3 ms to minimize.
[2024-05-28 16:41:04] [INFO ] Deduced a trap composed of 66 places in 378 ms of which 3 ms to minimize.
[2024-05-28 16:41:04] [INFO ] Deduced a trap composed of 98 places in 593 ms of which 3 ms to minimize.
[2024-05-28 16:41:05] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 3 ms to minimize.
[2024-05-28 16:41:05] [INFO ] Deduced a trap composed of 190 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 194 places in 466 ms of which 3 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 173 places in 433 ms of which 3 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 280 places in 368 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
[2024-05-28 16:41:10] [INFO ] Deduced a trap composed of 163 places in 363 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1620 variables, and 71 constraints, problems are : Problem set: 0 solved, 1149 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/489 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1149/1149 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :94070 after 681174
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1149 unsolved
[2024-05-28 16:41:28] [INFO ] Deduced a trap composed of 85 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:41:31] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 3 ms to minimize.
[2024-05-28 16:41:31] [INFO ] Deduced a trap composed of 207 places in 284 ms of which 3 ms to minimize.
[2024-05-28 16:41:31] [INFO ] Deduced a trap composed of 46 places in 367 ms of which 10 ms to minimize.
SMT process timed out in 42952ms, After SMT, problems are : Problem set: 0 solved, 1149 unsolved
Search for dead transitions found 0 dead transitions in 42973ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43406 ms. Remains : 489/752 places, 1151/1412 transitions.
RANDOM walk for 40000 steps (11 resets) in 994 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 133945 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 133945 steps, saw 92584 distinct states, run finished after 3008 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-28 16:41:35] [INFO ] Flow matrix only has 1131 transitions (discarded 20 similar events)
[2024-05-28 16:41:35] [INFO ] Invariant cache hit.
[2024-05-28 16:41:35] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/242 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/269 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/446 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/454 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/487 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1131/1618 variables, 487/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1618 variables, 120/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1618 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1620 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1620 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1620 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1620 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1620/1620 variables, and 661 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1969 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 489/489 constraints, ReadFeed: 120/120 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/242 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/269 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/446 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 204 places in 258 ms of which 4 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 186 places in 385 ms of which 5 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 200 places in 356 ms of which 3 ms to minimize.
[2024-05-28 16:41:39] [INFO ] Deduced a trap composed of 205 places in 1303 ms of which 3 ms to minimize.
[2024-05-28 16:41:40] [INFO ] Deduced a trap composed of 202 places in 524 ms of which 4 ms to minimize.
[2024-05-28 16:41:40] [INFO ] Deduced a trap composed of 203 places in 284 ms of which 6 ms to minimize.
[2024-05-28 16:41:40] [INFO ] Deduced a trap composed of 188 places in 243 ms of which 2 ms to minimize.
[2024-05-28 16:41:41] [INFO ] Deduced a trap composed of 203 places in 237 ms of which 2 ms to minimize.
[2024-05-28 16:41:41] [INFO ] Deduced a trap composed of 214 places in 221 ms of which 2 ms to minimize.
[2024-05-28 16:41:41] [INFO ] Deduced a trap composed of 215 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:41:41] [INFO ] Deduced a trap composed of 213 places in 206 ms of which 2 ms to minimize.
[2024-05-28 16:41:42] [INFO ] Deduced a trap composed of 205 places in 207 ms of which 2 ms to minimize.
[2024-05-28 16:41:42] [INFO ] Deduced a trap composed of 215 places in 204 ms of which 2 ms to minimize.
[2024-05-28 16:41:42] [INFO ] Deduced a trap composed of 206 places in 205 ms of which 3 ms to minimize.
Problem PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 446/1620 variables, and 41 constraints, problems are : Problem set: 1 solved, 0 unsolved in 5232 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 12/33 constraints, State Equation: 0/489 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 7235ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 68754 ms.

BK_STOP 1716914502617

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PolyORBLF-PT-S02J04T10"
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 PolyORBLF-PT-S02J04T10, 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 r290-tajo-171654446700238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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