About the Execution of ITS-Tools for Szymanski-PT-b06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6293.527 | 724006.00 | 2611916.00 | 788.00 | TTTFFTTTFTTTFTFF | 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-165472283101054.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 Szymanski-PT-b06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283101054
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 7 17:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 7 17:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b06-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654978554764
Running Version 202205111006
[2022-06-11 20:15:55] [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 20:15:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 20:15:56] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2022-06-11 20:15:56] [INFO ] Transformed 568 places.
[2022-06-11 20:15:56] [INFO ] Transformed 8320 transitions.
[2022-06-11 20:15:56] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 38 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 8) seen :3
FORMULA Szymanski-PT-b06-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b06-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b06-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-11 20:15:57] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2022-06-11 20:15:57] [INFO ] Computed 3 place invariants in 41 ms
[2022-06-11 20:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-11 20:15:57] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 20:15:57] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-06-11 20:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-11 20:15:57] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 20:15:58] [INFO ] After 1053ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-06-11 20:15:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:15:59] [INFO ] After 1163ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2022-06-11 20:16:00] [INFO ] Deduced a trap composed of 51 places in 593 ms of which 5 ms to minimize.
[2022-06-11 20:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 758 ms
[2022-06-11 20:16:00] [INFO ] After 1966ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-06-11 20:16:00] [INFO ] After 3267ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
FORMULA Szymanski-PT-b06-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 501 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/308 places, 7808/8064 transitions.
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1124 ms. (steps per millisecond=889 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 571864 steps, run timeout after 9001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 571864 steps, saw 154747 distinct states, run finished after 9004 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 20:16:13] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:13] [INFO ] Computed 3 place invariants in 26 ms
[2022-06-11 20:16:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:14] [INFO ] After 699ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:16:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:16:14] [INFO ] After 187ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:14] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:15] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:16] [INFO ] After 765ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:16] [INFO ] Deduced a trap composed of 78 places in 455 ms of which 2 ms to minimize.
[2022-06-11 20:16:17] [INFO ] Deduced a trap composed of 144 places in 369 ms of which 0 ms to minimize.
[2022-06-11 20:16:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1030 ms
[2022-06-11 20:16:17] [INFO ] After 1840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2022-06-11 20:16:17] [INFO ] After 2647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 97 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 246 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 318 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2022-06-11 20:16:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:18] [INFO ] Computed 3 place invariants in 23 ms
[2022-06-11 20:16:18] [INFO ] Implicit Places using invariants in 565 ms returned []
[2022-06-11 20:16:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:18] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-11 20:16:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:16:22] [INFO ] Implicit Places using invariants and state equation in 3510 ms returned []
Implicit Place search using SMT with State Equation took 4079 ms to find 0 implicit places.
[2022-06-11 20:16:23] [INFO ] Redundant transitions in 960 ms returned []
[2022-06-11 20:16:23] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:23] [INFO ] Computed 3 place invariants in 19 ms
[2022-06-11 20:16:25] [INFO ] Dead Transitions using invariants and state equation in 2393 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-11 20:16:25] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:25] [INFO ] Computed 3 place invariants in 22 ms
[2022-06-11 20:16:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 20:16:26] [INFO ] After 668ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:16:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:16:26] [INFO ] After 196ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:26] [INFO ] After 956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-06-11 20:16:27] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:28] [INFO ] After 758ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:28] [INFO ] Deduced a trap composed of 78 places in 453 ms of which 1 ms to minimize.
[2022-06-11 20:16:29] [INFO ] Deduced a trap composed of 144 places in 356 ms of which 1 ms to minimize.
[2022-06-11 20:16:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1003 ms
[2022-06-11 20:16:29] [INFO ] After 1807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-06-11 20:16:29] [INFO ] After 2567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 1374 ms. (steps per millisecond=727 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 963 ms. (steps per millisecond=1038 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 404835 steps, run timeout after 6001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 404835 steps, saw 131076 distinct states, run finished after 6001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 20:16:37] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:37] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-11 20:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:38] [INFO ] After 668ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:16:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:16:38] [INFO ] After 184ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:38] [INFO ] After 928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:39] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:39] [INFO ] After 759ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:40] [INFO ] Deduced a trap composed of 78 places in 434 ms of which 1 ms to minimize.
[2022-06-11 20:16:40] [INFO ] Deduced a trap composed of 144 places in 334 ms of which 1 ms to minimize.
[2022-06-11 20:16:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 950 ms
[2022-06-11 20:16:40] [INFO ] After 1752ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-06-11 20:16:41] [INFO ] After 2449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2022-06-11 20:16:41] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:41] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-11 20:16:42] [INFO ] Implicit Places using invariants in 536 ms returned []
[2022-06-11 20:16:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:42] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-11 20:16:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:16:45] [INFO ] Implicit Places using invariants and state equation in 3092 ms returned []
Implicit Place search using SMT with State Equation took 3632 ms to find 0 implicit places.
[2022-06-11 20:16:46] [INFO ] Redundant transitions in 872 ms returned []
[2022-06-11 20:16:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:46] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-11 20:16:48] [INFO ] Dead Transitions using invariants and state equation in 2207 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=724 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-11 20:16:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:48] [INFO ] Computed 3 place invariants in 21 ms
[2022-06-11 20:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:49] [INFO ] After 670ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:16:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:16:49] [INFO ] After 186ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:49] [INFO ] After 953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:50] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:50] [INFO ] After 785ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:51] [INFO ] Deduced a trap composed of 78 places in 482 ms of which 1 ms to minimize.
[2022-06-11 20:16:51] [INFO ] Deduced a trap composed of 144 places in 348 ms of which 1 ms to minimize.
[2022-06-11 20:16:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1032 ms
[2022-06-11 20:16:51] [INFO ] After 1862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-06-11 20:16:51] [INFO ] After 2626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10003 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199504 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199504 steps, saw 86061 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 20:16:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:16:55] [INFO ] Computed 3 place invariants in 24 ms
[2022-06-11 20:16:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:55] [INFO ] After 649ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:16:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:16:55] [INFO ] After 189ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:55] [INFO ] After 904ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:16:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:16:56] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:57] [INFO ] After 766ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:16:57] [INFO ] Deduced a trap composed of 78 places in 451 ms of which 0 ms to minimize.
[2022-06-11 20:16:58] [INFO ] Deduced a trap composed of 144 places in 315 ms of which 1 ms to minimize.
[2022-06-11 20:16:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 953 ms
[2022-06-11 20:16:58] [INFO ] After 1763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-06-11 20:16:58] [INFO ] After 2488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207035 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 207035 steps, saw 87069 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 20:17:01] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:17:01] [INFO ] Computed 3 place invariants in 19 ms
[2022-06-11 20:17:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:17:02] [INFO ] After 608ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:17:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:17:02] [INFO ] After 182ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:17:02] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:17:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 20:17:03] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:04] [INFO ] After 753ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:04] [INFO ] Deduced a trap composed of 78 places in 463 ms of which 1 ms to minimize.
[2022-06-11 20:17:04] [INFO ] Deduced a trap composed of 144 places in 370 ms of which 1 ms to minimize.
[2022-06-11 20:17:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1028 ms
[2022-06-11 20:17:05] [INFO ] After 1832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-06-11 20:17:05] [INFO ] After 2577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 204 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2022-06-11 20:17:05] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:17:05] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-11 20:17:06] [INFO ] Implicit Places using invariants in 535 ms returned []
[2022-06-11 20:17:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:17:06] [INFO ] Computed 3 place invariants in 17 ms
[2022-06-11 20:17:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 20:17:09] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 4027 ms to find 0 implicit places.
[2022-06-11 20:17:10] [INFO ] Redundant transitions in 665 ms returned []
[2022-06-11 20:17:10] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:17:10] [INFO ] Computed 3 place invariants in 17 ms
[2022-06-11 20:17:12] [INFO ] Dead Transitions using invariants and state equation in 2263 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 5 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 215 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2022-06-11 20:17:12] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-11 20:17:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:17:13] [INFO ] After 305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:17:13] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 20:17:13] [INFO ] After 123ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:17:13] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:17:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:17:13] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:14] [INFO ] After 328ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:14] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-06-11 20:17:14] [INFO ] After 851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:14] [INFO ] Flatten gal took : 181 ms
[2022-06-11 20:17:14] [INFO ] Flatten gal took : 109 ms
[2022-06-11 20:17:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15511035087556460353.gal : 30 ms
[2022-06-11 20:17:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6791027196757002215.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2619631329492517791;'/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/ReachabilityCardinality15511035087556460353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6791027196757002215.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/ReachabilityCardinality6791027196757002215.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 187
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :187 after 3357
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3357 after 97950
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :97950 after 105385
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :105385 after 219029
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :219029 after 232859
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :232859 after 259194
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :259194 after 316487
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :316487 after 400340
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :400340 after 842729
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :842729 after 1.37422e+06
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,3.0121e+06,10.4849,245264,2,4262,18,335797,7,0,3020,582436,0
Total reachable state count : 3012098
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,11914,10.4876,245264,2,994,18,335797,7,0,3022,582436,0
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 129 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2022-06-11 20:17:25] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-11 20:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 44 ms returned sat
[2022-06-11 20:17:25] [INFO ] After 398ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 20:17:25] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 20:17:26] [INFO ] After 204ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:17:26] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 20:17:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 20:17:26] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:27] [INFO ] After 323ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:27] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-11 20:17:27] [INFO ] After 944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 20:17:27] [INFO ] Flatten gal took : 88 ms
[2022-06-11 20:17:27] [INFO ] Flatten gal took : 81 ms
[2022-06-11 20:17:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7474148805507931779.gal : 16 ms
[2022-06-11 20:17:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2867353033196328329.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7474148805507931779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2867353033196328329.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/ReachabilityCardinality2867353033196328329.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 187
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :187 after 3357
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3357 after 97950
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :97950 after 105385
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :105385 after 219029
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :219029 after 232859
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :232859 after 259194
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :259194 after 316487
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :316487 after 400340
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :400340 after 842729
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :842729 after 1.37422e+06
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,3.0121e+06,10.0449,245724,2,4262,18,335797,7,0,3020,582436,0
Total reachable state count : 3012098
Verifying 1 reachability properties.
Invariant property Szymanski-PT-b06-ReachabilityCardinality-12 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
Szymanski-PT-b06-ReachabilityCardinality-12,11914,10.0478,245724,2,994,18,335797,7,0,3022,582436,0
[2022-06-11 20:17:37] [INFO ] Flatten gal took : 260 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2668603562237293172
[2022-06-11 20:17:38] [INFO ] Too many transitions (7808) to apply POR reductions. Disabling POR matrices.
[2022-06-11 20:17:38] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2668603562237293172
Running compilation step : cd /tmp/ltsmin2668603562237293172;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 20:17:38] [INFO ] Applying decomposition
[2022-06-11 20:17:38] [INFO ] Flatten gal took : 442 ms
[2022-06-11 20:17:38] [INFO ] Flatten gal took : 397 ms
[2022-06-11 20:17:39] [INFO ] Input system was already deterministic with 7808 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/graph2072823967344398723.txt' '-o' '/tmp/graph2072823967344398723.bin' '-w' '/tmp/graph2072823967344398723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2072823967344398723.bin' '-l' '-1' '-v' '-w' '/tmp/graph2072823967344398723.weights' '-q' '0' '-e' '0.001'
[2022-06-11 20:17:39] [INFO ] Decomposing Gal with order
[2022-06-11 20:17:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 20:17:41] [INFO ] Removed a total of 17615 redundant transitions.
[2022-06-11 20:17:41] [INFO ] Flatten gal took : 1479 ms
[2022-06-11 20:17:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 964 labels/synchronizations in 377 ms.
[2022-06-11 20:17:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8325229325838625800.gal : 84 ms
[2022-06-11 20:17:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11384850243004119017.prop : 5 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/ReachabilityCardinality8325229325838625800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11384850243004119017.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
[2022-06-11 20:17:42] [INFO ] Ran tautology test, simplified 0 / 1 in 4209 ms.
[2022-06-11 20:17:42] [INFO ] BMC solution for property Szymanski-PT-b06-ReachabilityCardinality-12(UNSAT) depth K=0 took 82 ms
[2022-06-11 20:17:42] [INFO ] BMC solution for property Szymanski-PT-b06-ReachabilityCardinality-12(UNSAT) depth K=1 took 49 ms
Loading property file /tmp/ReachabilityCardinality11384850243004119017.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 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 142
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :142 after 672
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :672 after 3597
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3597 after 8604
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8604 after 20340
[2022-06-11 20:17:43] [INFO ] BMC solution for property Szymanski-PT-b06-ReachabilityCardinality-12(UNSAT) depth K=2 took 449 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :20340 after 24609
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :24609 after 25123
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :25123 after 25473
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :25473 after 26853
[2022-06-11 20:17:45] [INFO ] BMC solution for property Szymanski-PT-b06-ReachabilityCardinality-12(UNSAT) depth K=3 took 1828 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2022-06-11 20:17:45] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-11 20:17:45] [INFO ] Computed 3 place invariants in 18 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :26853 after 28804
[2022-06-11 20:17:48] [INFO ] Proved 305 variables to be positive in 3116 ms
[2022-06-11 20:17:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSzymanski-PT-b06-ReachabilityCardinality-12
[2022-06-11 20:17:48] [INFO ] KInduction solution for property Szymanski-PT-b06-ReachabilityCardinality-12(SAT) depth K=0 took 45 ms
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :28804 after 30361
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :30361 after 31349
[2022-06-11 20:18:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSzymanski-PT-b06-ReachabilityCardinality-12
[2022-06-11 20:18:04] [INFO ] KInduction solution for property Szymanski-PT-b06-ReachabilityCardinality-12(SAT) depth K=1 took 15836 ms
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :31349 after 78526
Compilation finished in 35257 ms.
Running link step : cd /tmp/ltsmin2668603562237293172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin2668603562237293172;'/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' 'SzymanskiPTb06ReachabilityCardinality12==true'
[2022-06-11 20:18:25] [INFO ] BMC solution for property Szymanski-PT-b06-ReachabilityCardinality-12(UNSAT) depth K=4 took 40333 ms
[2022-06-11 20:23:25] [INFO ] BMC solution for property Szymanski-PT-b06-ReachabilityCardinality-12(UNSAT) depth K=5 took 299420 ms
Invariant property Szymanski-PT-b06-ReachabilityCardinality-12 does not hold.
FORMULA Szymanski-PT-b06-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 fixpoint passes
[2022-06-11 20:26:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSzymanski-PT-b06-ReachabilityCardinality-12
[2022-06-11 20:26:48] [INFO ] KInduction solution for property Szymanski-PT-b06-ReachabilityCardinality-12(SAT) depth K=2 took 523559 ms
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,902649,244.299,3555352,1317,1821,1.88474e+06,2.3168e+06,7995,1.05719e+07,403,4.30286e+07,0
Total reachable state count : 902649
Verifying 1 reachability properties.
Invariant property Szymanski-PT-b06-ReachabilityCardinality-12 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
Szymanski-PT-b06-ReachabilityCardinality-12,5,245.177,3555352,51,60,1.88474e+06,2.3168e+06,7967,1.05719e+07,402,4.30286e+07,0
[2022-06-11 20:27:58] [WARNING] Interrupting SMT solver.
[2022-06-11 20:27:58] [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 20:27:58] [WARNING] Unexpected error occurred while running SMT. Was verifying Szymanski-PT-b06-ReachabilityCardinality-12 SMT depth 6
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 20:27:58] [INFO ] During BMC, SMT solver timed out at depth 6
[2022-06-11 20:27:58] [INFO ] BMC solving timed out (3600000 secs) at depth 6
[2022-06-11 20:27:58] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 722750 ms.
BK_STOP 1654979278770
--------------------
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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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-165472283101054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 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 ;