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.r075-tall-162039097100060.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 gold2020
Input is DES-PT-40a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 83K 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 DES-PT-40a-ReachabilityFireability-00
FORMULA_NAME DES-PT-40a-ReachabilityFireability-01
FORMULA_NAME DES-PT-40a-ReachabilityFireability-02
FORMULA_NAME DES-PT-40a-ReachabilityFireability-03
FORMULA_NAME DES-PT-40a-ReachabilityFireability-04
FORMULA_NAME DES-PT-40a-ReachabilityFireability-05
FORMULA_NAME DES-PT-40a-ReachabilityFireability-06
FORMULA_NAME DES-PT-40a-ReachabilityFireability-07
FORMULA_NAME DES-PT-40a-ReachabilityFireability-08
FORMULA_NAME DES-PT-40a-ReachabilityFireability-09
FORMULA_NAME DES-PT-40a-ReachabilityFireability-10
FORMULA_NAME DES-PT-40a-ReachabilityFireability-11
FORMULA_NAME DES-PT-40a-ReachabilityFireability-12
FORMULA_NAME DES-PT-40a-ReachabilityFireability-13
FORMULA_NAME DES-PT-40a-ReachabilityFireability-14
FORMULA_NAME DES-PT-40a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620509853021

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 21:37:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 21:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 21:37:35] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-08 21:37:35] [INFO ] Transformed 274 places.
[2021-05-08 21:37:35] [INFO ] Transformed 231 transitions.
[2021-05-08 21:37:35] [INFO ] Found NUPN structural information;
[2021-05-08 21:37:35] [INFO ] Parsed PT model containing 274 places and 231 transitions in 107 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-40a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 224 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0]
FORMULA DES-PT-40a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 217 rows 274 cols
[2021-05-08 21:37:35] [INFO ] Computed 59 place invariants in 21 ms
[2021-05-08 21:37:35] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2021-05-08 21:37:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2021-05-08 21:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:36] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2021-05-08 21:37:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2021-05-08 21:37:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2021-05-08 21:37:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:37] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2021-05-08 21:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 21:37:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-08 21:37:37] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 18 ms.
[2021-05-08 21:37:38] [INFO ] Added : 187 causal constraints over 38 iterations in 1074 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 21:37:38] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2021-05-08 21:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:39] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2021-05-08 21:37:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2021-05-08 21:37:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 21:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:39] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2021-05-08 21:37:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 21:37:39] [INFO ] Deduced a trap composed of 19 places in 114 ms
[2021-05-08 21:37:39] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2021-05-08 21:37:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2021-05-08 21:37:39] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 17 ms.
[2021-05-08 21:37:40] [INFO ] Added : 161 causal constraints over 33 iterations in 778 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 21:37:40] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2021-05-08 21:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:41] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2021-05-08 21:37:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 21:37:41] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 55 ms returned sat
[2021-05-08 21:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:41] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2021-05-08 21:37:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 21:37:41] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 17 ms.
[2021-05-08 21:37:42] [INFO ] Added : 146 causal constraints over 30 iterations in 651 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 21:37:42] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 21:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:43] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2021-05-08 21:37:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 21:37:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2021-05-08 21:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:43] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2021-05-08 21:37:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:37:43] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 18 ms.
[2021-05-08 21:37:44] [INFO ] Added : 196 causal constraints over 40 iterations in 743 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 21:37:44] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2021-05-08 21:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:45] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2021-05-08 21:37:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 72 ms returned sat
[2021-05-08 21:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:46] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2021-05-08 21:37:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:46] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 17 ms.
[2021-05-08 21:37:46] [INFO ] Added : 99 causal constraints over 21 iterations in 593 ms. Result :sat
[2021-05-08 21:37:46] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2021-05-08 21:37:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 21:37:46] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 21:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:47] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2021-05-08 21:37:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 21:37:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 21:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:47] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2021-05-08 21:37:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:47] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 14 ms.
[2021-05-08 21:37:48] [INFO ] Added : 210 causal constraints over 42 iterations in 823 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-08 21:37:48] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 21:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:48] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2021-05-08 21:37:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:48] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2021-05-08 21:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:49] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-08 21:37:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:37:49] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 17 ms.
[2021-05-08 21:37:50] [INFO ] Added : 190 causal constraints over 38 iterations in 994 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2021-05-08 21:37:50] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 21:37:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 21:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:50] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-05-08 21:37:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2021-05-08 21:37:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 21:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:51] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-08 21:37:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:51] [INFO ] Deduced a trap composed of 9 places in 62 ms
[2021-05-08 21:37:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-08 21:37:51] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 11 ms.
[2021-05-08 21:37:51] [INFO ] Added : 137 causal constraints over 28 iterations in 761 ms. Result :sat
[2021-05-08 21:37:52] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2021-05-08 21:37:52] [INFO ] Deduced a trap composed of 18 places in 43 ms
[2021-05-08 21:37:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 21:37:52] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 21:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:53] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2021-05-08 21:37:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 21:37:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2021-05-08 21:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:53] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2021-05-08 21:37:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:37:53] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 12 ms.
[2021-05-08 21:37:54] [INFO ] Added : 214 causal constraints over 43 iterations in 951 ms. Result :sat
[2021-05-08 21:37:54] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2021-05-08 21:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 21:37:54] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 21:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:54] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2021-05-08 21:37:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 21:37:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 21:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:55] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2021-05-08 21:37:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:55] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 12 ms.
[2021-05-08 21:37:56] [INFO ] Added : 174 causal constraints over 35 iterations in 696 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 21:37:56] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 21:37:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2021-05-08 21:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:56] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2021-05-08 21:37:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:56] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 56 ms returned sat
[2021-05-08 21:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:57] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2021-05-08 21:37:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:37:57] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 10 ms.
[2021-05-08 21:37:57] [INFO ] Added : 122 causal constraints over 25 iterations in 695 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 21:37:57] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 21:37:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 21:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:58] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2021-05-08 21:37:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:37:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 21:37:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 72 ms returned sat
[2021-05-08 21:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:37:58] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-08 21:37:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:37:58] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 13 ms.
[2021-05-08 21:37:59] [INFO ] Added : 152 causal constraints over 31 iterations in 812 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 156900 steps, including 3720 resets, run finished after 661 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 86100 steps, including 1878 resets, run finished after 334 ms. (steps per millisecond=257 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-40a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 146000 steps, including 3119 resets, run finished after 559 ms. (steps per millisecond=261 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 210000 steps, including 5044 resets, run finished after 669 ms. (steps per millisecond=313 ) properties seen :[1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1] could not realise parikh vector
FORMULA DES-PT-40a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 100900 steps, including 2259 resets, run finished after 316 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 178400 steps, including 4298 resets, run finished after 548 ms. (steps per millisecond=325 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 194900 steps, including 4698 resets, run finished after 638 ms. (steps per millisecond=305 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 42900 steps, including 699 resets, run finished after 150 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 195300 steps, including 4722 resets, run finished after 639 ms. (steps per millisecond=305 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 144300 steps, including 3411 resets, run finished after 455 ms. (steps per millisecond=317 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 144900 steps, including 3515 resets, run finished after 467 ms. (steps per millisecond=310 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 172900 steps, including 4083 resets, run finished after 547 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 21 out of 274 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 274 transition count 215
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 273 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 273 transition count 214
Applied a total of 7 rules in 82 ms. Remains 273 /274 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/274 places, 214/217 transitions.
Incomplete random walk after 1000000 steps, including 13245 resets, run finished after 3066 ms. (steps per millisecond=326 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6529 resets, run finished after 1590 ms. (steps per millisecond=628 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2388 resets, run finished after 1255 ms. (steps per millisecond=796 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2244 resets, run finished after 1166 ms. (steps per millisecond=857 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2367 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1721 resets, run finished after 1265 ms. (steps per millisecond=790 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 15505574 steps, run timeout after 30001 ms. (steps per millisecond=516 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 15505574 steps, saw 1910889 distinct states, run finished after 30001 ms. (steps per millisecond=516 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 21:38:45] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-08 21:38:45] [INFO ] [Real]Absence check using 37 positive place invariants in 51 ms returned sat
[2021-05-08 21:38:45] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 24 ms returned sat
[2021-05-08 21:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:46] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2021-05-08 21:38:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 21:38:47] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 918 ms returned sat
[2021-05-08 21:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:47] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2021-05-08 21:38:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 21:38:47] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-08 21:38:47] [INFO ] Computed and/alt/rep : 213/996/213 causal constraints in 9 ms.
[2021-05-08 21:38:48] [INFO ] Added : 161 causal constraints over 33 iterations in 811 ms. Result :sat
[2021-05-08 21:38:48] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2021-05-08 21:38:48] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2021-05-08 21:38:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 21:38:48] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:48] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 21:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:49] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2021-05-08 21:38:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 21:38:49] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 27 ms returned sat
[2021-05-08 21:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:50] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2021-05-08 21:38:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 10 ms returned sat
[2021-05-08 21:38:50] [INFO ] Computed and/alt/rep : 213/996/213 causal constraints in 12 ms.
[2021-05-08 21:38:51] [INFO ] Added : 183 causal constraints over 37 iterations in 935 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 21:38:51] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 21:38:51] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:51] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2021-05-08 21:38:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 28 ms returned sat
[2021-05-08 21:38:51] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 43 ms returned sat
[2021-05-08 21:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:52] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2021-05-08 21:38:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:38:52] [INFO ] Computed and/alt/rep : 213/996/213 causal constraints in 12 ms.
[2021-05-08 21:38:52] [INFO ] Added : 209 causal constraints over 42 iterations in 780 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 21:38:53] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:53] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:53] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2021-05-08 21:38:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:53] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 21:38:53] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 376 ms returned sat
[2021-05-08 21:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:54] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2021-05-08 21:38:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:38:54] [INFO ] Deduced a trap composed of 7 places in 59 ms
[2021-05-08 21:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2021-05-08 21:38:54] [INFO ] Computed and/alt/rep : 213/996/213 causal constraints in 20 ms.
[2021-05-08 21:38:54] [INFO ] Added : 193 causal constraints over 39 iterations in 717 ms. Result :sat
[2021-05-08 21:38:54] [INFO ] Deduced a trap composed of 9 places in 52 ms
[2021-05-08 21:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 21:38:55] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 21:38:55] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 21:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:55] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2021-05-08 21:38:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:38:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 21:38:55] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 72 ms returned sat
[2021-05-08 21:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:38:56] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2021-05-08 21:38:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 13 ms returned sat
[2021-05-08 21:38:56] [INFO ] Computed and/alt/rep : 213/996/213 causal constraints in 12 ms.
[2021-05-08 21:38:56] [INFO ] Added : 181 causal constraints over 37 iterations in 818 ms. Result :sat
[2021-05-08 21:38:56] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2021-05-08 21:38:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 145900 steps, including 2135 resets, run finished after 459 ms. (steps per millisecond=317 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 199400 steps, including 2882 resets, run finished after 644 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 190200 steps, including 2796 resets, run finished after 604 ms. (steps per millisecond=314 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 99500 steps, including 1478 resets, run finished after 325 ms. (steps per millisecond=306 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 136800 steps, including 1686 resets, run finished after 441 ms. (steps per millisecond=310 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 21 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 23 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 21:38:59] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-08 21:39:00] [INFO ] Implicit Places using invariants in 849 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 851 ms to find 1 implicit places.
[2021-05-08 21:39:00] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:00] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 21:39:00] [INFO ] Dead Transitions using invariants and state equation in 487 ms returned []
Starting structural reductions, iteration 1 : 272/273 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2021-05-08 21:39:00] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:00] [INFO ] Computed 60 place invariants in 15 ms
[2021-05-08 21:39:01] [INFO ] Dead Transitions using invariants and state equation in 476 ms returned []
Finished structural reductions, in 2 iterations. Remains : 272/273 places, 214/214 transitions.
Incomplete random walk after 1000000 steps, including 13221 resets, run finished after 3104 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6519 resets, run finished after 1565 ms. (steps per millisecond=638 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2396 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2229 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2386 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1721 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 15900052 steps, run timeout after 30001 ms. (steps per millisecond=529 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 15900052 steps, saw 1957816 distinct states, run finished after 30001 ms. (steps per millisecond=529 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:40] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:39:40] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:39:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 21:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:41] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2021-05-08 21:39:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 21:39:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 72 ms returned sat
[2021-05-08 21:39:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:42] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2021-05-08 21:39:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 21:39:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2021-05-08 21:39:42] [INFO ] Deduced a trap composed of 16 places in 57 ms
[2021-05-08 21:39:42] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2021-05-08 21:39:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2021-05-08 21:39:42] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 12 ms.
[2021-05-08 21:39:43] [INFO ] Added : 161 causal constraints over 33 iterations in 900 ms. Result :sat
[2021-05-08 21:39:43] [INFO ] Deduced a trap composed of 18 places in 148 ms
[2021-05-08 21:39:43] [INFO ] Deduced a trap composed of 7 places in 116 ms
[2021-05-08 21:39:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2021-05-08 21:39:43] [INFO ] [Real]Absence check using 36 positive place invariants in 58 ms returned sat
[2021-05-08 21:39:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2021-05-08 21:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:44] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2021-05-08 21:39:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 24 ms returned sat
[2021-05-08 21:39:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-08 21:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:45] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2021-05-08 21:39:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 21:39:45] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 16 ms.
[2021-05-08 21:39:46] [INFO ] Added : 197 causal constraints over 40 iterations in 847 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 21:39:46] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:39:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 21:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:46] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2021-05-08 21:39:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:39:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 21:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:47] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2021-05-08 21:39:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:39:47] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 10 ms.
[2021-05-08 21:39:48] [INFO ] Added : 209 causal constraints over 43 iterations in 797 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-08 21:39:48] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:39:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 21:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:48] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-05-08 21:39:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:39:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:48] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2021-05-08 21:39:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 21:39:48] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 12 ms.
[2021-05-08 21:39:49] [INFO ] Added : 193 causal constraints over 39 iterations in 773 ms. Result :sat
[2021-05-08 21:39:49] [INFO ] Deduced a trap composed of 8 places in 19 ms
[2021-05-08 21:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 21:39:49] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:39:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 21:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:50] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2021-05-08 21:39:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:39:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2021-05-08 21:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:50] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2021-05-08 21:39:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:39:50] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2021-05-08 21:39:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-08 21:39:50] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 11 ms.
[2021-05-08 21:39:51] [INFO ] Added : 174 causal constraints over 35 iterations in 860 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 148500 steps, including 2282 resets, run finished after 480 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 200900 steps, including 2920 resets, run finished after 643 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 187700 steps, including 2713 resets, run finished after 614 ms. (steps per millisecond=305 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 187900 steps, including 2859 resets, run finished after 598 ms. (steps per millisecond=314 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 135700 steps, including 1945 resets, run finished after 457 ms. (steps per millisecond=296 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 21 out of 272 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:54] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 21:39:54] [INFO ] Implicit Places using invariants in 616 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:54] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 21:39:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 21:39:56] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2021-05-08 21:39:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:56] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:39:56] [INFO ] Dead Transitions using invariants and state equation in 536 ms returned []
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 100000 steps, including 1316 resets, run finished after 316 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:39:57] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 21:39:57] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:39:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 21:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:58] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2021-05-08 21:39:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:39:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2021-05-08 21:39:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 21:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:39:58] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2021-05-08 21:39:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 21:39:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 21:39:58] [INFO ] Deduced a trap composed of 16 places in 74 ms
[2021-05-08 21:39:59] [INFO ] Deduced a trap composed of 19 places in 39 ms
[2021-05-08 21:39:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2021-05-08 21:39:59] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 11 ms.
[2021-05-08 21:39:59] [INFO ] Added : 161 causal constraints over 33 iterations in 839 ms. Result :sat
[2021-05-08 21:39:59] [INFO ] Deduced a trap composed of 18 places in 61 ms
[2021-05-08 21:40:00] [INFO ] Deduced a trap composed of 7 places in 53 ms
[2021-05-08 21:40:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2021-05-08 21:40:00] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:40:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 21:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:00] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2021-05-08 21:40:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-08 21:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:01] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2021-05-08 21:40:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2021-05-08 21:40:01] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 11 ms.
[2021-05-08 21:40:02] [INFO ] Added : 197 causal constraints over 40 iterations in 739 ms. Result :sat
[2021-05-08 21:40:02] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:40:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:02] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-08 21:40:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:40:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 21:40:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:02] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2021-05-08 21:40:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:40:02] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 12 ms.
[2021-05-08 21:40:03] [INFO ] Added : 209 causal constraints over 43 iterations in 800 ms. Result :sat
[2021-05-08 21:40:03] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:40:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:04] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-08 21:40:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 21:40:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:04] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-08 21:40:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 21:40:04] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 12 ms.
[2021-05-08 21:40:05] [INFO ] Added : 193 causal constraints over 39 iterations in 768 ms. Result :sat
[2021-05-08 21:40:05] [INFO ] Deduced a trap composed of 8 places in 18 ms
[2021-05-08 21:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-08 21:40:05] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 21:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:05] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2021-05-08 21:40:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2021-05-08 21:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:06] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2021-05-08 21:40:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 21:40:06] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2021-05-08 21:40:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-08 21:40:06] [INFO ] Computed and/alt/rep : 213/993/213 causal constraints in 10 ms.
[2021-05-08 21:40:07] [INFO ] Added : 174 causal constraints over 35 iterations in 919 ms. Result :sat
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2021-05-08 21:40:07] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 21:40:07] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 21:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:07] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2021-05-08 21:40:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 21:40:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 21:40:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:08] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2021-05-08 21:40:08] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2021-05-08 21:40:08] [INFO ] Deduced a trap composed of 19 places in 39 ms
[2021-05-08 21:40:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2021-05-08 21:40:08] [INFO ] Computed and/alt/rep : 213/989/213 causal constraints in 11 ms.
[2021-05-08 21:40:09] [INFO ] Added : 158 causal constraints over 32 iterations in 923 ms. Result :sat
[2021-05-08 21:40:09] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2021-05-08 21:40:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 21:40:09] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 21:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:10] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2021-05-08 21:40:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:40:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-08 21:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:11] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2021-05-08 21:40:11] [INFO ] Computed and/alt/rep : 213/989/213 causal constraints in 11 ms.
[2021-05-08 21:40:11] [INFO ] Added : 197 causal constraints over 40 iterations in 811 ms. Result :sat
[2021-05-08 21:40:11] [INFO ] Deduced a trap composed of 8 places in 19 ms
[2021-05-08 21:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-08 21:40:12] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:12] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2021-05-08 21:40:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2021-05-08 21:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:12] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2021-05-08 21:40:12] [INFO ] Computed and/alt/rep : 213/989/213 causal constraints in 11 ms.
[2021-05-08 21:40:13] [INFO ] Added : 182 causal constraints over 37 iterations in 631 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 21:40:13] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:40:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2021-05-08 21:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:13] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-08 21:40:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 21:40:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 21:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:14] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2021-05-08 21:40:14] [INFO ] Computed and/alt/rep : 213/989/213 causal constraints in 10 ms.
[2021-05-08 21:40:15] [INFO ] Added : 189 causal constraints over 38 iterations in 963 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 21:40:15] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 21:40:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 21:40:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:15] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-08 21:40:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:40:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 21:40:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2021-05-08 21:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:40:16] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2021-05-08 21:40:16] [INFO ] Deduced a trap composed of 6 places in 10 ms
[2021-05-08 21:40:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-08 21:40:16] [INFO ] Computed and/alt/rep : 213/989/213 causal constraints in 12 ms.
[2021-05-08 21:40:16] [INFO ] Added : 170 causal constraints over 35 iterations in 672 ms. Result :sat
[2021-05-08 21:40:16] [INFO ] Deduced a trap composed of 12 places in 35 ms
[2021-05-08 21:40:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 21:40:16] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-08 21:40:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-08 21:40:17] [INFO ] Flatten gal took : 136 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-40a @ 3570 seconds

