About the Execution of ITS-Tools for DES-PT-60b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2359.123 | 789145.00 | 1766856.00 | 1099.20 | FTTTFFFFTFTFTTFT | 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.r042-smll-165252095900542.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 DES-PT-60b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095900542
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Apr 29 15:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 15:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 15:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 15:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 15:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 139K May 10 09:33 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 DES-PT-60b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654194059080
Running Version 202205111006
[2022-06-02 18:21:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-02 18:21:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 18:21:01] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2022-06-02 18:21:01] [INFO ] Transformed 519 places.
[2022-06-02 18:21:01] [INFO ] Transformed 470 transitions.
[2022-06-02 18:21:01] [INFO ] Found NUPN structural information;
[2022-06-02 18:21:01] [INFO ] Parsed PT model containing 519 places and 470 transitions in 412 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 90 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 16) seen :3
FORMULA DES-PT-60b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 470 rows 519 cols
[2022-06-02 18:21:03] [INFO ] Computed 65 place invariants in 48 ms
[2022-06-02 18:21:04] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-02 18:21:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-06-02 18:21:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2022-06-02 18:21:12] [INFO ] After 4229ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :6
[2022-06-02 18:21:12] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 7 ms to minimize.
[2022-06-02 18:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2022-06-02 18:21:13] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 2 ms to minimize.
[2022-06-02 18:21:13] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 1 ms to minimize.
[2022-06-02 18:21:13] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2022-06-02 18:21:13] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2022-06-02 18:21:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 950 ms
[2022-06-02 18:21:14] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2022-06-02 18:21:14] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2022-06-02 18:21:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2022-06-02 18:21:16] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2022-06-02 18:21:16] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2022-06-02 18:21:16] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 1 ms to minimize.
[2022-06-02 18:21:16] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 1 ms to minimize.
[2022-06-02 18:21:17] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2022-06-02 18:21:17] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-06-02 18:21:17] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 0 ms to minimize.
[2022-06-02 18:21:17] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2022-06-02 18:21:17] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2022-06-02 18:21:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1945 ms
[2022-06-02 18:21:17] [INFO ] After 9999ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :6
Attempting to minimize the solution found.
Minimization took 2155 ms.
[2022-06-02 18:21:19] [INFO ] After 15823ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :6
FORMULA DES-PT-60b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 6 different solutions.
FORMULA DES-PT-60b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 69935 ms.
Support contains 34 out of 519 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 511 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.12 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 511 transition count 447
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 492 transition count 447
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 492 transition count 439
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 56 place count 484 transition count 439
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 73 place count 467 transition count 422
Iterating global reduction 2 with 17 rules applied. Total rules applied 90 place count 467 transition count 422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 90 place count 467 transition count 421
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 466 transition count 421
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 454 transition count 409
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 454 transition count 409
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 128 place count 454 transition count 397
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 131 place count 452 transition count 396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 131 place count 452 transition count 395
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 451 transition count 395
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 263 place count 386 transition count 330
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 269 place count 383 transition count 333
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 270 place count 383 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 271 place count 382 transition count 332
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 275 place count 382 transition count 328
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 279 place count 378 transition count 328
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 378 transition count 327
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 283 place count 378 transition count 327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 377 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 285 place count 376 transition count 326
Applied a total of 285 rules in 490 ms. Remains 376 /519 variables (removed 143) and now considering 326/470 (removed 144) transitions.
Finished structural reductions, in 1 iterations. Remains : 376/519 places, 326/470 transitions.
Incomplete random walk after 1000000 steps, including 31928 resets, run finished after 27608 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 828352 steps, including 4711 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted Best-First random walk after 762195 steps, including 4540 resets, run timeout after 5001 ms. (steps per millisecond=152 ) properties seen 0
Interrupted Best-First random walk after 852453 steps, including 4991 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 753350 steps, including 4237 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Interrupted Best-First random walk after 814933 steps, including 4605 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 0
Interrupted probabilistic random walk after 27687395 steps, run timeout after 156001 ms. (steps per millisecond=177 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 27687395 steps, saw 4800414 distinct states, run finished after 156004 ms. (steps per millisecond=177 ) properties seen :3
FORMULA DES-PT-60b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 326 rows 376 cols
[2022-06-02 18:25:58] [INFO ] Computed 60 place invariants in 12 ms
[2022-06-02 18:25:59] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:25:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2022-06-02 18:25:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 178 ms returned sat
[2022-06-02 18:26:00] [INFO ] After 899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:26:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 18:26:00] [INFO ] After 234ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:26:00] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2022-06-02 18:26:01] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2022-06-02 18:26:01] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2022-06-02 18:26:01] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2022-06-02 18:26:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 483 ms
[2022-06-02 18:26:01] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-06-02 18:26:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2022-06-02 18:26:01] [INFO ] After 1256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 262 ms.
[2022-06-02 18:26:02] [INFO ] After 2864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2869 ms.
Support contains 20 out of 376 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 376/376 places, 326/326 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 376 transition count 325
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 375 transition count 325
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 373 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 372 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 371 transition count 321
Applied a total of 9 rules in 63 ms. Remains 371 /376 variables (removed 5) and now considering 321/326 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 371/376 places, 321/326 transitions.
Incomplete random walk after 1000000 steps, including 35269 resets, run finished after 12750 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6671 resets, run finished after 4017 ms. (steps per millisecond=248 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6110 resets, run finished after 3673 ms. (steps per millisecond=272 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13432301 steps, run timeout after 60001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 13432301 steps, saw 1881343 distinct states, run finished after 60004 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:27:25] [INFO ] Computed 60 place invariants in 9 ms
[2022-06-02 18:27:25] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:27:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 39 ms returned sat
[2022-06-02 18:27:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 162 ms returned sat
[2022-06-02 18:27:50] [INFO ] After 23963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:27:50] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-06-02 18:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-06-02 18:27:50] [INFO ] After 24544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 898 ms.
[2022-06-02 18:27:51] [INFO ] After 26086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 20 out of 371 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 371/371 places, 321/321 transitions.
Applied a total of 0 rules in 40 ms. Remains 371 /371 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 371/371 places, 321/321 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 371/371 places, 321/321 transitions.
Applied a total of 0 rules in 25 ms. Remains 371 /371 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:27:51] [INFO ] Computed 60 place invariants in 5 ms
[2022-06-02 18:27:52] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:27:52] [INFO ] Computed 60 place invariants in 22 ms
[2022-06-02 18:27:53] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2022-06-02 18:27:53] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:27:53] [INFO ] Computed 60 place invariants in 8 ms
[2022-06-02 18:27:54] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 371/371 places, 321/321 transitions.
Incomplete random walk after 1000000 steps, including 35635 resets, run finished after 10071 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6578 resets, run finished after 4161 ms. (steps per millisecond=240 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6188 resets, run finished after 3308 ms. (steps per millisecond=302 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 11285305 steps, run timeout after 51001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 11285305 steps, saw 1624248 distinct states, run finished after 51005 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:29:02] [INFO ] Computed 60 place invariants in 4 ms
[2022-06-02 18:29:02] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:29:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-06-02 18:29:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2022-06-02 18:29:26] [INFO ] After 22981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:29:26] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2022-06-02 18:29:26] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-06-02 18:29:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2022-06-02 18:29:36] [INFO ] After 33129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 378 ms.
[2022-06-02 18:29:36] [INFO ] After 33917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 112 ms.
Support contains 20 out of 371 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 371/371 places, 321/321 transitions.
Applied a total of 0 rules in 18 ms. Remains 371 /371 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 371/371 places, 321/321 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 371/371 places, 321/321 transitions.
Applied a total of 0 rules in 13 ms. Remains 371 /371 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:29:36] [INFO ] Computed 60 place invariants in 4 ms
[2022-06-02 18:29:37] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:29:37] [INFO ] Computed 60 place invariants in 5 ms
[2022-06-02 18:29:38] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
[2022-06-02 18:29:38] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:29:38] [INFO ] Computed 60 place invariants in 7 ms
[2022-06-02 18:29:38] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 371/371 places, 321/321 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 371 transition count 321
Applied a total of 1 rules in 42 ms. Remains 371 /371 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:29:38] [INFO ] Computed 60 place invariants in 7 ms
[2022-06-02 18:29:38] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:29:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-06-02 18:29:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 90 ms returned sat
[2022-06-02 18:29:40] [INFO ] After 776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:29:40] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2022-06-02 18:29:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-06-02 18:29:40] [INFO ] After 1223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 199 ms.
[2022-06-02 18:29:40] [INFO ] After 1835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:29:41] [INFO ] Flatten gal took : 164 ms
[2022-06-02 18:29:41] [INFO ] Flatten gal took : 65 ms
[2022-06-02 18:29:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16268730998325215966.gal : 23 ms
[2022-06-02 18:29:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15992330160669925884.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/ReachabilityCardinality16268730998325215966.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15992330160669925884.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...321
Loading property file /tmp/ReachabilityCardinality15992330160669925884.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 53
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :53 after 1543
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1543 after 3687
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3687 after 20603
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :20603 after 73699
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :73699 after 164431
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :164431 after 710905
Detected timeout of ITS tools.
[2022-06-02 18:29:56] [INFO ] Flatten gal took : 49 ms
[2022-06-02 18:29:56] [INFO ] Applying decomposition
[2022-06-02 18:29:56] [INFO ] Flatten gal took : 44 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/graph6410211660959500537.txt' '-o' '/tmp/graph6410211660959500537.bin' '-w' '/tmp/graph6410211660959500537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6410211660959500537.bin' '-l' '-1' '-v' '-w' '/tmp/graph6410211660959500537.weights' '-q' '0' '-e' '0.001'
[2022-06-02 18:29:56] [INFO ] Decomposing Gal with order
[2022-06-02 18:29:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 18:29:56] [INFO ] Removed a total of 103 redundant transitions.
[2022-06-02 18:29:57] [INFO ] Flatten gal took : 126 ms
[2022-06-02 18:29:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 11 ms.
[2022-06-02 18:29:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15426842344825702094.gal : 9 ms
[2022-06-02 18:29:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6564531130180833377.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/ReachabilityCardinality15426842344825702094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6564531130180833377.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/ReachabilityCardinality6564531130180833377.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 89075
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :89075 after 148455
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :148455 after 935163
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :935163 after 2.87535e+10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.87535e+10 after 5.00772e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.00772e+10 after 7.49549e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7.49549e+10 after 1.10494e+11
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.10494e+11 after 1.74466e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4700081369886348771
[2022-06-02 18:30:12] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4700081369886348771
Running compilation step : cd /tmp/ltsmin4700081369886348771;'/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 1200 ms.
Running link step : cd /tmp/ltsmin4700081369886348771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4700081369886348771;'/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' 'DESPT60bReachabilityCardinality01==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 18:30:27] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2547759404907839558
[2022-06-02 18:30:27] [INFO ] Computing symmetric may disable matrix : 321 transitions.
[2022-06-02 18:30:27] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 18:30:27] [INFO ] Applying decomposition
[2022-06-02 18:30:27] [INFO ] Computing symmetric may enable matrix : 321 transitions.
[2022-06-02 18:30:27] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 18:30:27] [INFO ] Flatten gal took : 60 ms
[2022-06-02 18:30:27] [INFO ] Flatten gal took : 48 ms
[2022-06-02 18:30:27] [INFO ] Computing Do-Not-Accords matrix : 321 transitions.
[2022-06-02 18:30:27] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 18:30:27] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2547759404907839558
Running compilation step : cd /tmp/ltsmin2547759404907839558;'/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-02 18:30:27] [INFO ] Input system was already deterministic with 321 transitions.
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/graph10523827505595791399.txt' '-o' '/tmp/graph10523827505595791399.bin' '-w' '/tmp/graph10523827505595791399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10523827505595791399.bin' '-l' '-1' '-v' '-w' '/tmp/graph10523827505595791399.weights' '-q' '0' '-e' '0.001'
[2022-06-02 18:30:27] [INFO ] Decomposing Gal with order
[2022-06-02 18:30:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 18:30:27] [INFO ] Removed a total of 52 redundant transitions.
[2022-06-02 18:30:27] [INFO ] Flatten gal took : 99 ms
[2022-06-02 18:30:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 15 ms.
[2022-06-02 18:30:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14008418691721529921.gal : 14 ms
[2022-06-02 18:30:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15472958496887439938.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/ReachabilityCardinality14008418691721529921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15472958496887439938.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/ReachabilityCardinality15472958496887439938.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 911
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :911 after 98115
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :98115 after 129939
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :129939 after 1.24835e+06
[2022-06-02 18:30:28] [INFO ] Ran tautology test, simplified 0 / 2 in 741 ms.
[2022-06-02 18:30:28] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-01(UNSAT) depth K=0 took 34 ms
[2022-06-02 18:30:28] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-14(UNSAT) depth K=0 took 1 ms
[2022-06-02 18:30:28] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-01(UNSAT) depth K=1 took 2 ms
[2022-06-02 18:30:28] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-14(UNSAT) depth K=1 took 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 321 rows 371 cols
[2022-06-02 18:30:28] [INFO ] Computed 60 place invariants in 6 ms
[2022-06-02 18:30:28] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-01(UNSAT) depth K=2 took 403 ms
[2022-06-02 18:30:28] [INFO ] Computed 60 place invariants in 21 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.24835e+06 after 3.58617e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.58617e+10 after 6.78473e+10
[2022-06-02 18:30:29] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-14(UNSAT) depth K=2 took 453 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6.78473e+10 after 1.06941e+11
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.06941e+11 after 1.70912e+11
Compilation finished in 2131 ms.
Running link step : cd /tmp/ltsmin2547759404907839558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin2547759404907839558;'/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' 'DESPT60bReachabilityCardinality01==true'
[2022-06-02 18:30:29] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-01(UNSAT) depth K=3 took 534 ms
[2022-06-02 18:30:35] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-14(UNSAT) depth K=3 took 6031 ms
[2022-06-02 18:30:38] [INFO ] Proved 371 variables to be positive in 9669 ms
[2022-06-02 18:30:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60b-ReachabilityCardinality-01
[2022-06-02 18:30:38] [INFO ] KInduction solution for property DES-PT-60b-ReachabilityCardinality-01(SAT) depth K=0 took 267 ms
[2022-06-02 18:30:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60b-ReachabilityCardinality-14
[2022-06-02 18:30:38] [INFO ] KInduction solution for property DES-PT-60b-ReachabilityCardinality-14(SAT) depth K=0 took 103 ms
[2022-06-02 18:30:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60b-ReachabilityCardinality-01
[2022-06-02 18:30:40] [INFO ] KInduction solution for property DES-PT-60b-ReachabilityCardinality-01(SAT) depth K=1 took 1506 ms
[2022-06-02 18:30:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60b-ReachabilityCardinality-14
[2022-06-02 18:30:41] [INFO ] KInduction solution for property DES-PT-60b-ReachabilityCardinality-14(SAT) depth K=1 took 822 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.0536e+14 after 2.05401e+14
[2022-06-02 18:31:31] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-01(UNSAT) depth K=4 took 55688 ms
[2022-06-02 18:31:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60b-ReachabilityCardinality-01
[2022-06-02 18:31:32] [INFO ] KInduction solution for property DES-PT-60b-ReachabilityCardinality-01(SAT) depth K=2 took 50901 ms
[2022-06-02 18:31:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-60b-ReachabilityCardinality-14
[2022-06-02 18:31:52] [INFO ] KInduction solution for property DES-PT-60b-ReachabilityCardinality-14(SAT) depth K=2 took 20177 ms
[2022-06-02 18:32:36] [INFO ] BMC solution for property DES-PT-60b-ReachabilityCardinality-14(UNSAT) depth K=4 took 64989 ms
Invariant property DES-PT-60b-ReachabilityCardinality-14 does not hold.
FORMULA DES-PT-60b-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.32201e+14 after 5.32223e+14
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.29329e+14 after 8.29369e+14
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.55659e+14,80.419,175964,10352,12398,435330,33849,475,368780,574,360563,0
Total reachable state count : 855658673661583
Verifying 2 reachability properties.
Invariant property DES-PT-60b-ReachabilityCardinality-01 is true.
FORMULA DES-PT-60b-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-ReachabilityCardinality-01,0,80.8762,175964,1,0,435330,33849,508,368780,586,360563,23026
Invariant property DES-PT-60b-ReachabilityCardinality-14 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-ReachabilityCardinality-14,8.45518e+10,81.3561,175964,917,1237,435330,33849,562,368780,600,360563,52972
[2022-06-02 18:34:08] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 18:34:08] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-60b-ReachabilityCardinality-01 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-02 18:34:08] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-60b-ReachabilityCardinality-01 K-induction depth 3
Exception in thread "Thread-12" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-02 18:34:08] [INFO ] During BMC, SMT solver timed out at depth 5
[2022-06-02 18:34:08] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2022-06-02 18:34:08] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 787189 ms.
BK_STOP 1654194848225
--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DES-PT-60b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-60b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-165252095900542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;