About the Execution of ITS-Tools for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.852 | 3600000.00 | 9593517.00 | 249685.10 | ?F?FT?TFTTTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713900703.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713900703
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:23 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-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679224050846
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-100B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 11:07:34] [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]
[2023-03-19 11:07:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:07:34] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2023-03-19 11:07:34] [INFO ] Transformed 7803 places.
[2023-03-19 11:07:34] [INFO ] Transformed 7103 transitions.
[2023-03-19 11:07:34] [INFO ] Found NUPN structural information;
[2023-03-19 11:07:34] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 683 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 11:07:36] [INFO ] Flatten gal took : 453 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 786 ms. (steps per millisecond=12 ) properties (out of 16) seen :2
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
[2023-03-19 11:07:36] [INFO ] Flatten gal took : 217 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
[2023-03-19 11:07:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11685806560808203535.gal : 112 ms
[2023-03-19 11:07:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11578054335876369764.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11685806560808203535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11578054335876369764.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-19 11:07:36] [INFO ] Computed 1101 place invariants in 61 ms
Loading property file /tmp/ReachabilityCardinality11578054335876369764.prop.
[2023-03-19 11:07:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 1140 ms returned sat
[2023-03-19 11:07:41] [INFO ] After 4459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 11:07:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1111 ms returned sat
[2023-03-19 11:08:06] [INFO ] After 18841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 11:08:06] [INFO ] After 18850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 11:08:06] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1784 transitions
Trivial Post-agglo rules discarded 1784 transitions
Performed 1784 trivial Post agglomeration. Transition count delta: 1784
Iterating post reduction 0 with 1784 rules applied. Total rules applied 1784 place count 7803 transition count 5319
Reduce places removed 1784 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1786 rules applied. Total rules applied 3570 place count 6019 transition count 5317
Reduce places removed 1 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 43 rules applied. Total rules applied 3613 place count 6018 transition count 5275
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 3655 place count 5976 transition count 5275
Performed 409 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 409 Pre rules applied. Total rules applied 3655 place count 5976 transition count 4866
Deduced a syphon composed of 409 places in 26 ms
Reduce places removed 409 places and 0 transitions.
Iterating global reduction 4 with 818 rules applied. Total rules applied 4473 place count 5567 transition count 4866
Discarding 666 places :
Symmetric choice reduction at 4 with 666 rule applications. Total rules 5139 place count 4901 transition count 4200
Iterating global reduction 4 with 666 rules applied. Total rules applied 5805 place count 4901 transition count 4200
Performed 261 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 261 Pre rules applied. Total rules applied 5805 place count 4901 transition count 3939
Deduced a syphon composed of 261 places in 48 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 4 with 522 rules applied. Total rules applied 6327 place count 4640 transition count 3939
Performed 1648 Post agglomeration using F-continuation condition.Transition count delta: 1648
Deduced a syphon composed of 1648 places in 10 ms
Reduce places removed 1648 places and 0 transitions.
Iterating global reduction 4 with 3296 rules applied. Total rules applied 9623 place count 2992 transition count 2291
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9825 place count 2891 transition count 2291
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10027 place count 2790 transition count 2291
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 5 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 10151 place count 2728 transition count 2291
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 10162 place count 2728 transition count 2280
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 10173 place count 2717 transition count 2280
Partial Free-agglomeration rule applied 284 times.
Drop transitions removed 284 transitions
Iterating global reduction 5 with 284 rules applied. Total rules applied 10457 place count 2717 transition count 2280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10458 place count 2716 transition count 2279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10459 place count 2715 transition count 2279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10459 place count 2715 transition count 2277
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10463 place count 2713 transition count 2277
Applied a total of 10463 rules in 3581 ms. Remains 2713 /7803 variables (removed 5090) and now considering 2277/7103 (removed 4826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3582 ms. Remains : 2713/7803 places, 2277/7103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :69 after 118
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :118 after 5935
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :5935 after 9.17035e+07
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :9.17035e+07 after 4.01557e+14
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :4.01557e+14 after 4.83162e+30
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :4.83162e+30 after 6.79827e+72
Interrupted probabilistic random walk after 114741 steps, run timeout after 6001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 114741 steps, saw 88242 distinct states, run finished after 6002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 2277 rows 2713 cols
[2023-03-19 11:08:18] [INFO ] Computed 1100 place invariants in 7 ms
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :6.79827e+72 after 7.77253e+197
[2023-03-19 11:08:19] [INFO ] [Real]Absence check using 1100 positive place invariants in 275 ms returned sat
[2023-03-19 11:08:19] [INFO ] After 1438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 11:08:20] [INFO ] [Nat]Absence check using 1100 positive place invariants in 259 ms returned sat
[2023-03-19 11:08:24] [INFO ] After 3061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 11:08:24] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-19 11:08:27] [INFO ] After 3396ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-19 11:08:28] [INFO ] Deduced a trap composed of 3 places in 410 ms of which 6 ms to minimize.
[2023-03-19 11:08:29] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2023-03-19 11:08:29] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2023-03-19 11:08:29] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 1 ms to minimize.
[2023-03-19 11:08:30] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2023-03-19 11:08:30] [INFO ] Deduced a trap composed of 3 places in 340 ms of which 1 ms to minimize.
[2023-03-19 11:08:31] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 2 ms to minimize.
[2023-03-19 11:08:31] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 2 ms to minimize.
[2023-03-19 11:08:32] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2023-03-19 11:08:32] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 1 ms to minimize.
[2023-03-19 11:08:33] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 1 ms to minimize.
[2023-03-19 11:08:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5159 ms
[2023-03-19 11:08:33] [INFO ] Deduced a trap composed of 8 places in 369 ms of which 0 ms to minimize.
[2023-03-19 11:08:34] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2023-03-19 11:08:34] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 1 ms to minimize.
[2023-03-19 11:08:35] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 1 ms to minimize.
[2023-03-19 11:08:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2012 ms
[2023-03-19 11:08:36] [INFO ] Deduced a trap composed of 9 places in 387 ms of which 1 ms to minimize.
[2023-03-19 11:08:36] [INFO ] Deduced a trap composed of 8 places in 384 ms of which 1 ms to minimize.
[2023-03-19 11:08:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1278 ms
[2023-03-19 11:08:38] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2023-03-19 11:08:38] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2023-03-19 11:08:39] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 1 ms to minimize.
[2023-03-19 11:08:39] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2023-03-19 11:08:39] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2023-03-19 11:08:40] [INFO ] Deduced a trap composed of 9 places in 354 ms of which 1 ms to minimize.
[2023-03-19 11:08:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2968 ms
[2023-03-19 11:08:42] [INFO ] Deduced a trap composed of 5 places in 1041 ms of which 2 ms to minimize.
[2023-03-19 11:08:43] [INFO ] Deduced a trap composed of 5 places in 1068 ms of which 2 ms to minimize.
[2023-03-19 11:08:45] [INFO ] Deduced a trap composed of 5 places in 1076 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 11:08:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:08:45] [INFO ] After 25390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Parikh walk visited 0 properties in 1087 ms.
Support contains 169 out of 2713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 2277/2277 transitions.
Applied a total of 0 rules in 105 ms. Remains 2713 /2713 variables (removed 0) and now considering 2277/2277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2713/2713 places, 2277/2277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 2277/2277 transitions.
Applied a total of 0 rules in 146 ms. Remains 2713 /2713 variables (removed 0) and now considering 2277/2277 (removed 0) transitions.
[2023-03-19 11:08:46] [INFO ] Invariant cache hit.
[2023-03-19 11:08:48] [INFO ] Implicit Places using invariants in 2151 ms returned [2695, 2699]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2156 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2711/2713 places, 2277/2277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2709 transition count 2275
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2709 transition count 2275
Applied a total of 4 rules in 228 ms. Remains 2709 /2711 variables (removed 2) and now considering 2275/2277 (removed 2) transitions.
// Phase 1: matrix 2275 rows 2709 cols
[2023-03-19 11:08:48] [INFO ] Computed 1098 place invariants in 14 ms
[2023-03-19 11:08:50] [INFO ] Implicit Places using invariants in 1952 ms returned []
[2023-03-19 11:08:50] [INFO ] Invariant cache hit.
[2023-03-19 11:08:52] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-19 11:09:01] [INFO ] Implicit Places using invariants and state equation in 10961 ms returned []
Implicit Place search using SMT with State Equation took 12920 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2709/2713 places, 2275/2277 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15451 ms. Remains : 2709/2713 places, 2275/2277 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 96318 steps, run timeout after 6001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 96318 steps, saw 72492 distinct states, run finished after 6001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-19 11:09:10] [INFO ] Invariant cache hit.
[2023-03-19 11:09:11] [INFO ] [Real]Absence check using 1098 positive place invariants in 349 ms returned sat
[2023-03-19 11:09:11] [INFO ] After 1485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 11:09:13] [INFO ] [Nat]Absence check using 1098 positive place invariants in 288 ms returned sat
[2023-03-19 11:09:18] [INFO ] After 3459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 11:09:18] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-19 11:09:21] [INFO ] After 3617ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-19 11:09:22] [INFO ] Deduced a trap composed of 3 places in 455 ms of which 1 ms to minimize.
[2023-03-19 11:09:22] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 1 ms to minimize.
[2023-03-19 11:09:23] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 1 ms to minimize.
[2023-03-19 11:09:23] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 0 ms to minimize.
[2023-03-19 11:09:24] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2023-03-19 11:09:24] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 1 ms to minimize.
[2023-03-19 11:09:25] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 0 ms to minimize.
[2023-03-19 11:09:25] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 4 ms to minimize.
[2023-03-19 11:09:26] [INFO ] Deduced a trap composed of 6 places in 409 ms of which 1 ms to minimize.
[2023-03-19 11:09:26] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2023-03-19 11:09:26] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2023-03-19 11:09:27] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 1 ms to minimize.
[2023-03-19 11:09:27] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-19 11:09:28] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2023-03-19 11:09:28] [INFO ] Deduced a trap composed of 5 places in 394 ms of which 1 ms to minimize.
[2023-03-19 11:09:29] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 1 ms to minimize.
[2023-03-19 11:09:29] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2023-03-19 11:09:29] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7966 ms
[2023-03-19 11:09:30] [INFO ] Deduced a trap composed of 6 places in 485 ms of which 1 ms to minimize.
[2023-03-19 11:09:31] [INFO ] Deduced a trap composed of 9 places in 566 ms of which 1 ms to minimize.
[2023-03-19 11:09:31] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 1 ms to minimize.
[2023-03-19 11:09:32] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 1 ms to minimize.
[2023-03-19 11:09:32] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 0 ms to minimize.
[2023-03-19 11:09:33] [INFO ] Deduced a trap composed of 9 places in 374 ms of which 1 ms to minimize.
[2023-03-19 11:09:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3462 ms
[2023-03-19 11:09:34] [INFO ] Deduced a trap composed of 7 places in 419 ms of which 1 ms to minimize.
[2023-03-19 11:09:35] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 2 ms to minimize.
[2023-03-19 11:09:36] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2023-03-19 11:09:36] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 1 ms to minimize.
[2023-03-19 11:09:37] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 11:09:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:09:37] [INFO ] After 25280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Parikh walk visited 0 properties in 1288 ms.
Support contains 169 out of 2709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2275/2275 transitions.
Applied a total of 0 rules in 108 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 2709/2709 places, 2275/2275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2275/2275 transitions.
Applied a total of 0 rules in 106 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
[2023-03-19 11:09:38] [INFO ] Invariant cache hit.
[2023-03-19 11:09:41] [INFO ] Implicit Places using invariants in 2492 ms returned []
[2023-03-19 11:09:41] [INFO ] Invariant cache hit.
[2023-03-19 11:09:43] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-19 11:09:54] [INFO ] Implicit Places using invariants and state equation in 13190 ms returned []
Implicit Place search using SMT with State Equation took 15699 ms to find 0 implicit places.
[2023-03-19 11:09:54] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-19 11:09:54] [INFO ] Invariant cache hit.
[2023-03-19 11:09:56] [INFO ] Dead Transitions using invariants and state equation in 2236 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18193 ms. Remains : 2709/2709 places, 2275/2275 transitions.
Partial Free-agglomeration rule applied 536 times.
Drop transitions removed 536 transitions
Iterating global reduction 0 with 536 rules applied. Total rules applied 536 place count 2709 transition count 2275
Applied a total of 536 rules in 304 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 2275 rows 2709 cols
[2023-03-19 11:09:57] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 11:09:58] [INFO ] [Real]Absence check using 1098 positive place invariants in 294 ms returned sat
[2023-03-19 11:09:58] [INFO ] After 1542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 11:10:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 290 ms returned sat
[2023-03-19 11:10:04] [INFO ] After 3581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 11:10:04] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-19 11:10:14] [INFO ] After 9682ms SMT Verify possible using 494 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-19 11:10:15] [INFO ] Deduced a trap composed of 7 places in 780 ms of which 2 ms to minimize.
[2023-03-19 11:10:16] [INFO ] Deduced a trap composed of 7 places in 645 ms of which 12 ms to minimize.
[2023-03-19 11:10:17] [INFO ] Deduced a trap composed of 6 places in 676 ms of which 3 ms to minimize.
[2023-03-19 11:10:18] [INFO ] Deduced a trap composed of 7 places in 762 ms of which 2 ms to minimize.
[2023-03-19 11:10:19] [INFO ] Deduced a trap composed of 8 places in 747 ms of which 1 ms to minimize.
[2023-03-19 11:10:19] [INFO ] Deduced a trap composed of 7 places in 646 ms of which 2 ms to minimize.
[2023-03-19 11:10:20] [INFO ] Deduced a trap composed of 8 places in 710 ms of which 1 ms to minimize.
[2023-03-19 11:10:21] [INFO ] Deduced a trap composed of 8 places in 741 ms of which 2 ms to minimize.
[2023-03-19 11:10:22] [INFO ] Deduced a trap composed of 7 places in 741 ms of which 3 ms to minimize.
[2023-03-19 11:10:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 8037 ms
[2023-03-19 11:10:23] [INFO ] Deduced a trap composed of 8 places in 742 ms of which 3 ms to minimize.
[2023-03-19 11:10:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1035 ms
[2023-03-19 11:10:25] [INFO ] Deduced a trap composed of 5 places in 672 ms of which 1 ms to minimize.
[2023-03-19 11:10:25] [INFO ] Deduced a trap composed of 8 places in 720 ms of which 2 ms to minimize.
[2023-03-19 11:10:26] [INFO ] Deduced a trap composed of 6 places in 743 ms of which 2 ms to minimize.
[2023-03-19 11:10:27] [INFO ] Deduced a trap composed of 8 places in 664 ms of which 15 ms to minimize.
[2023-03-19 11:10:28] [INFO ] Deduced a trap composed of 21 places in 715 ms of which 2 ms to minimize.
[2023-03-19 11:10:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4553 ms
[2023-03-19 11:10:30] [INFO ] Deduced a trap composed of 6 places in 599 ms of which 2 ms to minimize.
[2023-03-19 11:10:30] [INFO ] Deduced a trap composed of 5 places in 693 ms of which 2 ms to minimize.
[2023-03-19 11:10:31] [INFO ] Deduced a trap composed of 5 places in 618 ms of which 1 ms to minimize.
[2023-03-19 11:10:32] [INFO ] Deduced a trap composed of 8 places in 640 ms of which 2 ms to minimize.
[2023-03-19 11:10:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3339 ms
[2023-03-19 11:10:33] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 2 ms to minimize.
[2023-03-19 11:10:34] [INFO ] Deduced a trap composed of 7 places in 629 ms of which 2 ms to minimize.
[2023-03-19 11:10:35] [INFO ] Deduced a trap composed of 5 places in 586 ms of which 1 ms to minimize.
[2023-03-19 11:10:36] [INFO ] Deduced a trap composed of 7 places in 684 ms of which 1 ms to minimize.
[2023-03-19 11:10:36] [INFO ] Deduced a trap composed of 12 places in 604 ms of which 1 ms to minimize.
[2023-03-19 11:10:37] [INFO ] Deduced a trap composed of 9 places in 584 ms of which 1 ms to minimize.
[2023-03-19 11:10:38] [INFO ] Deduced a trap composed of 7 places in 660 ms of which 2 ms to minimize.
[2023-03-19 11:10:39] [INFO ] Deduced a trap composed of 10 places in 655 ms of which 2 ms to minimize.
[2023-03-19 11:10:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6541 ms
[2023-03-19 11:10:41] [INFO ] Deduced a trap composed of 5 places in 621 ms of which 1 ms to minimize.
[2023-03-19 11:10:41] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 1 ms to minimize.
[2023-03-19 11:10:42] [INFO ] Deduced a trap composed of 7 places in 562 ms of which 1 ms to minimize.
[2023-03-19 11:10:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2403 ms
[2023-03-19 11:10:44] [INFO ] Deduced a trap composed of 7 places in 634 ms of which 1 ms to minimize.
[2023-03-19 11:10:44] [INFO ] Deduced a trap composed of 14 places in 534 ms of which 1 ms to minimize.
[2023-03-19 11:10:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1540 ms
[2023-03-19 11:10:45] [INFO ] Deduced a trap composed of 5 places in 591 ms of which 2 ms to minimize.
[2023-03-19 11:10:46] [INFO ] Deduced a trap composed of 6 places in 525 ms of which 2 ms to minimize.
[2023-03-19 11:10:47] [INFO ] Deduced a trap composed of 6 places in 612 ms of which 1 ms to minimize.
[2023-03-19 11:10:47] [INFO ] Deduced a trap composed of 10 places in 532 ms of which 2 ms to minimize.
[2023-03-19 11:10:48] [INFO ] Deduced a trap composed of 7 places in 539 ms of which 1 ms to minimize.
[2023-03-19 11:10:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3530 ms
[2023-03-19 11:10:56] [INFO ] Deduced a trap composed of 7 places in 709 ms of which 1 ms to minimize.
[2023-03-19 11:10:56] [INFO ] Deduced a trap composed of 9 places in 588 ms of which 1 ms to minimize.
[2023-03-19 11:10:57] [INFO ] Deduced a trap composed of 7 places in 648 ms of which 1 ms to minimize.
[2023-03-19 11:10:58] [INFO ] Deduced a trap composed of 7 places in 608 ms of which 1 ms to minimize.
[2023-03-19 11:10:59] [INFO ] Deduced a trap composed of 8 places in 751 ms of which 1 ms to minimize.
[2023-03-19 11:11:00] [INFO ] Deduced a trap composed of 8 places in 729 ms of which 2 ms to minimize.
[2023-03-19 11:11:01] [INFO ] Deduced a trap composed of 8 places in 617 ms of which 1 ms to minimize.
[2023-03-19 11:11:02] [INFO ] Deduced a trap composed of 8 places in 694 ms of which 2 ms to minimize.
[2023-03-19 11:11:02] [INFO ] Deduced a trap composed of 12 places in 669 ms of which 1 ms to minimize.
[2023-03-19 11:11:03] [INFO ] Deduced a trap composed of 16 places in 612 ms of which 1 ms to minimize.
[2023-03-19 11:11:04] [INFO ] Deduced a trap composed of 9 places in 664 ms of which 1 ms to minimize.
[2023-03-19 11:11:05] [INFO ] Deduced a trap composed of 8 places in 652 ms of which 2 ms to minimize.
[2023-03-19 11:11:06] [INFO ] Deduced a trap composed of 8 places in 629 ms of which 2 ms to minimize.
[2023-03-19 11:11:07] [INFO ] Deduced a trap composed of 11 places in 670 ms of which 2 ms to minimize.
[2023-03-19 11:11:08] [INFO ] Deduced a trap composed of 10 places in 743 ms of which 1 ms to minimize.
[2023-03-19 11:11:09] [INFO ] Deduced a trap composed of 9 places in 720 ms of which 2 ms to minimize.
[2023-03-19 11:11:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 14095 ms
[2023-03-19 11:11:10] [INFO ] Deduced a trap composed of 6 places in 694 ms of which 1 ms to minimize.
[2023-03-19 11:11:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 994 ms
[2023-03-19 11:11:10] [INFO ] After 65884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 7946 ms.
[2023-03-19 11:11:18] [INFO ] After 80010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 11:11:18] [INFO ] Flatten gal took : 212 ms
[2023-03-19 11:11:18] [INFO ] Applying decomposition
[2023-03-19 11:11:19] [INFO ] Flatten gal took : 180 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8276269545526307670.txt' '-o' '/tmp/graph8276269545526307670.bin' '-w' '/tmp/graph8276269545526307670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8276269545526307670.bin' '-l' '-1' '-v' '-w' '/tmp/graph8276269545526307670.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:11:19] [INFO ] Decomposing Gal with order
[2023-03-19 11:11:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:11:22] [INFO ] Removed a total of 601 redundant transitions.
[2023-03-19 11:11:23] [INFO ] Flatten gal took : 409 ms
[2023-03-19 11:11:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2023-03-19 11:11:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5072443672457548981.gal : 72 ms
[2023-03-19 11:11:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2588071527092412901.prop : 1 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5072443672457548981.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2588071527092412901.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2588071527092412901.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :648916 after 4.50816e+11
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :4.50816e+11 after 1.25646e+216
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :1.25646e+216 after 1.6059e+295
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 11:41:26] [INFO ] Flatten gal took : 1024 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5943439079647375396
[2023-03-19 11:41:27] [INFO ] Too many transitions (2275) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:41:27] [INFO ] Applying decomposition
[2023-03-19 11:41:27] [INFO ] Built C files in 498ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5943439079647375396
Running compilation step : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '51' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 11:41:28] [INFO ] Flatten gal took : 689 ms
Compilation finished in 5561 ms.
Running link step : cd /tmp/ltsmin5943439079647375396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18153645907972333672.txt' '-o' '/tmp/graph18153645907972333672.bin' '-w' '/tmp/graph18153645907972333672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18153645907972333672.bin' '-l' '-1' '-v' '-w' '/tmp/graph18153645907972333672.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:41:33] [INFO ] Decomposing Gal with order
Link finished in 122 ms.
Running LTSmin : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability00==true'
[2023-03-19 11:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:41:34] [INFO ] Removed a total of 1308 redundant transitions.
[2023-03-19 11:41:34] [INFO ] Flatten gal took : 388 ms
[2023-03-19 11:41:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 554 labels/synchronizations in 97 ms.
[2023-03-19 11:41:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3956811175459519804.gal : 34 ms
[2023-03-19 11:41:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4981242232716709323.prop : 4 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3956811175459519804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4981242232716709323.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability4981242232716709323.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :6 after 34
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :34 after 1202
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :1202 after 21602
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :21602 after 1.11081e+17
WARNING : LTSmin timed out (>257 s) on command cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability01==true'
WARNING : LTSmin timed out (>257 s) on command cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability02==true'
WARNING : LTSmin timed out (>257 s) on command cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability02==true'
Running LTSmin : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability03==true'
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-15 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-12 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-11 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-10 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-09 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-08 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>257 s) on command cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability03==true'
Running LTSmin : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability04==true'
WARNING : LTSmin timed out (>257 s) on command cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability04==true'
Running LTSmin : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability05==true'
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-07 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-06 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityFireability-04 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-03 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-01 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.5836e+22 after 4.9113e+298
WARNING : LTSmin timed out (>257 s) on command cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability05==true'
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : cd /tmp/ltsmin5943439079647375396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability00==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8015888 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16133756 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-100B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-100B, 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 r389-oct2-167903713900703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B 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 '
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 ;