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.r356-tall-171683761600695.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 ShieldPPPt-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761600695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 685K 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 ShieldPPPt-PT-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717028277172

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-30 00:17:58] [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-30 00:17:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:17:58] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-30 00:17:58] [INFO ] Transformed 2503 places.
[2024-05-30 00:17:58] [INFO ] Transformed 1803 transitions.
[2024-05-30 00:17:58] [INFO ] Found NUPN structural information;
[2024-05-30 00:17:58] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2750 ms. (14 steps per ms) remains 13/16 properties
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 987 ms. (40 steps per ms) remains 13/13 properties
[2024-05-30 00:18:00] [INFO ] Flatten gal took : 847 ms
BEST_FIRST walk for 40003 steps (8 resets) in 1350 ms. (29 steps per ms) remains 13/13 properties
[2024-05-30 00:18:00] [INFO ] Flatten gal took : 331 ms
[2024-05-30 00:18:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1651544492866832672.gal : 91 ms
[2024-05-30 00:18:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6294493862117877376.prop : 2 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/ReachabilityCardinality1651544492866832672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6294493862117877376.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 40002 steps (8 resets) in 1894 ms. (21 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 830 ms. (48 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality6294493862117877376.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 846 ms. (47 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 553 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 720 ms. (55 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 680 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 763 ms. (52 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 732 ms. (54 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 665 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 594 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 596 ms. (67 steps per ms) remains 13/13 properties
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-30 00:18:03] [INFO ] Computed 1101 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 332/332 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 434/766 variables, 328/660 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 434/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1737/2503 variables, 773/1867 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1737/3604 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1802/4305 variables, 2503/6107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4305 variables, 0/6107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/4305 variables, 0/6107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4305/4305 variables, and 6107 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4503 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 332/332 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 434/766 variables, 328/660 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 434/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1737/2503 variables, 773/1867 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 24
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :24 after 49
Reachability property ShieldPPPt-PT-100A-ReachabilityFireability-2024-03 is true.
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :49 after 99
Invariant property ShieldPPPt-PT-100A-ReachabilityFireability-2024-11 does not hold.
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1737/3604 constraints. Problems are: Problem set: 2 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :99 after 148
Reachability property ShieldPPPt-PT-100A-ReachabilityFireability-2024-05 is true.
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldPPPt-PT-100A-ReachabilityFireability-2024-00 is true.
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :148 after 198
Invariant property ShieldPPPt-PT-100A-ReachabilityFireability-2024-12 does not hold.
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :198 after 247
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :247 after 297
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :297 after 584
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :584 after 58663
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :58663 after 3.29202e+06
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.29202e+06 after 6.0352e+09
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :6.0352e+09 after 2.52314e+18
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3604 constraints. Problems are: Problem set: 5 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2.52314e+18 after 3.81262e+38
At refinement iteration 8 (OVERLAPS) 1802/4305 variables, 2503/6107 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4305 variables, 8/6115 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4305/4305 variables, and 6115 constraints, problems are : Problem set: 5 solved, 8 unsolved in 5011 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 9778ms problems are : Problem set: 5 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 344 times.
Drop transitions (Partial Free agglomeration) removed 344 transitions
Iterating global reduction 0 with 344 rules applied. Total rules applied 348 place count 2501 transition count 1800
Applied a total of 348 rules in 672 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 2501/2503 places, 1800/1802 transitions.
RANDOM walk for 40000 steps (8 resets) in 1559 ms. (25 steps per ms) remains 6/8 properties
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 790 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 922 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 696 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 665 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 655 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 668 ms. (59 steps per ms) remains 6/6 properties
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-30 00:18:15] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-30 00:18:15] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 269/457 variables, 193/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 269/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2044/2501 variables, 908/1558 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2044/3602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 86/6189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 0/6189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/4301 variables, 0/6189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4301/4301 variables, and 6189 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2524 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 269/457 variables, 193/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 269/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2044/2501 variables, 908/1558 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2044/3602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 86/6189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 6/6195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 00:18:21] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 13 ms to minimize.
[2024-05-30 00:18:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-30 00:18:22] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 00:18:22] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-30 00:18:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4301 variables, 5/6200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4301 variables, 0/6200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/4301 variables, 0/6200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4301/4301 variables, and 6200 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9219 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 11823ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 28713 ms.
Support contains 30 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 44 times.
Drop transitions (Partial Free agglomeration) removed 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 2501 transition count 1800
Applied a total of 44 rules in 266 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 2501/2501 places, 1800/1800 transitions.
RANDOM walk for 40000 steps (8 resets) in 1253 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 775 ms. (51 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 121899 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 121899 steps, saw 118475 distinct states, run finished after 3007 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-30 00:19:00] [INFO ] Computed 1101 invariants in 17 ms
[2024-05-30 00:19:00] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 52/82 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2419/2501 variables, 1066/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2419/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 99/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 0/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4301 variables, 0/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4301/4301 variables, and 6202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1283 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 52/82 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2419/2501 variables, 1066/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2419/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 99/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 1/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4301 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4301 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4301/4301 variables, and 6203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2521 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3889ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6210 ms.
Support contains 30 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 98 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 94 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-30 00:19:10] [INFO ] Invariant cache hit.
[2024-05-30 00:19:12] [INFO ] Implicit Places using invariants in 1933 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1946 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 234 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2024-05-30 00:19:12] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-30 00:19:14] [INFO ] Implicit Places using invariants in 2036 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2039 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2495 transition count 1797
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2495 transition count 1797
Applied a total of 2 rules in 187 ms. Remains 2495 /2496 variables (removed 1) and now considering 1797/1798 (removed 1) transitions.
// Phase 1: matrix 1797 rows 2495 cols
[2024-05-30 00:19:14] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-30 00:19:16] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2024-05-30 00:19:16] [INFO ] Invariant cache hit.
[2024-05-30 00:19:17] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-30 00:19:23] [INFO ] Implicit Places using invariants and state equation in 6687 ms returned []
Implicit Place search using SMT with State Equation took 8233 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2495/2501 places, 1797/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 12749 ms. Remains : 2495/2501 places, 1797/1800 transitions.
RANDOM walk for 40000 steps (8 resets) in 1287 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 804 ms. (49 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 128191 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 1
Probabilistic random walk after 128191 steps, saw 123174 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-30 00:19:26] [INFO ] Invariant cache hit.
[2024-05-30 00:19:26] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/80 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2415/2495 variables, 1064/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2495 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1797/4292 variables, 2495/3593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4292 variables, 97/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4292 variables, 0/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4292 variables, 0/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4292/4292 variables, and 3690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2495/2495 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/80 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2415/2495 variables, 1064/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2495 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1797/4292 variables, 2495/3593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4292 variables, 97/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4292 variables, 1/3691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4292 variables, 0/3691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4292 variables, 0/3691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4292/4292 variables, and 3691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1967 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2495/2495 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3176ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2654 steps, including 0 resets, run visited all 1 properties in 52 ms. (steps per millisecond=51 )
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 57 ms.
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 91526 ms.

BK_STOP 1717028369955

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPt-PT-100A"
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 ShieldPPPt-PT-100A, 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 r356-tall-171683761600695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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