About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d2m36
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4141.928 | 835716.00 | 2879484.00 | 289.40 | TFTTFTTFTFTTFTTT | 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.r312-tall-165472283000966.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 SieveSingleMsgMbox-PT-d2m36, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283000966
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 7 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 6 12:11 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 SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654962183746
Running Version 202205111006
[2022-06-11 15:43:04] [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-11 15:43:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 15:43:05] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2022-06-11 15:43:05] [INFO ] Transformed 2398 places.
[2022-06-11 15:43:05] [INFO ] Transformed 1954 transitions.
[2022-06-11 15:43:05] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 16 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2200 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 948 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 213556 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213556 steps, saw 97434 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1954 rows 414 cols
[2022-06-11 15:43:09] [INFO ] Computed 6 place invariants in 72 ms
[2022-06-11 15:43:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-11 15:43:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2022-06-11 15:43:10] [INFO ] After 566ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2022-06-11 15:43:10] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2022-06-11 15:43:11] [INFO ] After 1026ms SMT Verify possible using 1674 Read/Feed constraints in real domain returned unsat :1 sat :0 real:4
[2022-06-11 15:43:11] [INFO ] After 2130ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-06-11 15:43:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 15:43:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 15:43:12] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-06-11 15:43:13] [INFO ] After 853ms SMT Verify possible using 1674 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2022-06-11 15:43:13] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 5 ms to minimize.
[2022-06-11 15:43:13] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2022-06-11 15:43:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2022-06-11 15:43:14] [INFO ] Deduced a trap composed of 129 places in 79 ms of which 1 ms to minimize.
[2022-06-11 15:43:14] [INFO ] Deduced a trap composed of 133 places in 98 ms of which 1 ms to minimize.
[2022-06-11 15:43:14] [INFO ] Deduced a trap composed of 155 places in 97 ms of which 1 ms to minimize.
[2022-06-11 15:43:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 499 ms
[2022-06-11 15:43:14] [INFO ] After 2012ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-06-11 15:43:14] [INFO ] After 2902ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4384 ms.
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.12 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 375
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 375
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1076 place count 270 transition count 366
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1168 place count 178 transition count 274
Iterating global reduction 2 with 92 rules applied. Total rules applied 1260 place count 178 transition count 274
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1296 place count 178 transition count 238
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1334 place count 140 transition count 185
Iterating global reduction 3 with 38 rules applied. Total rules applied 1372 place count 140 transition count 185
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1397 place count 140 transition count 160
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1407 place count 130 transition count 145
Iterating global reduction 4 with 10 rules applied. Total rules applied 1417 place count 130 transition count 145
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1427 place count 120 transition count 135
Iterating global reduction 4 with 10 rules applied. Total rules applied 1437 place count 120 transition count 135
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1443 place count 114 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 114 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1451 place count 114 transition count 126
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1457 place count 108 transition count 120
Iterating global reduction 5 with 6 rules applied. Total rules applied 1463 place count 108 transition count 120
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1467 place count 104 transition count 116
Iterating global reduction 5 with 4 rules applied. Total rules applied 1471 place count 104 transition count 116
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1473 place count 102 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 1475 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1476 place count 101 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 1477 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1478 place count 100 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 1479 place count 100 transition count 110
Applied a total of 1479 rules in 118 ms. Remains 100 /414 variables (removed 314) and now considering 110/1954 (removed 1844) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/414 places, 110/1954 transitions.
Incomplete random walk after 1000000 steps, including 224304 resets, run finished after 6442 ms. (steps per millisecond=155 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103135 resets, run finished after 2906 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103319 resets, run finished after 2614 ms. (steps per millisecond=382 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 9635240 steps, run timeout after 33001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 9635240 steps, saw 4492359 distinct states, run finished after 33001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:44:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:04] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 15:44:04] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:04] [INFO ] After 19ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:04] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2022-06-11 15:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-06-11 15:44:04] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-11 15:44:04] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1762 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 110/110 transitions.
Applied a total of 0 rules in 14 ms. Remains 100 /100 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 110/110 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:06] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:06] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2022-06-11 15:44:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:06] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-11 15:44:06] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 110/110 transitions.
Incomplete random walk after 100000 steps, including 22550 resets, run finished after 1001 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:07] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 15:44:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:07] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:44:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 15:44:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 15:44:07] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:07] [INFO ] After 25ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:07] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2022-06-11 15:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-11 15:44:07] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-11 15:44:07] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 224373 resets, run finished after 6143 ms. (steps per millisecond=162 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103621 resets, run finished after 2765 ms. (steps per millisecond=361 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102832 resets, run finished after 2700 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 9713402 steps, run timeout after 33001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 9713402 steps, saw 4528219 distinct states, run finished after 33001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:52] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:44:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:52] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:52] [INFO ] After 37ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:52] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2022-06-11 15:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-06-11 15:44:52] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-11 15:44:52] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1431 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 110/110 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:44:54] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:44:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:54] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-06-11 15:44:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:44:54] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 110/110 transitions.
Incomplete random walk after 100000 steps, including 22490 resets, run finished after 782 ms. (steps per millisecond=127 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:55] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 15:44:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:55] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:44:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 15:44:55] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:55] [INFO ] After 23ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:44:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2022-06-11 15:44:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-06-11 15:44:55] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-11 15:44:55] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1065 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2802919 steps, run timeout after 3001 ms. (steps per millisecond=933 ) properties seen :{}
Probabilistic random walk after 2802919 steps, saw 1305479 distinct states, run finished after 3001 ms. (steps per millisecond=933 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:44:58] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:44:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 15:44:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:44:58] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 15:44:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:44:58] [INFO ] After 19ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:44:58] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:44:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:44:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 15:44:58] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:58] [INFO ] After 13ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:44:58] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-11 15:44:58] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 98 transition count 107
Applied a total of 5 rules in 11 ms. Remains 98 /100 variables (removed 2) and now considering 107/110 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/100 places, 107/110 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1063 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2831781 steps, run timeout after 3001 ms. (steps per millisecond=943 ) properties seen :{}
Probabilistic random walk after 2831781 steps, saw 1325239 distinct states, run finished after 3002 ms. (steps per millisecond=943 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 15:45:01] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:45:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:01] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:45:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 15:45:01] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-11 15:45:01] [INFO ] After 12ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:01] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-11 15:45:01] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 107/107 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 15:45:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:01] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 15:45:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-11 15:45:02] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2022-06-11 15:45:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 15:45:02] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:45:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 107/107 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 99
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 92 transition count 82
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 75 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 72 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 71 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 71 transition count 86
Applied a total of 57 rules in 16 ms. Remains 71 /98 variables (removed 27) and now considering 86/107 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 71 cols
[2022-06-11 15:45:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-11 15:45:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:02] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:02] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 15:45:02] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-11 15:45:02] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-06-11 15:45:02] [INFO ] Flatten gal took : 33 ms
[2022-06-11 15:45:02] [INFO ] Flatten gal took : 14 ms
[2022-06-11 15:45:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7589559929945757116.gal : 7 ms
[2022-06-11 15:45:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8894709399810139039.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14351714374313900876;'/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/ReachabilityCardinality7589559929945757116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8894709399810139039.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...319
Loading property file /tmp/ReachabilityCardinality8894709399810139039.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 101
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :101 after 165
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :257 after 287
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :287 after 1093
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1093 after 1801
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3198 after 9502
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :27920 after 62775
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :518088 after 776404
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.95663e+07 after 2.07554e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.66046e+08 after 3.90766e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.77502e+09 after 8.78226e+09
Detected timeout of ITS tools.
[2022-06-11 15:45:17] [INFO ] Flatten gal took : 9 ms
[2022-06-11 15:45:17] [INFO ] Applying decomposition
[2022-06-11 15:45:17] [INFO ] Flatten gal took : 9 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/graph13657506472571263865.txt' '-o' '/tmp/graph13657506472571263865.bin' '-w' '/tmp/graph13657506472571263865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13657506472571263865.bin' '-l' '-1' '-v' '-w' '/tmp/graph13657506472571263865.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:45:17] [INFO ] Decomposing Gal with order
[2022-06-11 15:45:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:45:17] [INFO ] Removed a total of 78 redundant transitions.
[2022-06-11 15:45:17] [INFO ] Flatten gal took : 43 ms
[2022-06-11 15:45:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2022-06-11 15:45:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16178498646214009152.gal : 12 ms
[2022-06-11 15:45:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14215790436331612266.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14351714374313900876;'/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/ReachabilityCardinality16178498646214009152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14215790436331612266.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/ReachabilityCardinality14215790436331612266.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 102
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :102 after 233
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :233 after 796
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :796 after 11541
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :11541 after 337569
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :337569 after 1.0606e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14549867080666929488
[2022-06-11 15:45:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14549867080666929488
Running compilation step : cd /tmp/ltsmin14549867080666929488;'/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 241 ms.
Running link step : cd /tmp/ltsmin14549867080666929488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14549867080666929488;'/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' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 981 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2771640 steps, run timeout after 3001 ms. (steps per millisecond=923 ) properties seen :{}
Probabilistic random walk after 2771640 steps, saw 1291266 distinct states, run finished after 3001 ms. (steps per millisecond=923 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:45:51] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-11 15:45:51] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:45:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2022-06-11 15:45:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:51] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 15:45:51] [INFO ] After 28ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:51] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-11 15:45:51] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 99 transition count 108
Applied a total of 3 rules in 9 ms. Remains 99 /100 variables (removed 1) and now considering 108/110 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/100 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1067 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2809710 steps, run timeout after 3001 ms. (steps per millisecond=936 ) properties seen :{}
Probabilistic random walk after 2809710 steps, saw 1308693 distinct states, run finished after 3001 ms. (steps per millisecond=936 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 15:45:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:45:54] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:45:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 15:45:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:54] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-11 15:45:54] [INFO ] After 15ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:54] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2022-06-11 15:45:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-06-11 15:45:54] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-11 15:45:54] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 108/108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 15:45:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:45:54] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 15:45:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-11 15:45:54] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2022-06-11 15:45:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 99 cols
[2022-06-11 15:45:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:45:54] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 108/108 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 100
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 93 transition count 100
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 93 transition count 82
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 75 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 72 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 71 transition count 88
Applied a total of 58 rules in 6 ms. Remains 71 /99 variables (removed 28) and now considering 88/108 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 71 cols
[2022-06-11 15:45:54] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-11 15:45:54] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:45:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:54] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 15:45:54] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:54] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-11 15:45:54] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:45:54] [INFO ] Flatten gal took : 8 ms
[2022-06-11 15:45:54] [INFO ] Flatten gal took : 7 ms
[2022-06-11 15:45:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5321334026971485807.gal : 8 ms
[2022-06-11 15:45:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3746630502272456637.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14351714374313900876;'/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/ReachabilityCardinality5321334026971485807.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3746630502272456637.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...319
Loading property file /tmp/ReachabilityCardinality3746630502272456637.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 155
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :155 after 215
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,1063,0.044589,5484,2,1111,12,6858,6,0,374,4045,0
Total reachable state count : 1063
Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.044963,5484,2,81,12,6858,7,0,377,4045,0
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 100 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 94 transition count 102
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 94 transition count 85
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 77 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 74 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 73 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 73 transition count 90
Applied a total of 57 rules in 8 ms. Remains 73 /100 variables (removed 27) and now considering 90/110 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 73 cols
[2022-06-11 15:45:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-11 15:45:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-11 15:45:55] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:45:55] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-11 15:45:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-06-11 15:45:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2022-06-11 15:45:55] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2022-06-11 15:45:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2022-06-11 15:45:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2022-06-11 15:45:55] [INFO ] After 222ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:45:55] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 15:45:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-06-11 15:45:55] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-11 15:45:55] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 15:45:55] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-11 15:45:55] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 15:45:55] [INFO ] Flatten gal took : 12 ms
[2022-06-11 15:45:55] [INFO ] Flatten gal took : 15 ms
[2022-06-11 15:45:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6006849647923597005.gal : 2 ms
[2022-06-11 15:45:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17163110952868391528.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/ReachabilityCardinality6006849647923597005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17163110952868391528.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/ReachabilityCardinality17163110952868391528.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 24
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :24 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 101
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :101 after 147
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :257 after 265
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :265 after 1100
Invariant property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07 does not hold.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1100 after 1793
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3218 after 7440
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7440 after 14291
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :143924 after 148220
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :530440 after 847608
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.01918e+07 after 2.24138e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.79294e+08 after 4.04864e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.0172e+09 after 8.02781e+09
Detected timeout of ITS tools.
[2022-06-11 15:46:10] [INFO ] Flatten gal took : 12 ms
[2022-06-11 15:46:10] [INFO ] Applying decomposition
[2022-06-11 15:46:10] [INFO ] Flatten gal took : 7 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/graph13973128683083460405.txt' '-o' '/tmp/graph13973128683083460405.bin' '-w' '/tmp/graph13973128683083460405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13973128683083460405.bin' '-l' '-1' '-v' '-w' '/tmp/graph13973128683083460405.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:46:10] [INFO ] Decomposing Gal with order
[2022-06-11 15:46:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:46:10] [INFO ] Removed a total of 92 redundant transitions.
[2022-06-11 15:46:10] [INFO ] Flatten gal took : 16 ms
[2022-06-11 15:46:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 2 ms.
[2022-06-11 15:46:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2216797052979318007.gal : 12 ms
[2022-06-11 15:46:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13939905957809626882.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/ReachabilityCardinality2216797052979318007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13939905957809626882.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/ReachabilityCardinality13939905957809626882.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 44
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :44 after 183
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :183 after 1862
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1862 after 28445
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :28445 after 607005
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :607005 after 5.30315e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.30315e+07 after 1.2564e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12337535650178230562
[2022-06-11 15:46:25] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12337535650178230562
Running compilation step : cd /tmp/ltsmin12337535650178230562;'/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 163 ms.
Running link step : cd /tmp/ltsmin12337535650178230562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12337535650178230562;'/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' 'SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 15:46:40] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
[2022-06-11 15:46:40] [INFO ] Flatten gal took : 7 ms
Built C files in :
/tmp/ltsmin12163981879026123184
[2022-06-11 15:46:40] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2022-06-11 15:46:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:40] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2022-06-11 15:46:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:40] [INFO ] Applying decomposition
[2022-06-11 15:46:40] [INFO ] Flatten gal took : 6 ms
[2022-06-11 15:46:40] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2022-06-11 15:46:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 15:46:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12163981879026123184
Running compilation step : cd /tmp/ltsmin12163981879026123184;'/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-11 15:46:40] [INFO ] Input system was already deterministic with 110 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/graph17922718950536635189.txt' '-o' '/tmp/graph17922718950536635189.bin' '-w' '/tmp/graph17922718950536635189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17922718950536635189.bin' '-l' '-1' '-v' '-w' '/tmp/graph17922718950536635189.weights' '-q' '0' '-e' '0.001'
[2022-06-11 15:46:40] [INFO ] Decomposing Gal with order
[2022-06-11 15:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 15:46:40] [INFO ] Removed a total of 96 redundant transitions.
[2022-06-11 15:46:40] [INFO ] Flatten gal took : 27 ms
[2022-06-11 15:46:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 3 ms.
[2022-06-11 15:46:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3263837894343416111.gal : 78 ms
[2022-06-11 15:46:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16804806386032992700.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/ReachabilityCardinality3263837894343416111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16804806386032992700.prop' '--nowitness'
[2022-06-11 15:46:40] [INFO ] Ran tautology test, simplified 0 / 2 in 215 ms.
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin12163981879026123184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
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/ReachabilityCardinality16804806386032992700.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 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 228
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12163981879026123184;'/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' 'SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true'
[2022-06-11 15:46:40] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=0 took 37 ms
[2022-06-11 15:46:40] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07(UNSAT) depth K=0 took 1 ms
[2022-06-11 15:46:40] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=1 took 0 ms
[2022-06-11 15:46:40] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07(UNSAT) depth K=1 took 0 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :452 after 2656
[2022-06-11 15:46:40] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=2 took 18 ms
[2022-06-11 15:46:40] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07(UNSAT) depth K=2 took 0 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 110 rows 100 cols
[2022-06-11 15:46:41] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:46:41] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:46:41] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=3 took 21 ms
[2022-06-11 15:46:41] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07(UNSAT) depth K=3 took 24 ms
[2022-06-11 15:46:41] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=4 took 114 ms
Invariant property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07 does not hold.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15967 after 47544
[2022-06-11 15:46:41] [INFO ] Proved 100 variables to be positive in 211 ms
[2022-06-11 15:46:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:46:41] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=0 took 10 ms
[2022-06-11 15:46:41] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07(UNSAT) depth K=4 took 80 ms
[2022-06-11 15:46:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:46:41] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=1 took 68 ms
[2022-06-11 15:46:41] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=5 took 220 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :360243 after 648947
[2022-06-11 15:46:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:46:42] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=2 took 1125 ms
[2022-06-11 15:46:42] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=6 took 1065 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.68136e+07 after 3.38807e+07
[2022-06-11 15:46:45] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=7 took 2745 ms
[2022-06-11 15:46:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:46:45] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=3 took 2886 ms
[2022-06-11 15:46:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:46:46] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=4 took 1029 ms
[2022-06-11 15:46:48] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=8 took 2908 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.7387e+10 after 1.73882e+10
[2022-06-11 15:46:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:46:55] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=5 took 9024 ms
[2022-06-11 15:46:55] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=9 took 7340 ms
[2022-06-11 15:47:03] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=10 took 7527 ms
[2022-06-11 15:47:29] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=11 took 26189 ms
[2022-06-11 15:47:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:47:30] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=6 took 35227 ms
[2022-06-11 15:47:48] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=12 took 19685 ms
[2022-06-11 15:48:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:48:35] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=7 took 65248 ms
[2022-06-11 15:48:48] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=13 took 59288 ms
[2022-06-11 15:50:12] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=14 took 84554 ms
[2022-06-11 15:51:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:51:50] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=8 took 194544 ms
[2022-06-11 15:52:12] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=15 took 119901 ms
[2022-06-11 15:54:13] [INFO ] BMC solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(UNSAT) depth K=16 took 120800 ms
[2022-06-11 15:54:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05
[2022-06-11 15:54:51] [INFO ] KInduction solution for property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05(SAT) depth K=9 took 181002 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Initializing POR dependencies: labels 112, guards 110
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.048: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.042: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.048: There are 112 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.048: State length is 100, there are 110 groups
pins2lts-mc-linux64( 0/ 8), 0.048: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.048: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 5/ 8), 0.044: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.036: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.044: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.036: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.048: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.048: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.048: Visible groups: 0 / 110, labels: 1 / 112
pins2lts-mc-linux64( 0/ 8), 0.048: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.048: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.044: "SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.063: ~14 levels ~960 states ~1296 transitions
pins2lts-mc-linux64( 0/ 8), 0.075: ~22 levels ~1920 states ~2480 transitions
pins2lts-mc-linux64( 0/ 8), 0.122: ~31 levels ~3840 states ~5872 transitions
pins2lts-mc-linux64( 0/ 8), 0.167: ~35 levels ~7680 states ~11984 transitions
pins2lts-mc-linux64( 0/ 8), 0.257: ~54 levels ~15360 states ~22784 transitions
pins2lts-mc-linux64( 0/ 8), 0.396: ~63 levels ~30720 states ~44384 transitions
pins2lts-mc-linux64( 0/ 8), 0.658: ~72 levels ~61440 states ~99416 transitions
pins2lts-mc-linux64( 0/ 8), 1.103: ~84 levels ~122880 states ~179512 transitions
pins2lts-mc-linux64( 0/ 8), 2.089: ~95 levels ~245760 states ~373424 transitions
pins2lts-mc-linux64( 0/ 8), 3.692: ~106 levels ~491520 states ~825168 transitions
pins2lts-mc-linux64( 0/ 8), 6.215: ~115 levels ~983040 states ~1623488 transitions
pins2lts-mc-linux64( 1/ 8), 10.332: ~94 levels ~1966080 states ~2994864 transitions
pins2lts-mc-linux64( 1/ 8), 19.436: ~108 levels ~3932160 states ~6250144 transitions
pins2lts-mc-linux64( 0/ 8), 37.275: ~155 levels ~7864320 states ~12953504 transitions
pins2lts-mc-linux64( 6/ 8), 71.626: ~127 levels ~15728640 states ~26152336 transitions
pins2lts-mc-linux64( 6/ 8), 141.377: ~139 levels ~31457280 states ~52348976 transitions
pins2lts-mc-linux64( 4/ 8), 281.810: ~155 levels ~62914560 states ~103177528 transitions
pins2lts-mc-linux64( 4/ 8), 579.734: ~166 levels ~125829120 states ~215380264 transitions
pins2lts-mc-linux64( 4/ 8), 610.122: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 610.172:
pins2lts-mc-linux64( 0/ 8), 610.172: mean standard work distribution: 1.0% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 610.172:
pins2lts-mc-linux64( 0/ 8), 610.172: Explored 128888245 states 223679305 transitions, fanout: 1.735
pins2lts-mc-linux64( 0/ 8), 610.172: Total exploration time 610.120 sec (610.070 sec minimum, 610.088 sec on average)
pins2lts-mc-linux64( 0/ 8), 610.172: States per second: 211251, Transitions per second: 366615
pins2lts-mc-linux64( 0/ 8), 610.172: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 610.172:
pins2lts-mc-linux64( 0/ 8), 610.172: Queue width: 8B, total height: 6631164, memory: 50.59MB
pins2lts-mc-linux64( 0/ 8), 610.172: Tree memory: 1063.6MB, 8.3 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 610.172: Tree fill ratio (roots/leafs): 99.0%/15.0%
pins2lts-mc-linux64( 0/ 8), 610.172: Stored 111 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 610.172: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 610.172: Est. total memory use: 1114.2MB (~1074.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12163981879026123184;'/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' 'SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12163981879026123184;'/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' 'SieveSingleMsgMboxPTd2m36ReachabilityCardinality05==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
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,6.10029e+13,230.152,1442252,12804,3895,2.16263e+06,40840,355,3.1254e+06,108,789510,0
Total reachable state count : 61002883693874
Verifying 2 reachability properties.
Reachability property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05 is true.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05 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
SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05,16632,230.61,1440900,109,127,2.16263e+06,40840,355,3.1254e+06,110,789510,0
Invariant property SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07 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
SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-07,2.22755e+09,230.63,1440900,873,578,2.16263e+06,40840,361,3.1254e+06,113,789510,0
[2022-06-11 15:56:59] [WARNING] Interrupting SMT solver.
[2022-06-11 15:56:59] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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)
[2022-06-11 15:56:59] [WARNING] Unexpected error occurred while running SMT. Was verifying SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05 SMT depth 17
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
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 "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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-11 15:56:59] [INFO ] During BMC, SMT solver timed out at depth 17
[2022-06-11 15:56:59] [INFO ] BMC solving timed out (3600000 secs) at depth 17
[2022-06-11 15:56:59] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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-11 15:56:59] [WARNING] Unexpected error occurred while running SMT. Was verifying SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-05 K-induction depth 10
Exception in thread "Thread-17" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
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 "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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-11 15:56:59] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
Total runtime 834582 ms.
BK_STOP 1654963019462
--------------------
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="SieveSingleMsgMbox-PT-d2m36"
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 SieveSingleMsgMbox-PT-d2m36, 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 r312-tall-165472283000966"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 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 ;