Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872200683.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is PolyORBNT-PT-S10J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872200683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 28K Apr 12 06:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 06:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 494K Apr 11 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 06:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.9K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 473K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 10 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 10 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 255K Apr 9 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 714K Apr 9 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 18M Mar 24 05:37 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 PolyORBNT-PT-S10J30-CTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591175248669

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 09:07:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 09:07:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 09:07:31] [INFO ] Load time of PNML (sax parser for PT used): 683 ms
[2020-06-03 09:07:31] [INFO ] Transformed 664 places.
[2020-06-03 09:07:31] [INFO ] Transformed 12050 transitions.
[2020-06-03 09:07:31] [INFO ] Parsed PT model containing 664 places and 12050 transitions in 839 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 243 ms.
Incomplete random walk after 100000 steps, including 5600 resets, run finished after 2289 ms. (steps per millisecond=43 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 09:07:34] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2020-06-03 09:07:34] [INFO ] Computed 92 place invariants in 104 ms
[2020-06-03 09:07:34] [INFO ] [Real]Absence check using 63 positive place invariants in 205 ms returned sat
[2020-06-03 09:07:34] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 59 ms returned unsat
[2020-06-03 09:07:35] [INFO ] [Real]Absence check using 63 positive place invariants in 187 ms returned sat
[2020-06-03 09:07:35] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 112 ms returned unsat
[2020-06-03 09:07:35] [INFO ] [Real]Absence check using 63 positive place invariants in 30 ms returned sat
[2020-06-03 09:07:35] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 32 ms returned sat
[2020-06-03 09:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:07:39] [INFO ] [Real]Absence check using state equation in 3464 ms returned sat
[2020-06-03 09:07:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:07:39] [INFO ] [Nat]Absence check using 63 positive place invariants in 46 ms returned sat
[2020-06-03 09:07:39] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 37 ms returned sat
[2020-06-03 09:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:07:42] [INFO ] [Nat]Absence check using state equation in 3272 ms returned sat
[2020-06-03 09:07:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 09:07:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2020-06-03 09:07:43] [INFO ] Deduced a trap composed of 24 places in 572 ms
[2020-06-03 09:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 762 ms
[2020-06-03 09:07:43] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 477 ms.
[2020-06-03 09:07:58] [INFO ] Added : 78 causal constraints over 16 iterations in 14716 ms. Result :sat
[2020-06-03 09:07:58] [INFO ] Deduced a trap composed of 19 places in 448 ms
[2020-06-03 09:07:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:08:00] [INFO ] Deduced a trap composed of 9 places in 1678 ms
[2020-06-03 09:08:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s126 s157 s164 s336 s339 s414 s423 s598 s610) 0)") while checking expression at index 2
[2020-06-03 09:08:00] [INFO ] [Real]Absence check using 63 positive place invariants in 30 ms returned sat
[2020-06-03 09:08:00] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 28 ms returned sat
[2020-06-03 09:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:08:04] [INFO ] [Real]Absence check using state equation in 3136 ms returned sat
[2020-06-03 09:08:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:08:04] [INFO ] [Nat]Absence check using 63 positive place invariants in 50 ms returned sat
[2020-06-03 09:08:04] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 35 ms returned sat
[2020-06-03 09:08:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:08:11] [INFO ] [Nat]Absence check using state equation in 6686 ms returned sat
[2020-06-03 09:08:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2020-06-03 09:08:11] [INFO ] Deduced a trap composed of 19 places in 873 ms
[2020-06-03 09:08:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1119 ms
[2020-06-03 09:08:12] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 308 ms.
[2020-06-03 09:08:24] [INFO ] Added : 65 causal constraints over 13 iterations in 11997 ms. Result :(error "Failed to check-sat")
[2020-06-03 09:08:24] [INFO ] [Real]Absence check using 63 positive place invariants in 28 ms returned sat
[2020-06-03 09:08:24] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 27 ms returned unsat
[2020-06-03 09:08:24] [INFO ] [Real]Absence check using 63 positive place invariants in 3 ms returned unsat
[2020-06-03 09:08:24] [INFO ] [Real]Absence check using 63 positive place invariants in 40 ms returned sat
[2020-06-03 09:08:24] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 37 ms returned sat
[2020-06-03 09:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:08:27] [INFO ] [Real]Absence check using state equation in 3327 ms returned sat
[2020-06-03 09:08:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:08:28] [INFO ] [Nat]Absence check using 63 positive place invariants in 137 ms returned sat
[2020-06-03 09:08:28] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 254 ms returned sat
[2020-06-03 09:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:08:36] [INFO ] [Nat]Absence check using state equation in 8136 ms returned sat
[2020-06-03 09:08:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 669 ms returned sat
[2020-06-03 09:08:37] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 396 ms.
[2020-06-03 09:08:45] [INFO ] Added : 15 causal constraints over 3 iterations in 7724 ms. Result :unknown
[2020-06-03 09:08:45] [INFO ] [Real]Absence check using 63 positive place invariants in 33 ms returned sat
[2020-06-03 09:08:45] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 34 ms returned sat
[2020-06-03 09:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:08:47] [INFO ] [Real]Absence check using state equation in 2756 ms returned sat
[2020-06-03 09:08:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:08:48] [INFO ] [Nat]Absence check using 63 positive place invariants in 46 ms returned sat
[2020-06-03 09:08:48] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 29 ms returned sat
[2020-06-03 09:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:08:51] [INFO ] [Nat]Absence check using state equation in 3476 ms returned sat
[2020-06-03 09:08:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 09:08:52] [INFO ] Deduced a trap composed of 24 places in 598 ms
[2020-06-03 09:08:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2020-06-03 09:08:52] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 336 ms.
[2020-06-03 09:09:00] [INFO ] Added : 25 causal constraints over 5 iterations in 7701 ms. Result :sat
[2020-06-03 09:09:00] [INFO ] Deduced a trap composed of 19 places in 491 ms
[2020-06-03 09:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1466 ms
[2020-06-03 09:09:01] [INFO ] [Real]Absence check using 63 positive place invariants in 85 ms returned sat
[2020-06-03 09:09:01] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 70 ms returned sat
[2020-06-03 09:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:05] [INFO ] [Real]Absence check using state equation in 3327 ms returned sat
[2020-06-03 09:09:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:09:05] [INFO ] [Nat]Absence check using 63 positive place invariants in 50 ms returned sat
[2020-06-03 09:09:05] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 39 ms returned sat
[2020-06-03 09:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:08] [INFO ] [Nat]Absence check using state equation in 3151 ms returned sat
[2020-06-03 09:09:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:09:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 6033 ms returned unknown
[2020-06-03 09:09:14] [INFO ] [Real]Absence check using 63 positive place invariants in 26 ms returned unsat
[2020-06-03 09:09:14] [INFO ] [Real]Absence check using 63 positive place invariants in 42 ms returned sat
[2020-06-03 09:09:14] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 34 ms returned sat
[2020-06-03 09:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:18] [INFO ] [Real]Absence check using state equation in 3541 ms returned sat
[2020-06-03 09:09:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:09:18] [INFO ] [Nat]Absence check using 63 positive place invariants in 53 ms returned sat
[2020-06-03 09:09:18] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 49 ms returned sat
[2020-06-03 09:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:23] [INFO ] [Nat]Absence check using state equation in 4539 ms returned sat
[2020-06-03 09:09:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1064 ms returned sat
[2020-06-03 09:09:24] [INFO ] Deduced a trap composed of 24 places in 712 ms
[2020-06-03 09:09:25] [INFO ] Deduced a trap composed of 19 places in 536 ms
[2020-06-03 09:09:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1404 ms
[2020-06-03 09:09:25] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 192 ms.
[2020-06-03 09:09:32] [INFO ] Added : 20 causal constraints over 4 iterations in 7095 ms. Result :sat
[2020-06-03 09:09:32] [INFO ] [Real]Absence check using 63 positive place invariants in 35 ms returned sat
[2020-06-03 09:09:32] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 47 ms returned sat
[2020-06-03 09:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:36] [INFO ] [Real]Absence check using state equation in 3365 ms returned sat
[2020-06-03 09:09:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:09:36] [INFO ] [Nat]Absence check using 63 positive place invariants in 29 ms returned sat
[2020-06-03 09:09:36] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 30 ms returned sat
[2020-06-03 09:09:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:40] [INFO ] [Nat]Absence check using state equation in 3592 ms returned sat
[2020-06-03 09:09:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 119 ms returned sat
[2020-06-03 09:09:40] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 191 ms.
[2020-06-03 09:09:48] [INFO ] Added : 25 causal constraints over 5 iterations in 8454 ms. Result :sat
[2020-06-03 09:09:49] [INFO ] Deduced a trap composed of 19 places in 400 ms
[2020-06-03 09:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1212 ms
[2020-06-03 09:09:50] [INFO ] [Real]Absence check using 63 positive place invariants in 38 ms returned sat
[2020-06-03 09:09:50] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 41 ms returned sat
[2020-06-03 09:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:53] [INFO ] [Real]Absence check using state equation in 3157 ms returned sat
[2020-06-03 09:09:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:09:53] [INFO ] [Nat]Absence check using 63 positive place invariants in 39 ms returned sat
[2020-06-03 09:09:53] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 42 ms returned sat
[2020-06-03 09:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:09:58] [INFO ] [Nat]Absence check using state equation in 5285 ms returned sat
[2020-06-03 09:09:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 103 ms returned sat
[2020-06-03 09:09:59] [INFO ] Deduced a trap composed of 24 places in 588 ms
[2020-06-03 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 704 ms
[2020-06-03 09:09:59] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 340 ms.
[2020-06-03 09:10:04] [INFO ] Added : 5 causal constraints over 1 iterations in 5372 ms. Result :sat
[2020-06-03 09:10:05] [INFO ] [Real]Absence check using 63 positive place invariants in 35 ms returned sat
[2020-06-03 09:10:05] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 40 ms returned sat
[2020-06-03 09:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:10:08] [INFO ] [Real]Absence check using state equation in 3384 ms returned sat
[2020-06-03 09:10:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:10:08] [INFO ] [Nat]Absence check using 63 positive place invariants in 42 ms returned sat
[2020-06-03 09:10:08] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 50 ms returned sat
[2020-06-03 09:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:10:14] [INFO ] [Nat]Absence check using state equation in 5925 ms returned sat
[2020-06-03 09:10:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 241 ms returned sat
[2020-06-03 09:10:15] [INFO ] Deduced a trap composed of 24 places in 572 ms
[2020-06-03 09:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2020-06-03 09:10:15] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 173 ms.
[2020-06-03 09:10:28] [INFO ] Added : 75 causal constraints over 15 iterations in 12995 ms. Result :unknown
[2020-06-03 09:10:28] [INFO ] [Real]Absence check using 63 positive place invariants in 58 ms returned sat
[2020-06-03 09:10:28] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 41 ms returned sat
[2020-06-03 09:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:10:31] [INFO ] [Real]Absence check using state equation in 3150 ms returned sat
[2020-06-03 09:10:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:10:32] [INFO ] [Nat]Absence check using 63 positive place invariants in 29 ms returned sat
[2020-06-03 09:10:32] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 74 ms returned sat
[2020-06-03 09:10:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:10:35] [INFO ] [Nat]Absence check using state equation in 3683 ms returned sat
[2020-06-03 09:10:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1146 ms returned sat
[2020-06-03 09:10:37] [INFO ] Computed and/alt/rep : 1929/99172/1920 causal constraints in 271 ms.
[2020-06-03 09:10:47] [INFO ] Added : 20 causal constraints over 4 iterations in 10513 ms. Result :sat
[2020-06-03 09:10:48] [INFO ] Deduced a trap composed of 19 places in 510 ms
[2020-06-03 09:10:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:10:52] [INFO ] Deduced a trap composed of 9 places in 853 ms
[2020-06-03 09:10:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s126 s157 s164 s336 s339 s414 s423 s598 s610) 0)") while checking expression at index 14
[2020-06-03 09:10:52] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned unsat
[2020-06-03 09:10:53] [INFO ] [Real]Absence check using 63 positive place invariants in 26 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 09:10:53] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 09:10:53] [INFO ] Flatten gal took : 277 ms
[2020-06-03 09:10:53] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 09:10:53] [INFO ] Flatten gal took : 123 ms
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 09:10:53] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 09:10:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBNT-PT-S10J30 @ 3570 seconds

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3378
rslt: Output for CTLCardinality @ PolyORBNT-PT-S10J30

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 307
},
"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": 41,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 41,
"visible_transitions": 0
},
"processed": "(p7 + p111 + p122 + p59 + p186 + p189 + p198 + p213 + p230 + p269 + p323 + p46 + p339 + p341 + p45 + p379 + p392 + p400 + p409 + p432 + p435 + p442 + p487 + p489 + p535 + p571 + p580 + p587 + p640 + p644 + p97 + 1 <= p113 + p115 + p183 + p212 + p382 + p445 + p454 + p471 + p521 + p658)",
"processed_size": 285,
"rewrites": 17
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1041
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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 (((3 <= p560) OR (p649 + 1 <= p298))))",
"processed_size": 44,
"rewrites": 16
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 310,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 310,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + p202 + p207 + p209 + p210 + p216 + p217 + p222 + p223 + p224 + p229 + p236 + p238 + p239 + p241 + p242 + p249 + p251 + p252 + p253 + p254 + p256 + p257 + p260 + p261 + p262 + p263 + p265 + p270 + p273 + p276 + p277 + p279 + p280 + p282 + p283 + p285 + p288 + p291 + p292 + p294 + p297 + p298 + p299 + p300 + p301 + p302 + p305 + p306 + p313 + p315 + p316 + p318 + p319 + p320 + p322 + p326 + p328 + p330 + p332 + p333 + p334 + p335 + p337 + p340 + p342 + p344 + p345 + p347 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p363 + p366 + p367 + p368 + p369 + p370 + p373 + p375 + p377 + p378 + p380 + p381 + p383 + p387 + p388 + p389 + p391 + p393 + p395 + p396 + p397 + p398 + p401 + p403 + p404 + p406 + p407 + p411 + p415 + p416 + p420 + p422 + p425 + p426 + p427 + p429 + p434 + p440 + p443 + p446 + p447 + p449 + p452 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p466 + p467 + p469 + p472 + p474 + p477 + p479 + p480 + p486 + p490 + p492 + p498 + p500 + p502 + p503 + p504 + p505 + p509 + p512 + p516 + p518 + p519 + p523 + p525 + p526 + p527 + p528 + p530 + p532 + p536 + p537 + p538 + p540 + p541 + p543 + p545 + p547 + p548 + p549 + p553 + p554 + p556 + p557 + p558 + p560 + p561 + p564 + p572 + p573 + p574 + p32 + p576 + p581 + p583 + p584 + p585 + p586 + p589 + p590 + p591 + p595 + p599 + p600 + p603 + p604 + p605 + p606 + p607 + p30 + p612 + p615 + p616 + p25 + p622 + p623 + p625 + p23 + p628 + p629 + p633 + p634 + p635 + p637 + p641 + p18 + p643 + p645 + p648 + p649 + p14 + p656 + p657 + p660 + p661 + p12 + p651 + p16 + p19 + p638 + p24 + p621 + p26 + p29 + p31 + p36 + p40 + p43 + p44 + p51 + p53 + p54 + p55 + p61 + p63 + p66 + p69 + p70 + p75 + p83 + p84 + p85 + p86 + p89 + p92 + p93 + p94 + p95 + p98)))",
"processed_size": 2141,
"rewrites": 16
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 422
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 310,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 310,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + p202 + p207 + p209 + p210 + p216 + p217 + p222 + p223 + p224 + p229 + p236 + p238 + p239 + p241 + p242 + p249 + p251 + p252 + p253 + p254 + p256 + p257 + p260 + p261 + p262 + p263 + p265 + p270 + p273 + p276 + p277 + p279 + p280 + p282 + p283 + p285 + p288 + p291 + p292 + p294 + p297 + p298 + p299 + p300 + p301 + p302 + p305 + p306 + p313 + p315 + p316 + p318 + p319 + p320 + p322 + p326 + p328 + p330 + p332 + p333 + p334 + p335 + p337 + p340 + p342 + p344 + p345 + p347 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p363 + p366 + p367 + p368 + p369 + p370 + p373 + p375 + p377 + p378 + p380 + p381 + p383 + p387 + p388 + p389 + p391 + p393 + p395 + p396 + p397 + p398 + p401 + p403 + p404 + p406 + p407 + p411 + p415 + p416 + p420 + p422 + p425 + p426 + p427 + p429 + p434 + p440 + p443 + p446 + p447 + p449 + p452 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p466 + p467 + p469 + p472 + p474 + p477 + p479 + p480 + p486 + p490 + p492 + p498 + p500 + p502 + p503 + p504 + p505 + p509 + p512 + p516 + p518 + p519 + p523 + p525 + p526 + p527 + p528 + p530 + p532 + p536 + p537 + p538 + p540 + p541 + p543 + p545 + p547 + p548 + p549 + p553 + p554 + p556 + p557 + p558 + p560 + p561 + p564 + p572 + p573 + p574 + p32 + p576 + p581 + p583 + p584 + p585 + p586 + p589 + p590 + p591 + p595 + p599 + p600 + p603 + p604 + p605 + p606 + p607 + p30 + p612 + p615 + p616 + p25 + p622 + p623 + p625 + p23 + p628 + p629 + p633 + p634 + p635 + p637 + p641 + p18 + p643 + p645 + p648 + p649 + p14 + p656 + p657 + p660 + p661 + p12 + p651 + p16 + p19 + p638 + p24 + p621 + p26 + p29 + p31 + p36 + p40 + p43 + p44 + p51 + p53 + p54 + p55 + p61 + p63 + p66 + p69 + p70 + p75 + p83 + p84 + p85 + p86 + p89 + p92 + p93 + p94 + p95 + p98)))",
"processed_size": 2141,
"rewrites": 16
},
"result":
{
"edges": 10,
"markings": 11,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": "(((p138 <= 0)))",
"processed_size": 15,
"rewrites": 18
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 563
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 (G ((p334 <= p604)))",
"processed_size": 22,
"rewrites": 16
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 675
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p498 <= p285)",
"processed_size": 14,
"rewrites": 18
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 844
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(((p658 + 1 <= p376) OR (p616 + 1 <= p215)) AND ((p471 + 1 <= p253) OR (p292 <= 2)) AND ((p218 <= p386) OR (p321 <= 2)))",
"processed_size": 123,
"rewrites": 18
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 645
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1126
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "E (G ((p4 + p117 + p137 + p141 + p166 + p170 + p247 + p284 + p309 + p336 + p348 + p385 + p394 + p405 + p506 + p515 + p517 + p544 + p34 + p562 + p577 + p592 + p593 + p609 + p11 + p27 + p617 + p458 + p48 + p71 + p90 + p96 <= p81)))",
"processed_size": 229,
"rewrites": 16
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 126
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1689
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A((p532 <= p571) U EG((p631 <= p577)))",
"processed_size": 38,
"rewrites": 17
},
"net":
{
"conflict_clusters": 114,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3378
},
"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": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "(1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82)",
"processed_size": 217,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"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": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "(1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82)",
"processed_size": 217,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "A (G (((p362 <= 0) OR (p157 + p172 + p177 + p190 + p220 + p231 + p237 + p259 + p264 + p296 + p303 + p343 + p351 + p352 + p384 + p421 + p441 + p451 + p470 + p476 + p520 + p533 + p601 + p659 + p627 + p575 + p41 + p60 + p67 + p73 + p91 + 1 <= p374))))",
"processed_size": 249,
"rewrites": 17
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 79728,
"runtime": 192.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR A(G(*))) : E(F(**)) : E(X(E(G(**)))) : E(F(**)) : E(G(*)) : A(F(**)) : E(G(**)) : A(F(**)) : A((** U E(G(**)))) : E(F(*)) : A(F(*))"
},
"net":
{
"arcs": 13349,
"conflict_clusters": 114,
"places": 664,
"places_significant": 572,
"singleton_clusters": 0,
"transitions": 1940
},
"result":
{
"preliminary_value": "no yes yes yes yes no yes no yes yes no ",
"value": "no yes yes yes yes no yes no yes yes no "
},
"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: 2604/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 21248
lola: finding significant places
lola: 664 places, 1940 transitions, 572 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 CTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p73)
lola: LP says that atomic proposition is always false: (3 <= p172)
lola: ((1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82) OR NOT(E (F (((1 <= p362) AND (p374 <= p157 + p172 + p177 + p190 + p220 + p231 + p237 + p259 + p264 + p296 + p303 + p343 + p351 + p352 + p384 + p421 + p441 + p451 + p470 + p476 + p520 + p533 + p601 + p659 + p627 + p575 + p41 + p60 + p67 + p73 + p91)))))) : E (((1 <= 0) U E (F ((1 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + p202 + p207 + p209 + p210 + p216 + p217 + p222 + p223 + p224 + p229 + p236 + p238 + p239 + p241 + p242 + p249 + p251 + p252 + p253 + p254 + p256 + p257 + p260 + p261 + p262 + p263 + p265 + p270 + p273 + p276 + p277 + p279 + p280 + p282 + p283 + p285 + p288 + p291 + p292 + p294 + p297 + p298 + p299 + p300 + p301 + p302 + p305 + p306 + p313 + p315 + p316 + p318 + p319 + p320 + p322 + p326 + p328 + p330 + p332 + p333 + p334 + p335 + p337 + p340 + p342 + p344 + p345 + p347 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p363 + p366 + p367 + p368 + p369 + p370 + p373 + p375 + p377 + p378 + p380 + p381 + p383 + p387 + p388 + p389 + p391 + p393 + p395 + p396 + p397 + p398 + p401 + p403 + p404 + p406 + p407 + p411 + p415 + p416 + p420 + p422 + p425 + p426 + p427 + p429 + p434 + p440 + p443 + p446 + p447 + p449 + p452 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p466 + p467 + p469 + p472 + p474 + p477 + p479 + p480 + p486 + p490 + p492 + p498 + p500 + p502 + p503 + p504 + p505 + p509 + p512 + p516 + p518 + p519 + p523 + p525 + p526 + p527 + p528 + p530 + p532 + p536 + p537 + p538 + p540 + p541 + p543 + p545 + p547 + p548 + p549 + p553 + p554 + p556 + p557 + p558 + p560 + p561 + p564 + p572 + p573 + p574 + p32 + p576 + p581 + p583 + p584 + p585 + p586 + p589 + p590 + p591 + p595 + p599 + p600 + p603 + p604 + p605 + p606 + p607 + p30 + p612 + p615 + p616 + p25 + p622 + p623 + p625 + p23 + p628 + p629 + p633 + p634 + p635 + p637 + p641 + p18 + p643 + p645 + p648 + p649 + p14 + p656 + p657 + p660 + p661 + p12 + p651 + p16 + p19 + p638 + p24 + p621 + p26 + p29 + p31 + p36 + p40 + p43 + p44 + p51 + p53 + p54 + p55 + p61 + p63 + p66 + p69 + p70 + p75 + p83 + p84 + p85 + p86 + p89 + p92 + p93 + p94 + p95 + p98))))) : E (X (E (G ((p7 + p111 + p122 + p59 + p186 + p189 + p198 + p213 + p230 + p269 + p323 + p46 + p339 + p341 + p45 + p379 + p392 + p400 + p409 + p432 + p435 + p442 + p487 + p489 + p535 + p571 + p580 + p587 + p640 + p644 + p97 + 1 <= p113 + p115 + p183 + p212 + p382 + p445 + p454 + p471 + p521 + p658))))) : E (F (A (F ((2 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + p202 + p207 + p209 + p210 + p216 + p217 + p222 + p223 + p224 + p229 + p236 + p238 + p239 + p241 + p242 + p249 + p251 + p252 + p253 + p254 + p256 + p257 + p260 + p261 + p262 + p263 + p265 + p270 + p273 + p276 + p277 + p279 + p280 + p282 + p283 + p285 + p288 + p291 + p292 + p294 + p297 + p298 + p299 + p300 + p301 + p302 + p305 + p306 + p313 + p315 + p316 + p318 + p319 + p320 + p322 + p326 + p328 + p330 + p332 + p333 + p334 + p335 + p337 + p340 + p342 + p344 + p345 + p347 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p363 + p366 + p367 + p368 + p369 + p370 + p373 + p375 + p377 + p378 + p380 + p381 + p383 + p387 + p388 + p389 + p391 + p393 + p395 + p396 + p397 + p398 + p401 + p403 + p404 + p406 + p407 + p411 + p415 + p416 + p420 + p422 + p425 + p426 + p427 + p429 + p434 + p440 + p443 + p446 + p447 + p449 + p452 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p466 + p467 + p469 + p472 + p474 + p477 + p479 + p480 + p486 + p490 + p492 + p498 + p500 + p502 + p503 + p504 + p505 + p509 + p512 + p516 + p518 + p519 + p523 + p525 + p526 + p527 + p528 + p530 + p532 + p536 + p537 + p538 + p540 + p541 + p543 + p545 + p547 + p548 + p549 + p553 + p554 + p556 + p557 + p558 + p560 + p561 + p564 + p572 + p573 + p574 + p32 + p576 + p581 + p583 + p584 + p585 + p586 + p589 + p590 + p591 + p595 + p599 + p600 + p603 + p604 + p605 + p606 + p607 + p30 + p612 + p615 + p616 + p25 + p622 + p623 + p625 + p23 + p628 + p629 + p633 + p634 + p635 + p637 + p641 + p18 + p643 + p645 + p648 + p649 + p14 + p656 + p657 + p660 + p661 + p12 + p651 + p16 + p19 + p638 + p24 + p621 + p26 + p29 + p31 + p36 + p40 + p43 + p44 + p51 + p53 + p54 + p55 + p61 + p63 + p66 + p69 + p70 + p75 + p83 + p84 + p85 + p86 + p89 + p92 + p93 + p94 + p95 + p98))))) : NOT(A (F ((p81 + 1 <= p4 + p117 + p137 + p141 + p166 + p170 + p247 + p284 + p309 + p336 + p348 + p385 + p394 + p405 + p506 + p515 + p517 + p544 + p34 + p562 + p577 + p592 + p593 + p609 + p11 + p27 + p617 + p458 + p48 + p71 + p90 + p96)))) : A (F ((((p376 <= p658) AND (p215 <= p616)) OR ((p253 <= p471) AND (3 <= p292)) OR ((p386 + 1 <= p218) AND (3 <= p321))))) : E (G ((p334 <= p604))) : A (F ((((1 <= p138))))) : A (((p532 <= p571) U E (G ((p631 <= p577))))) : NOT(A (G (((p560 <= 2) AND (p298 <= p649))))) : NOT(E (G ((p498 <= p285))))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p7 + p111 + p122 + p59 + p186 + p189 + p198 + p213 + p230 + p269 + p323 + p46 + p339 + p341 + p45 + p379 + p392 + p400 + p409 + p432 + p435 + p442 + p487 + p489 + p535 + p571 + p580 + p587 + p640 + p644 + p97 + 1 <= p113 + p115 + p183 + p212 + p382 + p445 + p454 + p471 + p521 + p658)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p7 + p111 + p122 + p59 + p186 + p189 + p198 + p213 + p230 + p269 + p323 + p46 + p339 + p341 + p45 + p379 + p392 + p400 + p409 + p432 + p435 + p442 + p487 + p489 + p535 + p571 + p580 + p587 + p640 + p644 + p97 + 1 <= p113 + p115 + p183 + p212 + p382 + p445 + p454 + p471 + p521 + p658)
lola: processed formula length: 285
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p7 + p111 + p122 + p59 + p186 + p189 + p198 + p213 + p230 + p269 + p323 + p46 + p339 + p341 + p45 + p379 + p392 + p400 + p409 + p432 + p435 + p442 + p487 + p489 + p535 + p571 + p580 + p587 + p640 + p644 + p97 + 1 <= p113 + p115 + p183 + p212 + p382 + p445 + p454 + p471 + p521 + p658)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p560) OR (p649 + 1 <= p298))))
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 (((3 <= p560) OR (p649 + 1 <= p298))))
lola: processed formula length: 44
lola: 16 rewrites
lola: closed formula file CTLCardinality.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: ((3 <= p560) OR (p649 + 1 <= p298))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 48764 markings, 175415 edges, 9753 markings/sec, 0 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + ... (shortened)
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 ((2 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + ... (shortened)
lola: processed formula length: 2141
lola: 16 rewrites
lola: closed formula file CTLCardinality.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: (2 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + p202 + p207 + p209 + p210 + p216 + p217 + p222 + p223 + p224 + p229 + p236 + p238 + p239 + p241 + p242 + p249 + p251 + p252 + p253 + p254 + p256 + p257 + p260 + p261 + p262 + p263 + p265 + p270 + p273 + p276 + p277 + p279 + p280 + p282 + p283 + p285 + p288 + p291 + p292 + p294 + p297 + p298 + p299 + p300 + p301 + p302 + p305 + p306 + p313 + p315 + p316 + p318 + p319 + p320 + p322 + p326 + p328 + p330 + p332 + p333 + p334 + p335 + p337 + p340 + p342 + p344 + p345 + p347 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p363 + p366 + p367 + p368 + p369 + p370 + p373 + p375 + p377 + p378 + p380 + p381 + p383 + p387 + p388 + p389 + p391 + p393 + p395 + p396 + p397 + p398 + p401 + p403 + p404 + p406 + p407 + p411 + p415 + p416 + p420 + p422 + p425 + p426 + p427 + p429 + p434 + p440 + p443 + p446 + p447 + p449 + p452 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p466 + p467 + p469 + p472 + p474 + p477 + p479 + p480 + p486 + p490 + p492 + p498 + p500 + p502 + p503 + p504 + p505 + p509 + p512 + p516 + p518 + p519 + p523 + p525 + p526 + p527 + p528 + p530 + p532 + p536 + p537 + p538 + p540 + p541 + p543 + p545 + p547 + p548 + p549 + p553 + p554 + p556 + p557 + p558 + p560 + p561 + p564 + p572 + p573 + p574 + p32 + p576 + p581 + p583 + p584 + p585 + p586 + p589 + p590 + p591 + p595 + p599 + p600 + p603 + p604 + p605 + p606 + p607 + p30 + p612 + p615 + p616 + p25 + p622 + p623 + p625 + p23 + p628 + p629 + p633 + p634 + p635 + p637 + p641 + p18 + p643 + p645 + p648 + p649 + p14 + p656 + p657 + p660 + p661 + p12 + p651 + p16 + p19 + p638 + p24 + p621 + p26 + p29 + p31 + p36 + p40 + p43 + p44 + p51 + p53 + p54 + p55 + p61 + p63 + p66 + p69 + p70 + p75 + p83 + p84 + p85 + p86 + p89 + p92 + p93 + p94 + p95 + p98)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
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: subprocess 3 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + ... (shortened)
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 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + ... (shortened)
lola: processed formula length: 2141
lola: 16 rewrites
lola: closed formula file CTLCardinality.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 <= p3 + p9 + p100 + p103 + p105 + p106 + p107 + p109 + p110 + p116 + p118 + p120 + p121 + p123 + p125 + p127 + p129 + p131 + p132 + p133 + p134 + p136 + p138 + p139 + p140 + p143 + p146 + p147 + p150 + p152 + p153 + p154 + p156 + p165 + p167 + p168 + p169 + p173 + p174 + p175 + p179 + p181 + p182 + p184 + p187 + p188 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p199 + p200 + p201 + p202 + p207 + p209 + p210 + p216 + p217 + p222 + p223 + p224 + p229 + p236 + p238 + p239 + p241 + p242 + p249 + p251 + p252 + p253 + p254 + p256 + p257 + p260 + p261 + p262 + p263 + p265 + p270 + p273 + p276 + p277 + p279 + p280 + p282 + p283 + p285 + p288 + p291 + p292 + p294 + p297 + p298 + p299 + p300 + p301 + p302 + p305 + p306 + p313 + p315 + p316 + p318 + p319 + p320 + p322 + p326 + p328 + p330 + p332 + p333 + p334 + p335 + p337 + p340 + p342 + p344 + p345 + p347 + p353 + p354 + p355 + p356 + p357 + p358 + p360 + p361 + p363 + p366 + p367 + p368 + p369 + p370 + p373 + p375 + p377 + p378 + p380 + p381 + p383 + p387 + p388 + p389 + p391 + p393 + p395 + p396 + p397 + p398 + p401 + p403 + p404 + p406 + p407 + p411 + p415 + p416 + p420 + p422 + p425 + p426 + p427 + p429 + p434 + p440 + p443 + p446 + p447 + p449 + p452 + p456 + p457 + p459 + p460 + p461 + p462 + p464 + p466 + p467 + p469 + p472 + p474 + p477 + p479 + p480 + p486 + p490 + p492 + p498 + p500 + p502 + p503 + p504 + p505 + p509 + p512 + p516 + p518 + p519 + p523 + p525 + p526 + p527 + p528 + p530 + p532 + p536 + p537 + p538 + p540 + p541 + p543 + p545 + p547 + p548 + p549 + p553 + p554 + p556 + p557 + p558 + p560 + p561 + p564 + p572 + p573 + p574 + p32 + p576 + p581 + p583 + p584 + p585 + p586 + p589 + p590 + p591 + p595 + p599 + p600 + p603 + p604 + p605 + p606 + p607 + p30 + p612 + p615 + p616 + p25 + p622 + p623 + p625 + p23 + p628 + p629 + p633 + p634 + p635 + p637 + p641 + p18 + p643 + p645 + p648 + p649 + p14 + p656 + p657 + p660 + p661 + p12 + p651 + p16 + p19 + p638 + p24 + p621 + p26 + p29 + p31 + p36 + p40 + p43 + p44 + p51 + p53 + p54 + p55 + p61 + p63 + p66 + p69 + p70 + p75 + p83 + p84 + p85 + p86 + p89 + p92 + p93 + p94 + p95 + p98)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p138)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p138 <= 0)))
lola: processed formula length: 15
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
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)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 17 edges
lola: subprocess 5 will run for 563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p334 <= p604)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p334 <= p604)))
lola: processed formula length: 22
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 18 markings, 17 edges
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p285 + 1 <= p498)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p498 <= p285)
lola: processed formula length: 14
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p285 + 1 <= p498)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p376 <= p658) AND (p215 <= p616)) OR ((p253 <= p471) AND (3 <= p292)) OR ((p386 + 1 <= p218) AND (3 <= p321)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p658 + 1 <= p376) OR (p616 + 1 <= p215)) AND ((p471 + 1 <= p253) OR (p292 <= 2)) AND ((p218 <= p386) OR (p321 <= 2)))
lola: processed formula length: 123
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p376 <= p658) AND (p215 <= p616)) OR ((p253 <= p471) AND (3 <= p292)) OR ((p386 + 1 <= p218) AND (3 <= p321)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 8 will run for 1126 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p4 + p117 + p137 + p141 + p166 + p170 + p247 + p284 + p309 + p336 + p348 + p385 + p394 + p405 + p506 + p515 + p517 + p544 + p34 + p562 + p577 + p592 + p593 + p609 + p11 + p27 + p617 + p458 + p48 + p71 + p90 + p96 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p4 + p117 + p137 + p141 + p166 + p170 + p247 + p284 + p309 + p336 + p348 + p385 + p394 + p405 + p506 + p515 + p517 + p544 + p34 + p562 + p577 + p592 + p593 + p609 + p11 + p27 + p617 + p458 + p48 + p71 + p90 + p96 <= p81)))
lola: processed formula length: 229
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p81 + 1 <= p4 + p117 + p137 + p141 + p166 + p170 + p247 + p284 + p309 + p336 + p348 + p385 + p394 + p405 + p506 + p515 + p517 + p544 + p34 + p562 + p577 + p592 + p593 + p609 + p11 + p27 + p617 + p458 + p48 + p71 + p90 + p96)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 1689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p532 <= p571) U E (G ((p631 <= p577)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((p532 <= p571) U EG((p631 <= p577)))
lola: processed formula length: 38
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 3378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82) OR A (G (((p362 <= 0) OR (p157 + p172 + p177 + p190 + p220 + p231 + p237 + p259 + p264 + p296 + p303 + p343 + p351 + p352 + p384 + p421 + p441 + p451 + p470 + p476 + p520 + p533 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82)
lola: processed formula length: 217
lola: 15 rewrites
lola: closed formula file CTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82) OR A (G (((p362 <= 0) OR (p157 + p172 + p177 + p190 + p220 + p231 + p237 + p259 + p264 + p296 + p303 + p343 + p351 + p352 + p384 + p421 + p441 + p451 + p470 + p476 + p520 + p533 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p102 + p151 + p155 + p159 + p226 + p248 + p258 + p278 + p287 + p307 + p338 + p364 + p371 + p386 + p414 + p419 + p437 + p450 + p475 + p33 + p559 + p568 + p569 + p620 + p631 + p636 + p653 + p654 + p65 + p80 + p82)
lola: processed formula length: 217
lola: 15 rewrites
lola: closed formula file CTLCardinality.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: ========================================
lola: ...considering subproblem: A (G (((p362 <= 0) OR (p157 + p172 + p177 + p190 + p220 + p231 + p237 + p259 + p264 + p296 + p303 + p343 + p351 + p352 + p384 + p421 + p441 + p451 + p470 + p476 + p520 + p533 + p601 + p659 + p627 + p575 + p41 + p60 + p67 + p73 + p91 + 1 <= p374))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p362 <= 0) OR (p157 + p172 + p177 + p190 + p220 + p231 + p237 + p259 + p264 + p296 + p303 + p343 + p351 + p352 + p384 + p421 + p441 + p451 + p470 + p476 + p520 + p533 + p601 + p659 + p627 + p575 + p41 + p60 + p67 + p73 + p91 + 1 <= p374))))
lola: processed formula length: 249
lola: 17 rewrites
lola: closed formula file CTLCardinality.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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p362) AND (p374 <= p157 + p172 + p177 + p190 + p220 + p231 + p237 + p259 + p264 + p296 + p303 + p343 + p351 + p352 + p384 + p421 + p441 + p451 + p470 + p476 + p520 + p533 + p601 + p659 + p627 + p575 + p41 + p60 + p67 + p73 + p91))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes no yes yes no
lola:
preliminary result: no yes yes yes yes no yes no yes yes no
lola: ========================================
lola: memory consumption: 79728 KB
lola: time consumption: 192 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

--------------------
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="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBNT-PT-S10J30, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872200683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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