About the Execution of ITS-Tools for ASLink-PT-02b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 20959.00 | 0.00 | 0.00 | TTTFTFTFTFTTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000311.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ASLink-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000311
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 417K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-00
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-01
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-02
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-03
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-04
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-05
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-06
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-07
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-08
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-09
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-10
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-11
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-12
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-13
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-14
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748569963938
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 01:52:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 01:52:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:52:45] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2025-05-30 01:52:45] [INFO ] Transformed 1242 places.
[2025-05-30 01:52:45] [INFO ] Transformed 1621 transitions.
[2025-05-30 01:52:45] [INFO ] Found NUPN structural information;
[2025-05-30 01:52:45] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (157 resets) in 1583 ms. (25 steps per ms) remains 7/16 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (34 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (33 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (39 resets) in 351 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (37 resets) in 488 ms. (81 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (37 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (35 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (36 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
[2025-05-30 01:52:46] [INFO ] Flatten gal took : 187 ms
[2025-05-30 01:52:47] [INFO ] Flatten gal took : 85 ms
// Phase 1: matrix 1621 rows 1242 cols
[2025-05-30 01:52:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8113413508484927804.gal : 117 ms
[2025-05-30 01:52:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5006637690549309084.prop : 1 ms
[2025-05-30 01:52:47] [INFO ] Computed 121 invariants in 113 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8113413508484927804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5006637690549309084.prop' '--nowitness' '--gen-order' 'FOLLOW'
Excessive predecessor constraint size, skipping predecessor.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5006637690549309084.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :14 after 47
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :47 after 194
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :194 after 321
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :321 after 964
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :964 after 14485
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :14485 after 399017
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :399017 after 1.00084e+07
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1.00084e+07 after 6.03131e+09
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :6.03131e+09 after 7.20811e+13
At refinement iteration 2 (OVERLAPS) 209/272 variables, 13/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 209/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 111/383 variables, 14/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 111/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2025-05 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2025-12 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2025-14 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 851/1234 variables, 91/501 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1234 variables, 851/1352 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1234 variables, 0/1352 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/1242 variables, 3/1355 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 8/1363 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/1363 constraints. Problems are: Problem set: 3 solved, 4 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :7.20811e+13 after 7.24711e+13
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2605 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5209 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 39/57 variables, 3/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 39/60 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:52] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/61 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 289/346 variables, 24/85 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 289/374 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/374 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 879/1225 variables, 88/462 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 879/1341 constraints. Problems are: Problem set: 3 solved, 4 unsolved
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :7.24711e+13 after 7.27837e+13
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:57] [INFO ] Deduced a trap composed of 20 places in 3447 ms of which 3164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:57] [INFO ] Deduced a trap composed of 62 places in 565 ms of which 75 ms to minimize.
SMT process timed out in 10631ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1242 transition count 1345
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 290 rules applied. Total rules applied 566 place count 966 transition count 1331
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 572 place count 962 transition count 1329
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 574 place count 960 transition count 1329
Performed 275 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 275 Pre rules applied. Total rules applied 574 place count 960 transition count 1054
Deduced a syphon composed of 275 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 4 with 573 rules applied. Total rules applied 1147 place count 662 transition count 1054
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 17 rules applied. Total rules applied 1164 place count 660 transition count 1039
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1179 place count 645 transition count 1039
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1179 place count 645 transition count 1031
Deduced a syphon composed of 8 places in 5 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1203 place count 629 transition count 1031
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1203 place count 629 transition count 1023
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1219 place count 621 transition count 1023
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1256 place count 584 transition count 986
Iterating global reduction 6 with 37 rules applied. Total rules applied 1293 place count 584 transition count 986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1294 place count 584 transition count 985
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 1294 place count 584 transition count 972
Deduced a syphon composed of 13 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 1321 place count 570 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1321 place count 570 transition count 971
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1324 place count 568 transition count 971
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1325 place count 567 transition count 965
Iterating global reduction 7 with 1 rules applied. Total rules applied 1326 place count 567 transition count 965
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1326 place count 567 transition count 964
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1328 place count 566 transition count 964
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 7 with 136 rules applied. Total rules applied 1464 place count 498 transition count 896
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1465 place count 497 transition count 895
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1467 place count 496 transition count 895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1468 place count 495 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 1469 place count 495 transition count 894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1471 place count 495 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1472 place count 494 transition count 892
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1474 place count 493 transition count 901
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1477 place count 493 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1480 place count 490 transition count 898
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1482 place count 490 transition count 896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1484 place count 488 transition count 896
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1485 place count 487 transition count 895
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1491 place count 483 transition count 893
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1493 place count 481 transition count 893
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1493 place count 481 transition count 887
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1506 place count 474 transition count 887
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1509 place count 471 transition count 887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1509 place count 471 transition count 886
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1511 place count 470 transition count 886
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 18 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1521 place count 465 transition count 881
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1523 place count 463 transition count 879
Iterating global reduction 14 with 2 rules applied. Total rules applied 1525 place count 463 transition count 879
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1526 place count 462 transition count 878
Iterating global reduction 14 with 1 rules applied. Total rules applied 1527 place count 462 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1528 place count 462 transition count 877
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1529 place count 462 transition count 876
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1530 place count 461 transition count 876
Applied a total of 1530 rules in 866 ms. Remains 461 /1242 variables (removed 781) and now considering 876/1621 (removed 745) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 888 ms. Remains : 461/1242 places, 876/1621 transitions.
RANDOM walk for 40000 steps (610 resets) in 541 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (225 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (228 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (219 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (214 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :7.27837e+13 after 8.14381e+13
Interrupted probabilistic random walk after 319517 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 4
Probabilistic random walk after 319517 steps, saw 103284 distinct states, run finished after 3005 ms. (steps per millisecond=106 ) properties seen :0
// Phase 1: matrix 876 rows 461 cols
[2025-05-30 01:53:02] [INFO ] Computed 77 invariants in 20 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 205/240 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/268 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/270 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 156/426 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/429 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 30/459 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/461 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 876/1337 variables, 461/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1337 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1337 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 538 constraints, problems are : Problem set: 0 solved, 4 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 205/240 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:53:03] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:53:03] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/268 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/270 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 156/426 variables, 35/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:53:03] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 11 ms to minimize.
Problem ASLink-PT-02b-ReachabilityFireability-2025-04 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/429 variables, 3/71 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 30/459 variables, 8/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/461 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/461 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2025-03 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2025-08 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2025-11 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 1337/1337 variables, and 541 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2653ms problems are : Problem set: 4 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 19586 ms.
BK_STOP 1748569984897
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729000311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;