About the Execution of ITS-Tools for ShieldIIPs-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11567.123 | 3600000.00 | 13306662.00 | 696.70 | T?FTTF?TFTTFTTTT | normal |
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-165286024800143.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 ShieldIIPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800143
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K Apr 29 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 29 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:13 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.6K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 675K 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 ShieldIIPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654266628777
Running Version 202205111006
[2022-06-03 14:30:29] [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 14:30:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:30:30] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-06-03 14:30:30] [INFO ] Transformed 2403 places.
[2022-06-03 14:30:30] [INFO ] Transformed 2363 transitions.
[2022-06-03 14:30:30] [INFO ] Found NUPN structural information;
[2022-06-03 14:30:30] [INFO ] Parsed PT model containing 2403 places and 2363 transitions in 404 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 16) seen :7
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2022-06-03 14:30:31] [INFO ] Computed 361 place invariants in 36 ms
[2022-06-03 14:30:33] [INFO ] [Real]Absence check using 361 positive place invariants in 148 ms returned sat
[2022-06-03 14:30:33] [INFO ] After 1161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 14:30:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 132 ms returned sat
[2022-06-03 14:30:41] [INFO ] After 7486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-03 14:30:42] [INFO ] Deduced a trap composed of 20 places in 804 ms of which 7 ms to minimize.
[2022-06-03 14:30:43] [INFO ] Deduced a trap composed of 18 places in 796 ms of which 2 ms to minimize.
[2022-06-03 14:30:44] [INFO ] Deduced a trap composed of 24 places in 746 ms of which 3 ms to minimize.
[2022-06-03 14:30:45] [INFO ] Deduced a trap composed of 32 places in 813 ms of which 3 ms to minimize.
[2022-06-03 14:30:46] [INFO ] Deduced a trap composed of 14 places in 725 ms of which 2 ms to minimize.
[2022-06-03 14:30:46] [INFO ] Deduced a trap composed of 31 places in 658 ms of which 1 ms to minimize.
[2022-06-03 14:30:47] [INFO ] Deduced a trap composed of 22 places in 715 ms of which 1 ms to minimize.
[2022-06-03 14:30:48] [INFO ] Deduced a trap composed of 19 places in 710 ms of which 2 ms to minimize.
[2022-06-03 14:30:49] [INFO ] Deduced a trap composed of 24 places in 757 ms of which 2 ms to minimize.
[2022-06-03 14:30:50] [INFO ] Deduced a trap composed of 21 places in 726 ms of which 2 ms to minimize.
[2022-06-03 14:30:51] [INFO ] Deduced a trap composed of 20 places in 723 ms of which 1 ms to minimize.
[2022-06-03 14:30:51] [INFO ] Deduced a trap composed of 10 places in 722 ms of which 2 ms to minimize.
[2022-06-03 14:30:52] [INFO ] Deduced a trap composed of 22 places in 712 ms of which 2 ms to minimize.
[2022-06-03 14:30:53] [INFO ] Deduced a trap composed of 23 places in 690 ms of which 1 ms to minimize.
[2022-06-03 14:30:54] [INFO ] Deduced a trap composed of 31 places in 679 ms of which 2 ms to minimize.
[2022-06-03 14:30:55] [INFO ] Deduced a trap composed of 17 places in 694 ms of which 2 ms to minimize.
[2022-06-03 14:30:55] [INFO ] Deduced a trap composed of 37 places in 675 ms of which 2 ms to minimize.
[2022-06-03 14:30:56] [INFO ] Deduced a trap composed of 25 places in 694 ms of which 1 ms to minimize.
[2022-06-03 14:30:57] [INFO ] Deduced a trap composed of 21 places in 695 ms of which 2 ms to minimize.
[2022-06-03 14:30:58] [INFO ] Deduced a trap composed of 27 places in 659 ms of which 2 ms to minimize.
[2022-06-03 14:30:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 14:30:58] [INFO ] After 25188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 45580 ms.
Support contains 245 out of 2403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 2403 transition count 2204
Reduce places removed 159 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 170 rules applied. Total rules applied 329 place count 2244 transition count 2193
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 340 place count 2233 transition count 2193
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 340 place count 2233 transition count 2002
Deduced a syphon composed of 191 places in 17 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 382 rules applied. Total rules applied 722 place count 2042 transition count 2002
Discarding 230 places :
Symmetric choice reduction at 3 with 230 rule applications. Total rules 952 place count 1812 transition count 1772
Iterating global reduction 3 with 230 rules applied. Total rules applied 1182 place count 1812 transition count 1772
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1182 place count 1812 transition count 1707
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1312 place count 1747 transition count 1707
Performed 525 Post agglomeration using F-continuation condition.Transition count delta: 525
Deduced a syphon composed of 525 places in 4 ms
Reduce places removed 525 places and 0 transitions.
Iterating global reduction 3 with 1050 rules applied. Total rules applied 2362 place count 1222 transition count 1182
Partial Free-agglomeration rule applied 214 times.
Drop transitions removed 214 transitions
Iterating global reduction 3 with 214 rules applied. Total rules applied 2576 place count 1222 transition count 1182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2577 place count 1221 transition count 1181
Applied a total of 2577 rules in 816 ms. Remains 1221 /2403 variables (removed 1182) and now considering 1181/2363 (removed 1182) transitions.
Finished structural reductions, in 1 iterations. Remains : 1221/2403 places, 1181/2363 transitions.
Incomplete random walk after 1000000 steps, including 297 resets, run finished after 24581 ms. (steps per millisecond=40 ) properties (out of 9) seen :5
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 668588 steps, including 10 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 0
Interrupted Best-First random walk after 851799 steps, including 12 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 1
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 854396 steps, including 11 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 718725 steps, including 13 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 1
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1181 rows 1221 cols
[2022-06-03 14:32:29] [INFO ] Computed 361 place invariants in 29 ms
[2022-06-03 14:32:29] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:32:29] [INFO ] [Nat]Absence check using 354 positive place invariants in 75 ms returned sat
[2022-06-03 14:32:29] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-03 14:32:30] [INFO ] After 1189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:32:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 14:32:31] [INFO ] After 695ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 14:32:32] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2022-06-03 14:32:32] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2022-06-03 14:32:32] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2022-06-03 14:32:32] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2022-06-03 14:32:33] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2022-06-03 14:32:33] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2022-06-03 14:32:33] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 1 ms to minimize.
[2022-06-03 14:32:33] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2022-06-03 14:32:33] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 0 ms to minimize.
[2022-06-03 14:32:34] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-06-03 14:32:34] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2022-06-03 14:32:34] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2022-06-03 14:32:34] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2022-06-03 14:32:34] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 4 ms to minimize.
[2022-06-03 14:32:35] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2022-06-03 14:32:35] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-06-03 14:32:35] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2022-06-03 14:32:35] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2022-06-03 14:32:35] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2022-06-03 14:32:35] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2022-06-03 14:32:36] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:32:36] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2022-06-03 14:32:36] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-06-03 14:32:36] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2022-06-03 14:32:36] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-06-03 14:32:36] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2022-06-03 14:32:36] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5019 ms
[2022-06-03 14:32:37] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:32:37] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:32:37] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2022-06-03 14:32:37] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:32:38] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:32:38] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2022-06-03 14:32:38] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2022-06-03 14:32:38] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2022-06-03 14:32:38] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-06-03 14:32:38] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2022-06-03 14:32:39] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-06-03 14:32:39] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2022-06-03 14:32:39] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-06-03 14:32:39] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-06-03 14:32:39] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2022-06-03 14:32:39] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-06-03 14:32:40] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3610 ms
[2022-06-03 14:32:40] [INFO ] After 9843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 757 ms.
[2022-06-03 14:32:41] [INFO ] After 12087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3316 ms.
Support contains 87 out of 1221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1221/1221 places, 1181/1181 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1221 transition count 1169
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1209 transition count 1169
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 24 place count 1209 transition count 1144
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 74 place count 1184 transition count 1144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 1180 transition count 1140
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 1180 transition count 1140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 82 place count 1180 transition count 1139
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 1179 transition count 1139
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 272 place count 1085 transition count 1045
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 2 with 48 rules applied. Total rules applied 320 place count 1085 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 321 place count 1084 transition count 1044
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 1084 transition count 1044
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 1082 transition count 1042
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 325 place count 1081 transition count 1042
Applied a total of 325 rules in 954 ms. Remains 1081 /1221 variables (removed 140) and now considering 1042/1181 (removed 139) transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1221 places, 1042/1181 transitions.
Incomplete random walk after 1000000 steps, including 276 resets, run finished after 14850 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 736923 steps, including 13 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 885851 steps, including 11 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 0
Interrupted probabilistic random walk after 3923167 steps, run timeout after 72001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 3923167 steps, saw 611138 distinct states, run finished after 72004 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:34:22] [INFO ] Computed 360 place invariants in 14 ms
[2022-06-03 14:34:22] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:34:23] [INFO ] [Nat]Absence check using 352 positive place invariants in 81 ms returned sat
[2022-06-03 14:34:23] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-03 14:34:24] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:34:24] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2022-06-03 14:34:24] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2022-06-03 14:34:25] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2022-06-03 14:34:25] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:34:25] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2022-06-03 14:34:25] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2022-06-03 14:34:25] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2022-06-03 14:34:26] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2022-06-03 14:34:26] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:34:26] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-06-03 14:34:26] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2022-06-03 14:34:26] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2022-06-03 14:34:27] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2022-06-03 14:34:27] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:34:27] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2022-06-03 14:34:27] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2022-06-03 14:34:27] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-06-03 14:34:28] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2022-06-03 14:34:28] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-06-03 14:34:28] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-06-03 14:34:28] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2022-06-03 14:34:28] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2022-06-03 14:34:28] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:34:29] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2022-06-03 14:34:29] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:34:29] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:34:29] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:34:29] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5228 ms
[2022-06-03 14:34:30] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-06-03 14:34:30] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:34:30] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2022-06-03 14:34:30] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2022-06-03 14:34:30] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2022-06-03 14:34:31] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:34:31] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-03 14:34:31] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2022-06-03 14:34:31] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2022-06-03 14:34:31] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-06-03 14:34:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-06-03 14:34:31] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2022-06-03 14:34:32] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-06-03 14:34:33] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3064 ms
[2022-06-03 14:34:33] [INFO ] After 9870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 753 ms.
[2022-06-03 14:34:33] [INFO ] After 10878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2397 ms.
Support contains 87 out of 1081 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1081/1081 places, 1042/1042 transitions.
Applied a total of 0 rules in 31 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1081 places, 1042/1042 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1081/1081 places, 1042/1042 transitions.
Applied a total of 0 rules in 29 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:34:36] [INFO ] Computed 360 place invariants in 13 ms
[2022-06-03 14:34:37] [INFO ] Implicit Places using invariants in 728 ms returned []
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:34:37] [INFO ] Computed 360 place invariants in 6 ms
[2022-06-03 14:34:38] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2022-06-03 14:34:38] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:34:38] [INFO ] Computed 360 place invariants in 6 ms
[2022-06-03 14:34:38] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1081 places, 1042/1042 transitions.
Incomplete random walk after 1000000 steps, including 272 resets, run finished after 13294 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 737787 steps, including 13 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 894955 steps, including 11 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 0
Interrupted probabilistic random walk after 3864471 steps, run timeout after 69001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 3864471 steps, saw 603091 distinct states, run finished after 69001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:36:11] [INFO ] Computed 360 place invariants in 9 ms
[2022-06-03 14:36:11] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:36:11] [INFO ] [Nat]Absence check using 352 positive place invariants in 58 ms returned sat
[2022-06-03 14:36:11] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-03 14:36:12] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:36:13] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2022-06-03 14:36:13] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2022-06-03 14:36:13] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2022-06-03 14:36:13] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:36:13] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:36:14] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2022-06-03 14:36:14] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-06-03 14:36:14] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:36:14] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2022-06-03 14:36:14] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:36:15] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2022-06-03 14:36:15] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2022-06-03 14:36:15] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2022-06-03 14:36:15] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2022-06-03 14:36:15] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2022-06-03 14:36:16] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:36:16] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-06-03 14:36:16] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
[2022-06-03 14:36:16] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2022-06-03 14:36:16] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2022-06-03 14:36:16] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2022-06-03 14:36:17] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:36:17] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2022-06-03 14:36:17] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2022-06-03 14:36:17] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:36:17] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2022-06-03 14:36:17] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:36:18] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5178 ms
[2022-06-03 14:36:18] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2022-06-03 14:36:18] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2022-06-03 14:36:18] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2022-06-03 14:36:19] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2022-06-03 14:36:19] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2022-06-03 14:36:19] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2022-06-03 14:36:19] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-06-03 14:36:19] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2022-06-03 14:36:19] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-06-03 14:36:20] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-06-03 14:36:21] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2022-06-03 14:36:21] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2022-06-03 14:36:21] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-06-03 14:36:21] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3009 ms
[2022-06-03 14:36:21] [INFO ] After 9766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 747 ms.
[2022-06-03 14:36:22] [INFO ] After 10765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2184 ms.
Support contains 87 out of 1081 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1081/1081 places, 1042/1042 transitions.
Applied a total of 0 rules in 28 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1081 places, 1042/1042 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1081/1081 places, 1042/1042 transitions.
Applied a total of 0 rules in 28 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:36:24] [INFO ] Computed 360 place invariants in 8 ms
[2022-06-03 14:36:24] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:36:24] [INFO ] Computed 360 place invariants in 9 ms
[2022-06-03 14:36:26] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2022-06-03 14:36:26] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:36:26] [INFO ] Computed 360 place invariants in 5 ms
[2022-06-03 14:36:26] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1081/1081 places, 1042/1042 transitions.
Applied a total of 0 rules in 29 ms. Remains 1081 /1081 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:36:26] [INFO ] Computed 360 place invariants in 5 ms
[2022-06-03 14:36:27] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:36:27] [INFO ] [Nat]Absence check using 352 positive place invariants in 56 ms returned sat
[2022-06-03 14:36:27] [INFO ] [Nat]Absence check using 352 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-03 14:36:28] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:36:28] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2022-06-03 14:36:28] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5168 ms
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2022-06-03 14:36:37] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2022-06-03 14:36:37] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3092 ms
[2022-06-03 14:36:37] [INFO ] After 9832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 764 ms.
[2022-06-03 14:36:37] [INFO ] After 10826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 14:36:38] [INFO ] Flatten gal took : 171 ms
[2022-06-03 14:36:38] [INFO ] Flatten gal took : 93 ms
[2022-06-03 14:36:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3981255130602847047.gal : 36 ms
[2022-06-03 14:36:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14868804913247586811.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/ReachabilityCardinality3981255130602847047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14868804913247586811.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...320
Loading property file /tmp/ReachabilityCardinality14868804913247586811.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 1301
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1301 after 62216
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :62216 after 2.35169e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6.77286e+13 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.25385e+14 after 1.25385e+14
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.25385e+14 after 1.25389e+14
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.25389e+14 after 1.25753e+14
Detected timeout of ITS tools.
[2022-06-03 14:36:53] [INFO ] Flatten gal took : 77 ms
[2022-06-03 14:36:53] [INFO ] Applying decomposition
[2022-06-03 14:36:53] [INFO ] Flatten gal took : 64 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/graph3891513050164695371.txt' '-o' '/tmp/graph3891513050164695371.bin' '-w' '/tmp/graph3891513050164695371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3891513050164695371.bin' '-l' '-1' '-v' '-w' '/tmp/graph3891513050164695371.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:36:53] [INFO ] Decomposing Gal with order
[2022-06-03 14:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:36:54] [INFO ] Removed a total of 829 redundant transitions.
[2022-06-03 14:36:54] [INFO ] Flatten gal took : 245 ms
[2022-06-03 14:36:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 913 labels/synchronizations in 140 ms.
[2022-06-03 14:36:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15719714735383178253.gal : 37 ms
[2022-06-03 14:36:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2343078070378926028.prop : 2 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/ReachabilityCardinality15719714735383178253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2343078070378926028.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/ReachabilityCardinality2343078070378926028.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 306
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :306 after 456
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :456 after 1.16686e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.16686e+06 after 6.77286e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8869513584638503838
[2022-06-03 14:37:09] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8869513584638503838
Running compilation step : cd /tmp/ltsmin8869513584638503838;'/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 2327 ms.
Running link step : cd /tmp/ltsmin8869513584638503838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin8869513584638503838;'/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' 'ShieldIIPsPT040BReachabilityFireability01==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 14:37:24] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12431916885309364239
[2022-06-03 14:37:24] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2022-06-03 14:37:24] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:37:24] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2022-06-03 14:37:24] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:37:24] [INFO ] Applying decomposition
[2022-06-03 14:37:24] [INFO ] Flatten gal took : 81 ms
[2022-06-03 14:37:24] [INFO ] Flatten gal took : 161 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/graph14191275512084463935.txt' '-o' '/tmp/graph14191275512084463935.bin' '-w' '/tmp/graph14191275512084463935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14191275512084463935.bin' '-l' '-1' '-v' '-w' '/tmp/graph14191275512084463935.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:37:25] [INFO ] Decomposing Gal with order
[2022-06-03 14:37:25] [INFO ] Input system was already deterministic with 1042 transitions.
[2022-06-03 14:37:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:37:25] [INFO ] Removed a total of 827 redundant transitions.
[2022-06-03 14:37:25] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2022-06-03 14:37:25] [INFO ] Flatten gal took : 97 ms
[2022-06-03 14:37:25] [INFO ] Computation of Completed DNA matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:37:25] [INFO ] Built C files in 525ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12431916885309364239
Running compilation step : cd /tmp/ltsmin12431916885309364239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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 14:37:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 887 labels/synchronizations in 131 ms.
[2022-06-03 14:37:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6076284290082842100.gal : 14 ms
[2022-06-03 14:37:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4031768134188443082.prop : 0 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/ReachabilityFireability6076284290082842100.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4031768134188443082.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...298
[2022-06-03 14:37:25] [INFO ] Ran tautology test, simplified 0 / 2 in 687 ms.
Loading property file /tmp/ReachabilityFireability4031768134188443082.prop.
[2022-06-03 14:37:25] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=0 took 24 ms
[2022-06-03 14:37:25] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=0 took 0 ms
[2022-06-03 14:37:25] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=1 took 4 ms
[2022-06-03 14:37:25] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 6501
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6501 after 38901
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38901 after 38901
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1042 rows 1081 cols
[2022-06-03 14:37:26] [INFO ] Computed 360 place invariants in 5 ms
[2022-06-03 14:37:26] [INFO ] Computed 360 place invariants in 6 ms
[2022-06-03 14:37:27] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=2 took 1677 ms
[2022-06-03 14:37:28] [INFO ] Proved 1081 variables to be positive in 1854 ms
[2022-06-03 14:37:28] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=2 took 724 ms
[2022-06-03 14:37:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-03 14:37:28] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=0 took 321 ms
[2022-06-03 14:37:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2022-06-03 14:37:28] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=0 took 163 ms
Compilation finished in 4006 ms.
Running link step : cd /tmp/ltsmin12431916885309364239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin12431916885309364239;'/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' 'ShieldIIPsPT040BReachabilityFireability01==true'
[2022-06-03 14:37:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-03 14:37:29] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=1 took 1404 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38901 after 38901
[2022-06-03 14:37:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2022-06-03 14:37:31] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=1 took 1539 ms
[2022-06-03 14:37:50] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=3 took 22606 ms
[2022-06-03 14:38:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-03 14:38:55] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=2 took 83821 ms
[2022-06-03 14:39:52] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=3 took 122133 ms
[2022-06-03 14:40:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2022-06-03 14:40:57] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=2 took 122594 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.28398e+18 after 1.24603e+40
[2022-06-03 14:44:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-01
[2022-06-03 14:44:41] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(SAT) depth K=3 took 223107 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.24603e+40 after 5.21304e+41
[2022-06-03 14:57:27] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-01(UNSAT) depth K=4 took 1054739 ms
Detected timeout of ITS tools.
[2022-06-03 14:59:45] [INFO ] Applying decomposition
[2022-06-03 14:59:45] [INFO ] Flatten gal took : 512 ms
[2022-06-03 14:59:45] [INFO ] Decomposing Gal with order
[2022-06-03 14:59:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:59:46] [INFO ] Removed a total of 829 redundant transitions.
[2022-06-03 14:59:46] [INFO ] Flatten gal took : 293 ms
[2022-06-03 14:59:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 913 labels/synchronizations in 383 ms.
[2022-06-03 14:59:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13660343383352560246.gal : 63 ms
[2022-06-03 14:59:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13562174384135170065.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/ReachabilityFireability13660343383352560246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13562174384135170065.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...300
Loading property file /tmp/ReachabilityFireability13562174384135170065.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 306
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :306 after 1.16686e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.16686e+06 after 9.33211e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.33211e+06 after 5.64405e+11
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12431916885309364239;'/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' 'ShieldIIPsPT040BReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin12431916885309364239;'/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' 'ShieldIIPsPT040BReachabilityFireability06==true'
[2022-06-03 15:10:22] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=4 took 774358 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.44071e+17 after 2.62059e+53
[2022-06-03 15:15:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2022-06-03 15:15:34] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=3 took 1853820 ms
Detected timeout of ITS tools.
[2022-06-03 15:22:05] [INFO ] Flatten gal took : 143 ms
[2022-06-03 15:22:05] [INFO ] Input system was already deterministic with 1042 transitions.
[2022-06-03 15:22:05] [INFO ] Transformed 1081 places.
[2022-06-03 15:22:05] [INFO ] Transformed 1042 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 15:22:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7164969480969366179.gal : 5 ms
[2022-06-03 15:22:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1501301560885448382.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/ReachabilityFireability7164969480969366179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1501301560885448382.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability1501301560885448382.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 702
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :702 after 1606
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1606 after 28992
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :28992 after 485889
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :485889 after 1.70508e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.70508e+06 after 4.56586e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.56586e+06 after 2.5195e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.5195e+08 after 1.6725e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.6725e+10 after 2.33105e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.33105e+10 after 2.67707e+11
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.67707e+11 after 5.56106e+12
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.56106e+12 after 4.47609e+13
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :4.47609e+13 after 6.00633e+14
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :6.00633e+14 after 1.88101e+16
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :1.88101e+16 after 6.07165e+17
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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="ShieldIIPs-PT-040B"
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 ShieldIIPs-PT-040B, 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-165286024800143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B 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 ;