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.r004-smll-171620117600015.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 ASLink-PT-01a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117600015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 201K May 18 16:42 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 ASLink-PT-01a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716212657298

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-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-20 13:44:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 13:44:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 13:44:19] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2024-05-20 13:44:19] [INFO ] Transformed 431 places.
[2024-05-20 13:44:19] [INFO ] Transformed 735 transitions.
[2024-05-20 13:44:19] [INFO ] Found NUPN structural information;
[2024-05-20 13:44:19] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
[2024-05-20 13:44:21] [INFO ] Flatten gal took : 425 ms
RANDOM walk for 40000 steps (818 resets) in 3862 ms. (10 steps per ms) remains 13/16 properties
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-20 13:44:21] [INFO ] Flatten gal took : 240 ms
[2024-05-20 13:44:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1954529514751118626.gal : 76 ms
BEST_FIRST walk for 40002 steps (261 resets) in 1117 ms. (35 steps per ms) remains 13/13 properties
[2024-05-20 13:44:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17790211385997822230.prop : 25 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/ReachabilityCardinality1954529514751118626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17790211385997822230.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40000 steps (276 resets) in 225 ms. (176 steps per ms) remains 13/13 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 (310 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality17790211385997822230.prop.
BEST_FIRST walk for 40003 steps (261 resets) in 468 ms. (85 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (388 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (296 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (285 resets) in 224 ms. (177 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :8 after 36
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :36 after 70
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :70 after 270
BEST_FIRST walk for 40003 steps (256 resets) in 607 ms. (65 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :270 after 1675
BEST_FIRST walk for 40003 steps (289 resets) in 452 ms. (88 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :1675 after 5670
BEST_FIRST walk for 40002 steps (272 resets) in 328 ms. (121 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (288 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :5670 after 6105
BEST_FIRST walk for 40001 steps (277 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (375 resets) in 318 ms. (125 steps per ms) remains 13/13 properties
// Phase 1: matrix 728 rows 431 cols
[2024-05-20 13:44:23] [INFO ] Computed 80 invariants in 79 ms
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :6105 after 29932
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :29932 after 81277
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 71/262 variables, 19/214 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 71/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-01a-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 165/427 variables, 54/340 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 165/505 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/505 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 4/431 variables, 2/507 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 4/511 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 942 constraints, problems are : Problem set: 4 solved, 9 unsolved in 3803 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 75/191 variables, 15/131 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 75/206 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/207 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/207 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 8/199 variables, 4/211 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 8/219 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/219 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem ASLink-PT-01a-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 222/421 variables, 55/274 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 222/496 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-20 13:44:28] [INFO ] Deduced a trap composed of 76 places in 245 ms of which 42 ms to minimize.
[2024-05-20 13:44:29] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 2/498 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/498 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 10/431 variables, 5/503 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 10/513 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-20 13:44:30] [INFO ] Deduced a trap composed of 81 places in 264 ms of which 4 ms to minimize.
[2024-05-20 13:44:30] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 2/515 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/515 constraints. Problems are: Problem set: 5 solved, 8 unsolved
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :81277 after 382978
Problem ASLink-PT-01a-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityFireability-2024-15 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
Problem ASLink-PT-01a-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 1159/1159 variables, and 946 constraints, problems are : Problem set: 11 solved, 2 unsolved in 5008 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 9708ms problems are : Problem set: 11 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 425 transition count 696
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 393 transition count 696
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 70 place count 393 transition count 667
Deduced a syphon composed of 29 places in 3 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 139 place count 353 transition count 667
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 2 with 1 rules applied. Total rules applied 140 place count 353 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 352 transition count 666
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 348 transition count 649
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 347 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 156 place count 346 transition count 644
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 159 place count 343 transition count 644
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 636
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 636
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 628
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 628
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 620
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 612
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 612
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 604
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 596
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 596
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 588
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 588
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 580
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 580
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 572
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 572
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 564
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 556
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 556
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 548
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 548
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 330 transition count 540
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 330 transition count 540
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 329 transition count 532
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 329 transition count 532
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 328 transition count 524
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 328 transition count 524
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 327 transition count 516
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 327 transition count 516
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 205 place count 320 transition count 509
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 207 place count 320 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 319 transition count 508
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 210 place count 317 transition count 508
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 210 place count 317 transition count 504
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 219 place count 312 transition count 504
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 221 place count 310 transition count 504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 221 place count 310 transition count 503
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 223 place count 309 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 227 place count 307 transition count 501
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 228 place count 306 transition count 500
Iterating global reduction 8 with 1 rules applied. Total rules applied 229 place count 306 transition count 500
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 230 place count 306 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 231 place count 305 transition count 499
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 232 place count 305 transition count 499
Applied a total of 232 rules in 768 ms. Remains 305 /431 variables (removed 126) and now considering 499/728 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 784 ms. Remains : 305/431 places, 499/728 transitions.
RANDOM walk for 40000 steps (868 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (379 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 644714 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 644714 steps, saw 220759 distinct states, run finished after 3007 ms. (steps per millisecond=214 ) properties seen :0
// Phase 1: matrix 499 rows 305 cols
[2024-05-20 13:44:36] [INFO ] Computed 56 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/46 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/76 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 113/190 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 44/234 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 13:44:37] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/302 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/302 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/303 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/303 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/305 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/305 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 499/804 variables, 305/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/804 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/804 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/46 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/76 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 113/190 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 44/234 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/302 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/302 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/303 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/303 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/305 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/305 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem ASLink-PT-01a-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 804/804 variables, and 362 constraints, problems are : Problem set: 1 solved, 0 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1194ms 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 18619 ms.

BK_STOP 1716212678208

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-01a, 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 r004-smll-171620117600015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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