FORMULA DES-PT-40a-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for ReachabilityFireability @ DES-PT-40a

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 21:40:18 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p100) AND (1 <= p188))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 619,
"markings": 620,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p4) AND (1 <= p191) AND (1 <= p193))))",
"processed_size": 51,
"rewrites": 1
},
"result":
{
"edges": 1810,
"markings": 1811,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p52) AND (1 <= p267) AND ((p72 <= 0)) AND ((p104 <= 0) OR (p188 <= 0)))))",
"processed_size": 87,
"rewrites": 1
},
"result":
{
"edges": 37086,
"markings": 31234,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((p93 <= 1) AND (1 <= p93) AND (1 <= p188)) OR ((1 <= p42) AND (1 <= p267) AND (1 <= p128) AND (1 <= p164)))))",
"processed_size": 118,
"rewrites": 1
},
"result":
{
"edges": 1693,
"markings": 1620,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p138) AND (1 <= p164) AND (((1 <= p89) AND (1 <= p188)) OR ((1 <= p30) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p96) AND (1 <= p188) AND (1 <= p32) AND (1 <= p191) AND (1 <= p193))) AND ((p168 <= 0) OR (p252 <= 0) OR (p50 <= 0) OR (p267 <= 0) OR ((1 <= p104) AND (1 <= p188))))))",
"processed_size": 300,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 98,
"problems": 15
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 30476,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1058,
"conflict_clusters": 44,
"places": 272,
"places_significant": 212,
"singleton_clusters": 0,
"transitions": 214
},
"result":
{
"preliminary_value": "yes yes yes yes yes ",
"value": "yes yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 486/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 272
lola: finding significant places
lola: 272 places, 214 transitions, 212 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: E (F (((1 <= p138) AND (1 <= p164) AND (((1 <= p89) AND (1 <= p188)) OR ((1 <= p30) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p96) AND (1 <= p188) AND (1 <= p32) AND (1 <= p191) AND (1 <= p193))) AND ((p168 <= 0) OR (p252 <= 0) OR (p50 <= 0) OR (p267 <= 0) OR ((1 <= p104) AND (1 <= p188)))))) : E (F ((((p93 <= 1) AND (1 <= p93) AND (1 <= p188)) OR ((1 <= p42) AND (1 <= p267) AND (1 <= p128) AND (1 <= p164))))) : E (F (((1 <= p4) AND (1 <= p191) AND (1 <= p193)))) : E (F (((1 <= p100) AND (1 <= p188)))) : E (F (((1 <= p52) AND (1 <= p267) AND ((p72 <= 0)) AND ((p104 <= 0) OR (p188 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p100) AND (1 <= p188))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p100) AND (1 <= p188))))
lola: processed formula length: 37
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p100) AND (1 <= p188))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 620 markings, 619 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p4) AND (1 <= p191) AND (1 <= p193))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p4) AND (1 <= p191) AND (1 <= p193))))
lola: processed formula length: 51
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p191) AND (1 <= p193))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1811 markings, 1810 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: subprocess 2 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p52) AND (1 <= p267) AND ((p72 <= 0)) AND ((p104 <= 0) OR (p188 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p52) AND (1 <= p267) AND ((p72 <= 0)) AND ((p104 <= 0) OR (p188 <= 0)))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p52) AND (1 <= p267) AND ((p72 <= 0)) AND ((p104 <= 0) OR (p188 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: calling and running sara
lola: ========================================
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31234 markings, 37086 edges
lola: ========================================
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p93 <= 1) AND (1 <= p93) AND (1 <= p188)) OR ((1 <= p42) AND (1 <= p267) AND (1 <= p128) AND (1 <= p164)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p93 <= 1) AND (1 <= p93) AND (1 <= p188)) OR ((1 <= p42) AND (1 <= p267) AND (1 <= p128) AND (1 <= p164)))))
lola: processed formula length: 118
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p93 <= 1) AND (1 <= p93) AND (1 <= p188)) OR ((1 <= p42) AND (1 <= p267) AND (1 <= p128) AND (1 <= p164)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1620 markings, 1693 edges
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: subprocess 4 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p138) AND (1 <= p164) AND (((1 <= p89) AND (1 <= p188)) OR ((1 <= p30) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p96) AND (1 <= p188) AND (1 <= p32) AND (1 <= p191) AND (1 <= p193))) AND ((p168 <= 0) OR (p252 <= 0) OR (p50 <= 0) OR (p267 <= 0) OR ((1 <= p104) AND (1 <= p188))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: ========================================
lola: processed formula: E (F (((1 <= p138) AND (1 <= p164) AND (((1 <= p89) AND (1 <= p188)) OR ((1 <= p30) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p96) AND (1 <= p188) AND (1 <= p32) AND (1 <= p191) AND (1 <= p193))) AND ((p168 <= 0) OR (p252 <= 0) OR (p50 <= 0) OR (p267 <= 0) OR ((1 <= p104) AND (1 <= p188))))))
lola: processed formula length: 300
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state equation: calling and running sara
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p138) AND (1 <= p164) AND (((1 <= p89) AND (1 <= p188)) OR ((1 <= p30) AND (1 <= p191) AND (1 <= p193)) OR ((1 <= p96) AND (1 <= p188) AND (1 <= p32) AND (1 <= p191) AND (1 <= p193))) AND ((p168 <= 0) OR (p252 <= 0) OR (p50 <= 0) OR (p267 <= 0) OR ((1 <= p104) AND (1 <= p188))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 98 literals and 15 conjunctive subformulas
sara: try reading problem file ReachabilityFireability-3-0.sara.
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes
lola:
preliminary result: yes yes yes yes yes
lola: memory consumption: 30476 KB
lola: time consumption: 9 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16112720 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16112224 kB

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is DES-PT-40a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;