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.r444-smll-171701111200287.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 Vasy2003-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701111200287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 207K 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 Vasy2003-PT-none-ReachabilityFireability-2024-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717139581684

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-31 07:13:03] [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-31 07:13:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:13:04] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2024-05-31 07:13:04] [INFO ] Transformed 485 places.
[2024-05-31 07:13:04] [INFO ] Transformed 776 transitions.
[2024-05-31 07:13:04] [INFO ] Found NUPN structural information;
[2024-05-31 07:13:04] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 612 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
RANDOM walk for 40000 steps (8 resets) in 3737 ms. (10 steps per ms) remains 8/16 properties
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1260 ms. (31 steps per ms) remains 8/8 properties
[2024-05-31 07:13:06] [INFO ] Flatten gal took : 414 ms
[2024-05-31 07:13:06] [INFO ] Flatten gal took : 118 ms
[2024-05-31 07:13:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6502557093979940771.gal : 58 ms
BEST_FIRST walk for 40004 steps (8 resets) in 989 ms. (40 steps per ms) remains 8/8 properties
[2024-05-31 07:13:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8772995656728260679.prop : 6 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/ReachabilityCardinality6502557093979940771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8772995656728260679.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality8772995656728260679.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 316 ms. (126 steps per ms) remains 8/8 properties
[2024-05-31 07:13:07] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2024-05-31 07:13:07] [INFO ] Computed 66 invariants in 35 ms
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :11 after 15
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :15 after 131
[2024-05-31 07:13:07] [INFO ] State equation strengthened by 73 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :131 after 197
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :197 after 1161
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1161 after 5081
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :5081 after 30075
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :30075 after 460801
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 277/429 variables, 33/185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :460801 after 1.35252e+09
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 277/462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 48/477 variables, 26/491 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 48/539 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 8/485 variables, 4/543 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 8/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 695/1180 variables, 485/1036 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1180 variables, 72/1108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1180 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/1181 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1181 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1181 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1.35252e+09 after 8.65332e+09
After SMT solving in domain Real declared 1181/1181 variables, and 1109 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2753 ms.
Refiners :[Domain max(s): 485/485 constraints, Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 485/485 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem Vasy2003-PT-none-ReachabilityFireability-2024-01 is UNSAT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Vasy2003-PT-none-ReachabilityFireability-2024-09 is UNSAT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 277/429 variables, 33/185 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 277/462 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 3/465 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-31 07:13:11] [INFO ] Deduced a trap composed of 124 places in 373 ms of which 61 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 1/466 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/466 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 48/477 variables, 26/492 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 48/540 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/540 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 8/485 variables, 4/544 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 8/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 695/1180 variables, 485/1037 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1180 variables, 72/1109 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1180 variables, 6/1115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1180 variables, 0/1115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/1181 variables, 1/1116 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1181/1181 variables, and 1116 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5012 ms.
Refiners :[Domain max(s): 485/485 constraints, Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 485/485 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 8466ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 485 places. Attempting structural reductions.
SDD size :8.65332e+09 after 2.70462e+10
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 101 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 483 transition count 741
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 480 transition count 741
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 124 place count 363 transition count 624
Iterating global reduction 0 with 117 rules applied. Total rules applied 241 place count 363 transition count 624
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 268 place count 363 transition count 597
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 316 place count 315 transition count 538
Iterating global reduction 1 with 48 rules applied. Total rules applied 364 place count 315 transition count 538
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 392 place count 315 transition count 510
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 412 place count 295 transition count 482
Iterating global reduction 2 with 20 rules applied. Total rules applied 432 place count 295 transition count 482
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 444 place count 295 transition count 470
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 451 place count 288 transition count 459
Iterating global reduction 3 with 7 rules applied. Total rules applied 458 place count 288 transition count 459
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 462 place count 286 transition count 457
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 464 place count 284 transition count 455
Iterating global reduction 3 with 2 rules applied. Total rules applied 466 place count 284 transition count 455
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 470 place count 284 transition count 451
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 472 place count 282 transition count 448
Iterating global reduction 4 with 2 rules applied. Total rules applied 474 place count 282 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 475 place count 282 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 477 place count 282 transition count 445
Applied a total of 477 rules in 252 ms. Remains 282 /485 variables (removed 203) and now considering 445/752 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 282/485 places, 445/752 transitions.
RANDOM walk for 40000 steps (8 resets) in 1086 ms. (36 steps per ms) remains 4/6 properties
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
[2024-05-31 07:13:16] [INFO ] Flow matrix only has 407 transitions (discarded 38 similar events)
// Phase 1: matrix 407 rows 282 cols
[2024-05-31 07:13:16] [INFO ] Computed 66 invariants in 6 ms
[2024-05-31 07:13:16] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/213 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 62/275 variables, 33/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 7/282 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 407/689 variables, 282/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 58/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/689 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 406 constraints, problems are : Problem set: 0 solved, 4 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 282/282 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/213 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 07:13:17] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 07:13:18] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/275 variables, 33/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/282 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 407/689 variables, 282/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 58/408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/689 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/689 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 412 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 282/282 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3005ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1559 ms.
Support contains 42 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 445/445 transitions.
Graph (complete) has 956 edges and 282 vertex of which 280 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 280 transition count 440
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 279 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 278 transition count 439
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 278 transition count 436
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 275 transition count 436
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 64 place count 225 transition count 373
Ensure Unique test removed 1 places
Iterating global reduction 3 with 51 rules applied. Total rules applied 115 place count 224 transition count 373
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 146 place count 224 transition count 342
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 164 place count 206 transition count 317
Iterating global reduction 4 with 18 rules applied. Total rules applied 182 place count 206 transition count 317
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 4 with 14 rules applied. Total rules applied 196 place count 206 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 197 place count 205 transition count 303
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 202 place count 200 transition count 295
Iterating global reduction 6 with 5 rules applied. Total rules applied 207 place count 200 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 208 place count 200 transition count 294
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 216 place count 196 transition count 290
Graph (complete) has 640 edges and 196 vertex of which 180 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 217 place count 180 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 225 place count 180 transition count 278
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 229 place count 176 transition count 272
Iterating global reduction 9 with 4 rules applied. Total rules applied 233 place count 176 transition count 272
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 240 place count 176 transition count 265
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 242 place count 174 transition count 262
Iterating global reduction 10 with 2 rules applied. Total rules applied 244 place count 174 transition count 262
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 253 place count 174 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 259 place count 174 transition count 247
Applied a total of 259 rules in 87 ms. Remains 174 /282 variables (removed 108) and now considering 247/445 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 174/282 places, 247/445 transitions.
RANDOM walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 17138 steps (2 resets) in 84 ms. (201 steps per ms) remains 0/1 properties
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 17644 ms.

BK_STOP 1717139601577

--------------------
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="Vasy2003-PT-none"
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 Vasy2003-PT-none, 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 r444-smll-171701111200287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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