Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025300511.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.2K Apr 30 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 30 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 30 03:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 03:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 888K May 10 09:34 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 ShieldPPPs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654273106703

Running Version 202205111006
[2022-06-03 16:18:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 16:18:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:18:28] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2022-06-03 16:18:28] [INFO ] Transformed 3403 places.
[2022-06-03 16:18:28] [INFO ] Transformed 3153 transitions.
[2022-06-03 16:18:28] [INFO ] Found NUPN structural information;
[2022-06-03 16:18:28] [INFO ] Parsed PT model containing 3403 places and 3153 transitions in 454 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 16) seen :8
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2022-06-03 16:18:29] [INFO ] Computed 551 place invariants in 48 ms
[2022-06-03 16:18:30] [INFO ] [Real]Absence check using 551 positive place invariants in 219 ms returned sat
[2022-06-03 16:18:30] [INFO ] After 1413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 16:18:31] [INFO ] [Nat]Absence check using 551 positive place invariants in 231 ms returned sat
[2022-06-03 16:18:34] [INFO ] After 2626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 16:18:36] [INFO ] Deduced a trap composed of 25 places in 1055 ms of which 8 ms to minimize.
[2022-06-03 16:18:37] [INFO ] Deduced a trap composed of 32 places in 1027 ms of which 5 ms to minimize.
[2022-06-03 16:18:38] [INFO ] Deduced a trap composed of 19 places in 1014 ms of which 3 ms to minimize.
[2022-06-03 16:18:39] [INFO ] Deduced a trap composed of 18 places in 981 ms of which 3 ms to minimize.
[2022-06-03 16:18:40] [INFO ] Deduced a trap composed of 23 places in 940 ms of which 3 ms to minimize.
[2022-06-03 16:18:41] [INFO ] Deduced a trap composed of 25 places in 970 ms of which 2 ms to minimize.
[2022-06-03 16:18:42] [INFO ] Deduced a trap composed of 23 places in 986 ms of which 2 ms to minimize.
[2022-06-03 16:18:43] [INFO ] Deduced a trap composed of 22 places in 936 ms of which 2 ms to minimize.
[2022-06-03 16:18:44] [INFO ] Deduced a trap composed of 22 places in 979 ms of which 2 ms to minimize.
[2022-06-03 16:18:45] [INFO ] Deduced a trap composed of 28 places in 914 ms of which 1 ms to minimize.
[2022-06-03 16:18:46] [INFO ] Deduced a trap composed of 27 places in 908 ms of which 1 ms to minimize.
[2022-06-03 16:18:47] [INFO ] Deduced a trap composed of 30 places in 877 ms of which 2 ms to minimize.
[2022-06-03 16:18:49] [INFO ] Deduced a trap composed of 30 places in 918 ms of which 2 ms to minimize.
[2022-06-03 16:18:50] [INFO ] Deduced a trap composed of 49 places in 897 ms of which 2 ms to minimize.
[2022-06-03 16:18:51] [INFO ] Deduced a trap composed of 29 places in 877 ms of which 1 ms to minimize.
[2022-06-03 16:18:52] [INFO ] Deduced a trap composed of 36 places in 841 ms of which 2 ms to minimize.
[2022-06-03 16:18:52] [INFO ] Deduced a trap composed of 25 places in 805 ms of which 1 ms to minimize.
[2022-06-03 16:18:53] [INFO ] Deduced a trap composed of 29 places in 794 ms of which 1 ms to minimize.
[2022-06-03 16:18:54] [INFO ] Deduced a trap composed of 23 places in 765 ms of which 2 ms to minimize.
[2022-06-03 16:18:55] [INFO ] Deduced a trap composed of 30 places in 698 ms of which 3 ms to minimize.
[2022-06-03 16:18:56] [INFO ] Deduced a trap composed of 40 places in 726 ms of which 1 ms to minimize.
[2022-06-03 16:18:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:18:56] [INFO ] After 25562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 30967 ms.
Support contains 65 out of 3403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 3403 transition count 2822
Reduce places removed 331 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 338 rules applied. Total rules applied 669 place count 3072 transition count 2815
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 676 place count 3065 transition count 2815
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 676 place count 3065 transition count 2564
Deduced a syphon composed of 251 places in 62 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1178 place count 2814 transition count 2564
Discarding 342 places :
Symmetric choice reduction at 3 with 342 rule applications. Total rules 1520 place count 2472 transition count 2222
Iterating global reduction 3 with 342 rules applied. Total rules applied 1862 place count 2472 transition count 2222
Performed 137 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 137 Pre rules applied. Total rules applied 1862 place count 2472 transition count 2085
Deduced a syphon composed of 137 places in 17 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 2136 place count 2335 transition count 2085
Performed 731 Post agglomeration using F-continuation condition.Transition count delta: 731
Deduced a syphon composed of 731 places in 2 ms
Reduce places removed 731 places and 0 transitions.
Iterating global reduction 3 with 1462 rules applied. Total rules applied 3598 place count 1604 transition count 1354
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 423 times.
Drop transitions removed 423 transitions
Iterating global reduction 3 with 423 rules applied. Total rules applied 4021 place count 1604 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4022 place count 1603 transition count 1353
Applied a total of 4022 rules in 1200 ms. Remains 1603 /3403 variables (removed 1800) and now considering 1353/3153 (removed 1800) transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/3403 places, 1353/3153 transitions.
Incomplete random walk after 1000000 steps, including 119 resets, run finished after 11988 ms. (steps per millisecond=83 ) properties (out of 8) seen :7
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 728550 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=145 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 1353 rows 1603 cols
[2022-06-03 16:19:45] [INFO ] Computed 551 place invariants in 58 ms
[2022-06-03 16:19:45] [INFO ] [Real]Absence check using 523 positive place invariants in 86 ms returned sat
[2022-06-03 16:19:45] [INFO ] [Real]Absence check using 523 positive and 28 generalized place invariants in 5 ms returned sat
[2022-06-03 16:19:46] [INFO ] After 963ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:19:46] [INFO ] [Nat]Absence check using 523 positive place invariants in 85 ms returned sat
[2022-06-03 16:19:46] [INFO ] [Nat]Absence check using 523 positive and 28 generalized place invariants in 5 ms returned sat
[2022-06-03 16:19:48] [INFO ] After 2062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:19:52] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2022-06-03 16:19:52] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2022-06-03 16:19:52] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2022-06-03 16:19:53] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2022-06-03 16:19:53] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2022-06-03 16:19:53] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2022-06-03 16:19:53] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2022-06-03 16:19:53] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2022-06-03 16:19:54] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2022-06-03 16:19:54] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2022-06-03 16:19:54] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2022-06-03 16:19:54] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2022-06-03 16:19:55] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 2 ms to minimize.
[2022-06-03 16:19:55] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2022-06-03 16:19:55] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2022-06-03 16:19:55] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2022-06-03 16:19:56] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2022-06-03 16:19:56] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2022-06-03 16:19:56] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2022-06-03 16:19:56] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2022-06-03 16:19:56] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2022-06-03 16:19:57] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2022-06-03 16:19:57] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-06-03 16:19:57] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2022-06-03 16:19:57] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2022-06-03 16:19:57] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2022-06-03 16:19:58] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2022-06-03 16:19:58] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-06-03 16:19:58] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-06-03 16:19:58] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2022-06-03 16:19:58] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-06-03 16:19:59] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2022-06-03 16:19:59] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2022-06-03 16:19:59] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-06-03 16:19:59] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2022-06-03 16:19:59] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-06-03 16:20:00] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-06-03 16:20:00] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2022-06-03 16:20:00] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2022-06-03 16:20:00] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2022-06-03 16:20:01] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2022-06-03 16:20:01] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2022-06-03 16:20:01] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-06-03 16:20:01] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2022-06-03 16:20:01] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2022-06-03 16:20:02] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2022-06-03 16:20:02] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-06-03 16:20:02] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2022-06-03 16:20:02] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2022-06-03 16:20:02] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2022-06-03 16:20:03] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2022-06-03 16:20:03] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2022-06-03 16:20:03] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2022-06-03 16:20:04] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-06-03 16:20:04] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-06-03 16:20:04] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-06-03 16:20:04] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-06-03 16:20:04] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-06-03 16:20:05] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2022-06-03 16:20:05] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-06-03 16:20:05] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2022-06-03 16:20:05] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2022-06-03 16:20:06] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2022-06-03 16:20:06] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2022-06-03 16:20:06] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2022-06-03 16:20:06] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2022-06-03 16:20:06] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2022-06-03 16:20:07] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2022-06-03 16:20:07] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2022-06-03 16:20:07] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2022-06-03 16:20:07] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 15408 ms
[2022-06-03 16:20:07] [INFO ] After 20666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 681 ms.
[2022-06-03 16:20:08] [INFO ] After 21636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1642 ms.
Support contains 10 out of 1603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1603/1603 places, 1353/1353 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1603 transition count 1346
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1596 transition count 1346
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 1596 transition count 1339
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 1589 transition count 1339
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 74 place count 1566 transition count 1316
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 1566 transition count 1316
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 1563 transition count 1313
Applied a total of 88 rules in 249 ms. Remains 1563 /1603 variables (removed 40) and now considering 1313/1353 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 1563/1603 places, 1313/1353 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10593 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 752239 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Interrupted probabilistic random walk after 2190453 steps, run timeout after 45536 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 2190453 steps, saw 1930624 distinct states, run finished after 45537 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:21:11] [INFO ] Computed 551 place invariants in 35 ms
[2022-06-03 16:21:11] [INFO ] [Real]Absence check using 522 positive place invariants in 85 ms returned sat
[2022-06-03 16:21:11] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-03 16:21:12] [INFO ] After 946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:21:12] [INFO ] [Nat]Absence check using 522 positive place invariants in 88 ms returned sat
[2022-06-03 16:21:12] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-03 16:21:13] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:21:15] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-06-03 16:21:17] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-06-03 16:21:17] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2022-06-03 16:21:17] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-03 16:21:18] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2022-06-03 16:21:18] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2022-06-03 16:21:18] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-06-03 16:21:18] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2022-06-03 16:21:18] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2022-06-03 16:21:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-06-03 16:21:18] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-06-03 16:21:19] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2022-06-03 16:21:19] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2022-06-03 16:21:19] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-06-03 16:21:19] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2022-06-03 16:21:19] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2022-06-03 16:21:20] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-06-03 16:21:20] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2022-06-03 16:21:20] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:21:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5200 ms
[2022-06-03 16:21:20] [INFO ] After 8447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 789 ms.
[2022-06-03 16:21:21] [INFO ] After 9519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1566 ms.
Support contains 10 out of 1563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1563/1563 places, 1313/1313 transitions.
Applied a total of 0 rules in 62 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1563/1563 places, 1313/1313 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1563/1563 places, 1313/1313 transitions.
Applied a total of 0 rules in 55 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:21:23] [INFO ] Computed 551 place invariants in 14 ms
[2022-06-03 16:21:24] [INFO ] Implicit Places using invariants in 874 ms returned []
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:21:24] [INFO ] Computed 551 place invariants in 10 ms
[2022-06-03 16:21:26] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2907 ms to find 0 implicit places.
[2022-06-03 16:21:26] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:21:26] [INFO ] Computed 551 place invariants in 9 ms
[2022-06-03 16:21:27] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1563/1563 places, 1313/1313 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10899 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 745085 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 0
Interrupted probabilistic random walk after 2260241 steps, run timeout after 45001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 2260241 steps, saw 1991731 distinct states, run finished after 45001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:22:28] [INFO ] Computed 551 place invariants in 13 ms
[2022-06-03 16:22:28] [INFO ] [Real]Absence check using 522 positive place invariants in 83 ms returned sat
[2022-06-03 16:22:28] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-03 16:22:29] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:22:29] [INFO ] [Nat]Absence check using 522 positive place invariants in 83 ms returned sat
[2022-06-03 16:22:29] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-03 16:22:30] [INFO ] After 1152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:22:32] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2022-06-03 16:22:34] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-06-03 16:22:34] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2022-06-03 16:22:34] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-06-03 16:22:34] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2022-06-03 16:22:34] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2022-06-03 16:22:35] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2022-06-03 16:22:35] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2022-06-03 16:22:35] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-06-03 16:22:35] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-06-03 16:22:35] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:22:35] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2022-06-03 16:22:35] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2022-06-03 16:22:36] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-06-03 16:22:36] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-03 16:22:36] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2022-06-03 16:22:36] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2022-06-03 16:22:37] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2022-06-03 16:22:37] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2022-06-03 16:22:37] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5127 ms
[2022-06-03 16:22:37] [INFO ] After 8279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 782 ms.
[2022-06-03 16:22:38] [INFO ] After 9335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1522 ms.
Support contains 10 out of 1563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1563/1563 places, 1313/1313 transitions.
Applied a total of 0 rules in 53 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1563/1563 places, 1313/1313 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1563/1563 places, 1313/1313 transitions.
Applied a total of 0 rules in 52 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:22:40] [INFO ] Computed 551 place invariants in 17 ms
[2022-06-03 16:22:40] [INFO ] Implicit Places using invariants in 834 ms returned []
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:22:40] [INFO ] Computed 551 place invariants in 9 ms
[2022-06-03 16:22:42] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 2793 ms to find 0 implicit places.
[2022-06-03 16:22:42] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:22:42] [INFO ] Computed 551 place invariants in 13 ms
[2022-06-03 16:22:43] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1563/1563 places, 1313/1313 transitions.
Applied a total of 0 rules in 55 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:22:43] [INFO ] Computed 551 place invariants in 14 ms
[2022-06-03 16:22:43] [INFO ] [Real]Absence check using 522 positive place invariants in 83 ms returned sat
[2022-06-03 16:22:43] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 6 ms returned sat
[2022-06-03 16:22:44] [INFO ] After 907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:22:44] [INFO ] [Nat]Absence check using 522 positive place invariants in 79 ms returned sat
[2022-06-03 16:22:44] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 4 ms returned sat
[2022-06-03 16:22:45] [INFO ] After 1110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:22:47] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-06-03 16:22:49] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-06-03 16:22:49] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-06-03 16:22:49] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-06-03 16:22:50] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-06-03 16:22:51] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-06-03 16:22:51] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-06-03 16:22:51] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-06-03 16:22:51] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-06-03 16:22:51] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2022-06-03 16:22:52] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-06-03 16:22:52] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2022-06-03 16:22:52] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:22:52] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5190 ms
[2022-06-03 16:22:53] [INFO ] After 8249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 805 ms.
[2022-06-03 16:22:53] [INFO ] After 9323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 16:22:54] [INFO ] Flatten gal took : 196 ms
[2022-06-03 16:22:54] [INFO ] Flatten gal took : 107 ms
[2022-06-03 16:22:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality866759308415523573.gal : 31 ms
[2022-06-03 16:22:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4486078491020675941.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality866759308415523573.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4486078491020675941.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality4486078491020675941.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 3300
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3300 after 4721
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4721 after 8544
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8544 after 367989
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :367989 after 1.86027e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.86027e+06 after 1.06309e+08
Detected timeout of ITS tools.
[2022-06-03 16:23:09] [INFO ] Flatten gal took : 84 ms
[2022-06-03 16:23:09] [INFO ] Applying decomposition
[2022-06-03 16:23:09] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8196888324553418343.txt' '-o' '/tmp/graph8196888324553418343.bin' '-w' '/tmp/graph8196888324553418343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8196888324553418343.bin' '-l' '-1' '-v' '-w' '/tmp/graph8196888324553418343.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:23:09] [INFO ] Decomposing Gal with order
[2022-06-03 16:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:23:10] [INFO ] Removed a total of 698 redundant transitions.
[2022-06-03 16:23:10] [INFO ] Flatten gal took : 178 ms
[2022-06-03 16:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1219 labels/synchronizations in 94 ms.
[2022-06-03 16:23:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10357439315891715948.gal : 21 ms
[2022-06-03 16:23:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1895197978501448722.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10357439315891715948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1895197978501448722.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality1895197978501448722.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 75
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13817412694708853815
[2022-06-03 16:23:25] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13817412694708853815
Running compilation step : cd /tmp/ltsmin13817412694708853815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2756 ms.
Running link step : cd /tmp/ltsmin13817412694708853815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13817412694708853815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPsPT050BReachabilityFireability14==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 16:23:40] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8408737653354222908
[2022-06-03 16:23:40] [INFO ] Computing symmetric may disable matrix : 1313 transitions.
[2022-06-03 16:23:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:23:40] [INFO ] Computing symmetric may enable matrix : 1313 transitions.
[2022-06-03 16:23:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:23:40] [INFO ] Applying decomposition
[2022-06-03 16:23:40] [INFO ] Flatten gal took : 75 ms
[2022-06-03 16:23:40] [INFO ] Input system was already deterministic with 1313 transitions.
[2022-06-03 16:23:40] [INFO ] Flatten gal took : 144 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1178437435886097542.txt' '-o' '/tmp/graph1178437435886097542.bin' '-w' '/tmp/graph1178437435886097542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1178437435886097542.bin' '-l' '-1' '-v' '-w' '/tmp/graph1178437435886097542.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:23:40] [INFO ] Decomposing Gal with order
[2022-06-03 16:23:40] [INFO ] Computing Do-Not-Accords matrix : 1313 transitions.
[2022-06-03 16:23:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:23:41] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:23:41] [INFO ] Built C files in 430ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8408737653354222908
Running compilation step : cd /tmp/ltsmin8408737653354222908;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 16:23:41] [INFO ] Removed a total of 673 redundant transitions.
[2022-06-03 16:23:41] [INFO ] Flatten gal took : 198 ms
[2022-06-03 16:23:41] [INFO ] Ran tautology test, simplified 0 / 1 in 663 ms.
[2022-06-03 16:23:41] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=0 took 32 ms
[2022-06-03 16:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1296 labels/synchronizations in 130 ms.
[2022-06-03 16:23:41] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=1 took 5 ms
[2022-06-03 16:23:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9846651133474105960.gal : 24 ms
[2022-06-03 16:23:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15408733792818719277.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9846651133474105960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15408733792818719277.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability15408733792818719277.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-03 16:23:42] [INFO ] Computed 551 place invariants in 9 ms
[2022-06-03 16:23:42] [INFO ] Computed 551 place invariants in 22 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13 after 5.43512e+07
[2022-06-03 16:23:45] [INFO ] Proved 1563 variables to be positive in 3141 ms
[2022-06-03 16:23:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-050B-ReachabilityFireability-14
[2022-06-03 16:23:45] [INFO ] KInduction solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(SAT) depth K=0 took 757 ms
Compilation finished in 5073 ms.
Running link step : cd /tmp/ltsmin8408737653354222908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin8408737653354222908;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT050BReachabilityFireability14==true'
[2022-06-03 16:23:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-050B-ReachabilityFireability-14
[2022-06-03 16:23:48] [INFO ] KInduction solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(SAT) depth K=1 took 2118 ms
[2022-06-03 16:24:01] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=2 took 20182 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.46134e+13 after 3.46134e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.46134e+13 after 2.4849e+37
[2022-06-03 16:43:59] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=3 took 1197927 ms
Detected timeout of ITS tools.
[2022-06-03 16:45:26] [INFO ] Applying decomposition
[2022-06-03 16:45:26] [INFO ] Flatten gal took : 149 ms
[2022-06-03 16:45:26] [INFO ] Decomposing Gal with order
[2022-06-03 16:45:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:45:27] [INFO ] Removed a total of 698 redundant transitions.
[2022-06-03 16:45:27] [INFO ] Flatten gal took : 304 ms
[2022-06-03 16:45:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1219 labels/synchronizations in 260 ms.
[2022-06-03 16:45:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4492837973691178539.gal : 43 ms
[2022-06-03 16:45:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12500339487385306175.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4492837973691178539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12500339487385306175.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability12500339487385306175.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 75
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.07765e+10 after 8.33547e+28
[2022-06-03 16:47:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-050B-ReachabilityFireability-14
[2022-06-03 16:47:59] [INFO ] KInduction solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(SAT) depth K=2 took 1451672 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.33547e+28 after 4.56575e+50

BK_STOP 1654275718938

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPs-PT-050B"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-050B, 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 r222-tall-165286025300511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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