MCC'2020 - Execution of r174-csrt-158987853500660

About the Execution of ITS-LoLa for Peterson-COL-2

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15745.230	3600000.00	62982.00	437.30	??T????????????F	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853500660.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Peterson-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853500660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 42K Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-2-CTLFireability-00
FORMULA_NAME Peterson-COL-2-CTLFireability-01
FORMULA_NAME Peterson-COL-2-CTLFireability-02
FORMULA_NAME Peterson-COL-2-CTLFireability-03
FORMULA_NAME Peterson-COL-2-CTLFireability-04
FORMULA_NAME Peterson-COL-2-CTLFireability-05
FORMULA_NAME Peterson-COL-2-CTLFireability-06
FORMULA_NAME Peterson-COL-2-CTLFireability-07
FORMULA_NAME Peterson-COL-2-CTLFireability-08
FORMULA_NAME Peterson-COL-2-CTLFireability-09
FORMULA_NAME Peterson-COL-2-CTLFireability-10
FORMULA_NAME Peterson-COL-2-CTLFireability-11
FORMULA_NAME Peterson-COL-2-CTLFireability-12
FORMULA_NAME Peterson-COL-2-CTLFireability-13
FORMULA_NAME Peterson-COL-2-CTLFireability-14
FORMULA_NAME Peterson-COL-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591162064229

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:27:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:27:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 05:27:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 728 ms
[2020-06-03 05:27:47] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-06-03 05:27:47] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 47 ms.
[2020-06-03 05:27:47] [INFO ] Computed order based on color domains.
[2020-06-03 05:27:47] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 17 ms.
[2020-06-03 05:27:47] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 55 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 347 ms. (steps per millisecond=288 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0]
[2020-06-03 05:27:48] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-06-03 05:27:48] [INFO ] Computed 11 place invariants in 12 ms
[2020-06-03 05:27:48] [INFO ] [Real]Absence check using 8 positive place invariants in 24 ms returned sat
[2020-06-03 05:27:48] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-03 05:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:48] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-06-03 05:27:48] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-03 05:27:48] [INFO ] [Real]Added 26 Read/Feed constraints in 17 ms returned sat
[2020-06-03 05:27:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2020-06-03 05:27:48] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:48] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-06-03 05:27:48] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:27:48] [INFO ] Deduced a trap composed of 11 places in 105 ms
[2020-06-03 05:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2020-06-03 05:27:48] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 32 ms.
[2020-06-03 05:27:49] [INFO ] Added : 117 causal constraints over 24 iterations in 439 ms. Result :sat
[2020-06-03 05:27:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:27:49] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:49] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-06-03 05:27:49] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-06-03 05:27:49] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:27:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:27:49] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-03 05:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:49] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2020-06-03 05:27:49] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:27:49] [INFO ] Deduced a trap composed of 34 places in 46 ms
[2020-06-03 05:27:49] [INFO ] Deduced a trap composed of 12 places in 46 ms
[2020-06-03 05:27:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2020-06-03 05:27:49] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 11 ms.
[2020-06-03 05:27:50] [INFO ] Added : 117 causal constraints over 24 iterations in 310 ms. Result :sat
[2020-06-03 05:27:50] [INFO ] Deduced a trap composed of 8 places in 23 ms
[2020-06-03 05:27:50] [INFO ] Deduced a trap composed of 14 places in 26 ms
[2020-06-03 05:27:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:27:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:50] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Nat]Added 26 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:27:50] [INFO ] Deduced a trap composed of 26 places in 116 ms
[2020-06-03 05:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2020-06-03 05:27:50] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-06-03 05:27:50] [INFO ] Added : 117 causal constraints over 24 iterations in 400 ms. Result :sat
[2020-06-03 05:27:51] [INFO ] Deduced a trap composed of 12 places in 250 ms
[2020-06-03 05:27:51] [INFO ] Deduced a trap composed of 28 places in 80 ms
[2020-06-03 05:27:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2020-06-03 05:27:51] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:27:51] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:51] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-03 05:27:51] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:27:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:27:51] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:51] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-06-03 05:27:51] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:27:51] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:27:51] [INFO ] Added : 117 causal constraints over 24 iterations in 322 ms. Result :sat
[2020-06-03 05:27:51] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2020-06-03 05:27:51] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-06-03 05:27:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2020-06-03 05:27:52] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:52] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:27:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:52] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:27:52] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-06-03 05:27:52] [INFO ] Added : 117 causal constraints over 24 iterations in 335 ms. Result :sat
[2020-06-03 05:27:52] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2020-06-03 05:27:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-06-03 05:27:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:53] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Real]Added 26 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:27:53] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 39 ms.
[2020-06-03 05:27:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:53] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:53] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 14 ms.
[2020-06-03 05:27:53] [INFO ] Added : 117 causal constraints over 24 iterations in 385 ms. Result :sat
[2020-06-03 05:27:53] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:53] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Real]Added 26 Read/Feed constraints in 21 ms returned sat
[2020-06-03 05:27:53] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-06-03 05:27:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:27:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:54] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:54] [INFO ] Deduced a trap composed of 24 places in 47 ms
[2020-06-03 05:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-06-03 05:27:54] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 11 ms.
[2020-06-03 05:27:54] [INFO ] Added : 117 causal constraints over 24 iterations in 309 ms. Result :sat
[2020-06-03 05:27:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:54] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:27:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:54] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2020-06-03 05:27:54] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-06-03 05:27:54] [INFO ] Deduced a trap composed of 26 places in 57 ms
[2020-06-03 05:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-06-03 05:27:54] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 11 ms.
[2020-06-03 05:27:55] [INFO ] Added : 117 causal constraints over 24 iterations in 256 ms. Result :sat
[2020-06-03 05:27:55] [INFO ] Deduced a trap composed of 12 places in 156 ms
[2020-06-03 05:27:55] [INFO ] Deduced a trap composed of 28 places in 116 ms
[2020-06-03 05:27:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2020-06-03 05:27:55] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:27:55] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 15 ms returned sat
[2020-06-03 05:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:55] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-06-03 05:27:55] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:27:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-03 05:27:55] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:55] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2020-06-03 05:27:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:55] [INFO ] Deduced a trap composed of 26 places in 42 ms
[2020-06-03 05:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2020-06-03 05:27:55] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 57 ms.
[2020-06-03 05:27:56] [INFO ] Added : 117 causal constraints over 24 iterations in 440 ms. Result :sat
[2020-06-03 05:27:56] [INFO ] Deduced a trap composed of 12 places in 78 ms
[2020-06-03 05:27:56] [INFO ] Deduced a trap composed of 28 places in 196 ms
[2020-06-03 05:27:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2020-06-03 05:27:56] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:27:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:56] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-06-03 05:27:56] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:27:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:27:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:56] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 05:27:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:56] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:27:57] [INFO ] Added : 117 causal constraints over 24 iterations in 274 ms. Result :sat
[2020-06-03 05:27:57] [INFO ] Deduced a trap composed of 15 places in 23 ms
[2020-06-03 05:27:57] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-06-03 05:27:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2020-06-03 05:27:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:57] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 22 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:57] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:57] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:27:57] [INFO ] Added : 117 causal constraints over 24 iterations in 380 ms. Result :sat
[2020-06-03 05:27:57] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2020-06-03 05:27:57] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2020-06-03 05:27:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2020-06-03 05:27:57] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:58] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:27:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:58] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:27:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:27:58] [INFO ] Added : 117 causal constraints over 24 iterations in 223 ms. Result :sat
[2020-06-03 05:27:58] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2020-06-03 05:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2020-06-03 05:27:58] [INFO ] [Real]Absence check using 8 positive place invariants in 34 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:58] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:27:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:58] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2020-06-03 05:27:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:27:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-06-03 05:27:59] [INFO ] Added : 117 causal constraints over 24 iterations in 491 ms. Result :sat
[2020-06-03 05:27:59] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-06-03 05:27:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-03 05:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:59] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2020-06-03 05:27:59] [INFO ] [Real]Added 26 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:27:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:27:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 39 ms returned sat
[2020-06-03 05:27:59] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 7 ms returned sat
[2020-06-03 05:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:00] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2020-06-03 05:28:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:28:00] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2020-06-03 05:28:00] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 05:28:00] [INFO ] Deduced a trap composed of 8 places in 56 ms
[2020-06-03 05:28:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2020-06-03 05:28:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:28:00] [INFO ] Added : 117 causal constraints over 24 iterations in 327 ms. Result :sat
[2020-06-03 05:28:00] [INFO ] Deduced a trap composed of 29 places in 26 ms
[2020-06-03 05:28:00] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2020-06-03 05:28:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2020-06-03 05:28:00] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:28:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:00] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-06-03 05:28:00] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:28:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 19 ms.
[2020-06-03 05:28:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 46 ms returned sat
[2020-06-03 05:28:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 24 ms returned sat
[2020-06-03 05:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:01] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2020-06-03 05:28:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:28:02] [INFO ] Deduced a trap composed of 12 places in 252 ms
[2020-06-03 05:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2020-06-03 05:28:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:28:02] [INFO ] Added : 117 causal constraints over 24 iterations in 708 ms. Result :sat
[2020-06-03 05:28:02] [INFO ] [Real]Absence check using 8 positive place invariants in 34 ms returned sat
[2020-06-03 05:28:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 5 ms returned sat
[2020-06-03 05:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:03] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:28:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:03] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:28:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:28:03] [INFO ] Added : 117 causal constraints over 24 iterations in 359 ms. Result :sat
[2020-06-03 05:28:03] [INFO ] [Real]Absence check using 8 positive place invariants in 35 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 33 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:03] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:28:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-06-03 05:28:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 35 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 5 ms returned sat
[2020-06-03 05:28:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:04] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:28:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:28:04] [INFO ] Added : 117 causal constraints over 24 iterations in 256 ms. Result :sat
[2020-06-03 05:28:04] [INFO ] Deduced a trap composed of 8 places in 61 ms
[2020-06-03 05:28:04] [INFO ] Deduced a trap composed of 14 places in 30 ms
[2020-06-03 05:28:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2020-06-03 05:28:04] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:04] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-06-03 05:28:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:04] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:28:04] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2020-06-03 05:28:04] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2020-06-03 05:28:04] [INFO ] Deduced a trap composed of 28 places in 31 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 40 places in 54 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 17 places in 40 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 25 places in 30 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 34 places in 26 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 22 places in 23 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 22 places in 21 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 37 places in 32 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 32 places in 56 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2020-06-03 05:28:05] [INFO ] Deduced a trap composed of 37 places in 27 ms
[2020-06-03 05:28:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 877 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 05:28:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 05:28:05] [INFO ] Flatten gal took : 43 ms
[2020-06-03 05:28:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 05:28:05] [INFO ] Flatten gal took : 23 ms
FORMULA Peterson-COL-2-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:28:05] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-03 05:28:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Peterson-COL-2 @ 3570 seconds

