About the Execution of GreatSPN+red for DoubleLock-PT-p3s1
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131500629.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleLock-PT-p3s1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500629
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Apr 12 13:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 13:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716397592190
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:06:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 17:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:06:33] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-22 17:06:33] [INFO ] Transformed 46 places.
[2024-05-22 17:06:33] [INFO ] Transformed 80 transitions.
[2024-05-22 17:06:33] [INFO ] Parsed PT model containing 46 places and 80 transitions and 324 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 13
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA DoubleLock-PT-p3s1-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s1-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 17:06:33] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 40 cols
[2024-05-22 17:06:33] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, +inf, 1, +inf, +inf, 1, 10, 1]
RANDOM walk for 10000 steps (64 resets) in 36 ms. (270 steps per ms)
FORMULA DoubleLock-PT-p3s1-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (58 resets) in 53 ms. (926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 6, 6, 12, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-22 17:06:33] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:33] [INFO ] Invariant cache hit.
[2024-05-22 17:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 17:06:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-22 17:06:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 17:06:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 17:06:33] [INFO ] [Real]Added 12 Read/Feed constraints in 5 ms returned sat
[2024-05-22 17:06:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:06:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:33] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 17:06:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2024-05-22 17:06:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 7 ms to minimize.
[2024-05-22 17:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-22 17:06:34] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 7 ms.
[2024-05-22 17:06:34] [INFO ] Added : 12 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2024-05-22 17:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
[2024-05-22 17:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-22 17:06:34] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 7 ms.
[2024-05-22 17:06:34] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 16 ms.
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-22 17:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-22 17:06:34] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-22 17:06:34] [INFO ] Added : 16 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 18 ms.
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:34] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-22 17:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-22 17:06:34] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-22 17:06:34] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-22 17:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-22 17:06:34] [INFO ] Added : 11 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 12 ms.
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 17:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-22 17:06:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:34] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 17:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 17:06:34] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 4 ms.
[2024-05-22 17:06:34] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 6, 6, 12, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 6, 6, 12, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 76/76 transitions.
Graph (complete) has 153 edges and 40 vertex of which 37 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 37 /40 variables (removed 3) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 37/40 places, 76/76 transitions.
[2024-05-22 17:06:35] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {8=1, 21=1, 38=1, 60=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 21=1, 38=1, 59=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :[11, 3, 3, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[13, 6, 6, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-22 17:06:35] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2024-05-22 17:06:35] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[13, 6, 6, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (6506 resets) in 995 ms. (1004 steps per ms)
FORMULA DoubleLock-PT-p3s1-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000003 steps (2681 resets) in 1203 ms. (2491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 28, 17] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:06:37] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:37] [INFO ] Invariant cache hit.
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 17:06:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 17:06:37] [INFO ] [Real]Added 12 Read/Feed constraints in 3 ms returned sat
[2024-05-22 17:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:37] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-22 17:06:37] [INFO ] Added : 12 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 15 ms.
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:37] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-22 17:06:37] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 12 ms.
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:37] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 4 ms.
[2024-05-22 17:06:37] [INFO ] Added : 20 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 28, 17] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 28, 17] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 7 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 37/37 places, 76/76 transitions.
[2024-05-22 17:06:37] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {8=1, 21=1, 38=1, 60=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 21=1, 38=1, 59=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 92 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :[7, 4, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 28, 17] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:06:38] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 28, 17] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (6482 resets) in 888 ms. (1124 steps per ms)
BEST_FIRST walk for 3000003 steps (2709 resets) in 1057 ms. (2835 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 28, 17] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:06:39] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:39] [INFO ] Invariant cache hit.
[2024-05-22 17:06:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 17:06:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 17:06:40] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 4 ms.
[2024-05-22 17:06:40] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 13 ms.
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:40] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 4 ms.
[2024-05-22 17:06:40] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Real]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 17:06:40] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:40] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-22 17:06:40] [INFO ] Added : 20 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 28, 17] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 28, 17] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 37/37 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-22 17:06:40] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:40] [INFO ] Invariant cache hit.
[2024-05-22 17:06:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 17:06:40] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:40] [INFO ] Invariant cache hit.
[2024-05-22 17:06:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 17:06:40] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-22 17:06:40] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 17:06:40] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:40] [INFO ] Invariant cache hit.
[2024-05-22 17:06:40] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 61/98 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 51 constraints, problems are : Problem set: 0 solved, 74 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 61/98 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 74/125 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 125 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 1937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2072 ms. Remains : 37/37 places, 76/76 transitions.
[2024-05-22 17:06:42] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {8=1, 21=1, 38=1, 60=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 21=1, 38=1, 59=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 92 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :[6, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 28, 17] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:06:42] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 28, 17] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (6602 resets) in 857 ms. (1165 steps per ms)
BEST_FIRST walk for 3000002 steps (2784 resets) in 1055 ms. (2840 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 28, 17] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:06:44] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:44] [INFO ] Invariant cache hit.
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 17:06:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 17:06:44] [INFO ] [Real]Added 12 Read/Feed constraints in 3 ms returned sat
[2024-05-22 17:06:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:44] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 3 ms.
[2024-05-22 17:06:44] [INFO ] Added : 12 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 6 ms.
[2024-05-22 17:06:44] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 10 ms.
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-22 17:06:44] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2024-05-22 17:06:44] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-22 17:06:44] [INFO ] Added : 20 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 28, 17] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 28, 17] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-22 17:06:44] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:44] [INFO ] Invariant cache hit.
[2024-05-22 17:06:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 17:06:45] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:45] [INFO ] Invariant cache hit.
[2024-05-22 17:06:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 17:06:45] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-22 17:06:45] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 17:06:45] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:45] [INFO ] Invariant cache hit.
[2024-05-22 17:06:45] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 61/98 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 51 constraints, problems are : Problem set: 0 solved, 74 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 61/98 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 74/125 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 125 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 1852ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 1853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1959 ms. Remains : 37/37 places, 76/76 transitions.
[2024-05-22 17:06:46] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {8=1, 21=1, 38=1, 60=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {8=1, 21=1, 38=1, 59=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 96 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :[2147483647, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 28, 17] Max Struct:[+inf, +inf, +inf]
[2024-05-22 17:06:47] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 28, 17] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (6556 resets) in 861 ms. (1160 steps per ms)
FORMULA DoubleLock-PT-p3s1-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 2000002 steps (2714 resets) in 699 ms. (2857 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[29, 18] Max Struct:[+inf, +inf]
[2024-05-22 17:06:48] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2024-05-22 17:06:48] [INFO ] Invariant cache hit.
[2024-05-22 17:06:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 17:06:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 17:06:48] [INFO ] [Real]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 3 ms.
[2024-05-22 17:06:48] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 11 ms.
[2024-05-22 17:06:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-22 17:06:48] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-22 17:06:48] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2024-05-22 17:06:48] [INFO ] Added : 20 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[29, 18] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[29, 18] Max Struct:[+inf, +inf]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 76/76 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 75
Applied a total of 1 rules in 10 ms. Remains 37 /37 variables (removed 0) and now considering 75/76 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 37/37 places, 75/76 transitions.
[2024-05-22 17:06:48] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {7=1, 20=1, 37=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 20=1, 37=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :[2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf] Max Struct:[+inf, +inf]
[2024-05-22 17:06:48] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2024-05-22 17:06:48] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1089 ms. (917 steps per ms)
FORMULA DoubleLock-PT-p3s1-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16755 ms.
ITS solved all properties within timeout
BK_STOP 1716397610147
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="DoubleLock-PT-p3s1"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleLock-PT-p3s1, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131500629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s1.tgz
mv DoubleLock-PT-p3s1 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;