About the Execution of ITS-Tools for Peterson-COL-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 851.508 | 94123.00 | 75413.00 | 11120.40 | TFTFFTTTTFTTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128100566.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100566
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K May 5 16:51 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 Peterson-COL-3-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1621007483141
Running Version 0
[2021-05-14 15:51:27] [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]
[2021-05-14 15:51:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:51:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 15:51:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 15:51:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 565 ms
[2021-05-14 15:51:28] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:51:28] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 15:51:28] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_6431080058433274299.dot
Reduce places removed 2 places and 0 transitions.
Incomplete random walk after 100002 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=689 ) properties (out of 14) seen :7
Running SMT prover for 7 properties.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:51:28] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-14 15:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 15:51:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-14 15:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
[2021-05-14 15:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
[2021-05-14 15:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-14 15:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
[2021-05-14 15:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
FORMULA Peterson-COL-3-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:51:28] [INFO ] Flatten gal took : 15 ms
[2021-05-14 15:51:28] [INFO ] Flatten gal took : 2 ms
[2021-05-14 15:51:28] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 17 ms.
[2021-05-14 15:51:28] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_12036674886821457918.dot
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :4
FORMULA Peterson-COL-3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2021-05-14 15:51:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 15:51:29] [INFO ] Computed 15 place invariants in 8 ms
[2021-05-14 15:51:29] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 15:51:29] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:29] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-14 15:51:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 15:51:31] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:31] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-14 15:51:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 15:51:31] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:51:31] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:32] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2021-05-14 15:51:33] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 0 ms to minimize.
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2021-05-14 15:51:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 15:51:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:34] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:34] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-14 15:51:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:34] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:34] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-14 15:51:34] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 0 ms to minimize.
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2021-05-14 15:51:34] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 3 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 0 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2021-05-14 15:51:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1366 ms
[2021-05-14 15:51:35] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 21 ms.
[2021-05-14 15:51:36] [INFO ] Added : 206 causal constraints over 42 iterations in 852 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-14 15:51:36] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 15:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:36] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-14 15:51:36] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 15:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:37] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-14 15:51:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 7 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 8 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 28 trap constraints in 2174 ms
FORMULA Peterson-COL-3-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 38100 steps, including 736 resets, run finished after 170 ms. (steps per millisecond=224 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA Peterson-COL-3-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 56 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 244 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 51 rules applied. Total rules applied 54 place count 241 transition count 281
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 102 place count 193 transition count 281
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 102 place count 193 transition count 273
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 118 place count 185 transition count 273
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 136 place count 176 transition count 264
Applied a total of 136 rules in 42 ms. Remains 176 /244 variables (removed 68) and now considering 264/332 (removed 68) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/244 places, 264/332 transitions.
[2021-05-14 15:51:41] [INFO ] Flatten gal took : 46 ms
[2021-05-14 15:51:41] [INFO ] Flatten gal took : 21 ms
[2021-05-14 15:51:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15226810342180795884.gal : 8 ms
[2021-05-14 15:51:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16229972154726245628.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15226810342180795884.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16229972154726245628.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15226810342180795884.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16229972154726245628.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16229972154726245628.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 45
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :45 after 237
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :237 after 602
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :602 after 5905
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5905 after 10382
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10382 after 20928
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :20928 after 36097
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :36097 after 77915
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :77915 after 210652
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :210652 after 476931
Detected timeout of ITS tools.
[2021-05-14 15:51:56] [INFO ] Flatten gal took : 16 ms
[2021-05-14 15:51:56] [INFO ] Applying decomposition
[2021-05-14 15:51:56] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10101410900670549734.txt, -o, /tmp/graph10101410900670549734.bin, -w, /tmp/graph10101410900670549734.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10101410900670549734.bin, -l, -1, -v, -w, /tmp/graph10101410900670549734.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:51:56] [INFO ] Decomposing Gal with order
[2021-05-14 15:51:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:51:56] [INFO ] Removed a total of 147 redundant transitions.
[2021-05-14 15:51:56] [INFO ] Flatten gal took : 66 ms
[2021-05-14 15:51:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2021-05-14 15:51:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4172987925125566228.gal : 6 ms
[2021-05-14 15:51:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11571059520265837151.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4172987925125566228.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11571059520265837151.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4172987925125566228.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11571059520265837151.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11571059520265837151.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 28
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :28 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 397
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :397 after 4728
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4728 after 9189
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9189 after 19376
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :19376 after 28804
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :28804 after 85179
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :85179 after 203057
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :203057 after 457944
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9452750068944504597
[2021-05-14 15:52:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9452750068944504597
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9452750068944504597]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9452750068944504597] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9452750068944504597] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2477 ms. (steps per millisecond=403 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1370 ms. (steps per millisecond=729 ) properties (out of 1) seen :0
Probably explored full state space saw : 930656 states, properties seen :{}
Probabilistic random walk after 4653280 steps, saw 930656 distinct states, run finished after 23519 ms. (steps per millisecond=197 ) properties seen :{}
Explored full state space saw : 930732 states, properties seen :{}
Exhaustive walk after 4653660 steps, saw 930732 distinct states, run finished after 9765 ms. (steps per millisecond=476 ) properties seen :{}
FORMULA Peterson-COL-3-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
BK_STOP 1621007577264
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="Peterson-COL-3"
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 Peterson-COL-3, 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 r140-tall-162089128100566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 ;