FORMULA Peterson-COL-2-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ Peterson-COL-2

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:28:06 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p95)",
"processed_size": 10,
"rewrites": 228
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p92)",
"processed_size": 10,
"rewrites": 228
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 12,
"adisj": 2,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "E (((((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82))) U ((1 <= p49) OR (1 <= p45) OR (1 <= p47))))",
"processed_size": 420,
"rewrites": 231
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 27
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))",
"processed_size": 177,
"rewrites": 231
},
"result":
{
"edges": 62262,
"markings": 20754,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 12,
"problems": 12
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 137656,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(E(G(**)))) OR E(F((E(G(**)) AND **)))) : E(G(**)) : (A(G(E(F(**)))) OR (E((** U **)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** AND ((A(X(**)) OR (** OR **)) AND **)))))))))) : (A(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))) : A(G(E(F(**)))) : (E(X((E(F(**)) AND (** AND (** AND (** AND (** AND (** AND **)))))))) OR A((** U **))) : A(G(E(F(A(X(**)))))) : A(G(*)) : A(F(**)) : E(F(E(G(**)))) : A(F(**)) : E(F(A(G(**)))) : (E(G(*)) AND E(F(A(G(*))))) : E(F((E((** U **)) AND (** AND (** AND (** AND (** AND **))))))) : (A(G(E(F(*)))) AND (A(F(**)) OR **))"
},
"net":
{
"arcs": 384,
"conflict_clusters": 65,
"places": 102,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 126
},
"result":
{
"interim_value": "unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 228/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 126 transitions, 91 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 CTLFireability.xml
lola: E (F ((E (G (((((1 <= p6) AND (1 <= p52)) OR ((1 <= p4) AND (1 <= p51)) OR ((1 <= p8) AND (1 <= p53))) AND (((1 <= p15) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p20) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p22)) OR ((1 <= p19) AND (1 <= p22)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p26)))))) OR (E (G (((1 <= p48) OR (1 <= p50) OR (1 <= p46)))) AND ((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61)))))) : E (G ((((p6 <= 0) OR (p72 <= 0)) AND ((p6 <= 0) OR (p81 <= 0)) AND ((p8 <= 0) OR (p75 <= 0)) AND ((p8 <= 0) OR (p73 <= 0)) AND ((p4 <= 0) OR (p82 <= 0)) AND ((p6 <= 0) OR (p83 <= 0)) AND ((p4 <= 0) OR (p80 <= 0)) AND ((p6 <= 0) OR (p74 <= 0)) AND ((p4 <= 0) OR (p78 <= 0)) AND ((p4 <= 0) OR (p76 <= 0)) AND ((p8 <= 0) OR (p79 <= 0)) AND ((p8 <= 0) OR (p77 <= 0))))) : ((((((((A (G (E (F (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))) OR E (((((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82))) U ((1 <= p49) OR (1 <= p45) OR (1 <= p47))))) OR (1 <= p92)) OR (1 <= p95)) OR (1 <= p98)) OR (1 <= p101)) OR (1 <= p86)) OR (1 <= p89)) OR ((((1 <= p48) OR (1 <= p50) OR (1 <= p46)) AND ((A (X ((((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82))))) OR (((p6 <= 0) OR (p72 <= 0)) AND ((p6 <= 0) OR (p81 <= 0)) AND ((p8 <= 0) OR (p75 <= 0)) AND ((p8 <= 0) OR (p73 <= 0)) AND ((p4 <= 0) OR (p82 <= 0)) AND ((p6 <= 0) OR (p83 <= 0)) AND ((p4 <= 0) OR (p80 <= 0)) AND ((p6 <= 0) OR (p74 <= 0)) AND ((p4 <= 0) OR (p78 <= 0)) AND ((p4 <= 0) OR (p76 <= 0)) AND ((p8 <= 0) OR (p79 <= 0)) AND ((p8 <= 0) OR (p77 <= 0)))) OR ((p65 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p55 <= 0) AND (p70 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)))) AND ((1 <= p49) OR (1 <= p45) OR (1 <= p47) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p20) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p22)) OR ((1 <= p19) AND (1 <= p22)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p26))))) : ((((((((((((((((((A (F ((((1 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))))) OR (1 <= p32)) OR (1 <= p33)) OR (1 <= p34)) OR (1 <= p35)) OR (1 <= p36)) OR (1 <= p37)) OR (1 <= p39)) OR (1 <= p38)) OR (1 <= p41)) OR (1 <= p40)) OR (1 <= p43)) OR (1 <= p42)) OR (1 <= p44)) OR (1 <= p27)) OR (1 <= p28)) OR (1 <= p29)) OR (1 <= p30)) OR (1 <= p31)) : A (G (E (F ((((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25))))))) : (E (X (((((((E (F (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))) AND ((p1 <= 0) OR (p5 <= 0))) AND ((p0 <= 0) OR (p3 <= 0))) AND ((p2 <= 0) OR (p7 <= 0))) AND ((p1 <= 0) OR (p5 <= 0))) AND ((p0 <= 0) OR (p3 <= 0))) AND ((p2 <= 0) OR (p7 <= 0))))) OR A (((((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p36 <= 0) AND (p37 <= 0) AND (p39 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p44 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)) OR ((((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82))) AND ((1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p100) OR (1 <= p85) OR (1 <= p84) OR (1 <= p99) OR (1 <= p87) OR (1 <= p88)))) U ((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p39) OR (1 <= p38) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p44) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))) : A (G (E (F (A (X ((((1 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))))))))) : NOT(E (F (E (F ((((1 <= p49) OR (1 <= p45) OR (1 <= p47)) AND (((1 <= p6) AND (1 <= p52)) OR ((1 <= p4) AND (1 <= p51)) OR ((1 <= p8) AND (1 <= p53))))))))) : A (F (A (F (((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p39) OR (1 <= p38) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p44) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p100) OR (1 <= p85) OR (1 <= p84) OR (1 <= p99) OR (1 <= p87) OR (1 <= p88) OR (1 <= p92) OR (1 <= p95) OR (1 <= p98) OR (1 <= p101) OR (1 <= p86) OR (1 <= p89)))))) : E (F (E (G ((((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)) AND ((1 <= p92) OR (1 <= p95) OR (1 <= p98) OR (1 <= p101) OR (1 <= p86) OR (1 <= p89)) AND ((1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p100) OR (1 <= p85) OR (1 <= p84) OR (1 <= p99) OR (1 <= p87) OR (1 <= p88))))))) : A ((E (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))) U A (F ((((1 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))))))) : E (F (A (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))) : (NOT(A (F (((p49 <= 0) AND (p45 <= 0) AND (p47 <= 0) AND ((1 <= p92) OR (1 <= p95) OR (1 <= p98) OR (1 <= p101) OR (1 <= p86) OR (1 <= p89)) AND (((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25))))))) AND NOT(A (G (E (F (((1 <= p92) OR (1 <= p95) OR (1 <= p98) OR (1 <= p101) OR (1 <= p86) OR (1 <= p89)))))))) : E (F ((((((E (((((1 <= p12) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p11) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p13) AND (1 <= p15)) OR ((1 <= p13) AND (1 <= p16)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p18)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19))) U (((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7))))) AND (((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82)))) AND (((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))) AND ((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p39) OR (1 <= p38) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p44) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))) AND (((1 <= p12) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p11) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p13) AND (1 <= p15)) OR ((1 <= p13) AND (1 <= p16)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p18)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19)))) AND ((1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p100) OR (1 <= p85) OR (1 <= p84) OR (1 <= p99) OR (1 <= p87) OR (1 <= p88))))) : (NOT(E (F (A (G (((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p39) OR (1 <= p38) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p44) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))))) AND (A (F ((((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p39) OR (1 <= p38) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p44) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31)) AND (p64 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p54 <= 0) AND (p57 <= 0) AND (p61 <= 0)))) OR ((p48 <= 0) AND (p50 <= 0) AND (p46 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))) OR (E (((((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p95)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p95)
lola: processed formula length: 10
lola: 228 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p92)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p92)
lola: processed formula length: 10
lola: 228 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82))) U ((1 <= p49) OR (1 <= p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82))) U ((1 <= p49) OR (1 <= p4... (shortened)
lola: processed formula length: 420
lola: 231 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))
lola: processed formula length: 177
lola: 231 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 literals and 12 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p65 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p55 <= 0) AND (p70 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-3-0.sara
sara: try reading problem file CTLFireability-3-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 20754 markings, 62262 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((E (F (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p0 <= 0) OR (p3 <= 0)) AND (((p2 <= 0) OR (p7 <= 0)) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)))))))))) OR A (((((p32... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING

lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 137656 KB
lola: time consumption: 258 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 137656 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16003376 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16003320 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="Peterson-COL-2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Peterson-COL-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853500660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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