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-158987872200673.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-S10J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872200673
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 13K Apr 12 06:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 12 06:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 490K Apr 11 06:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 06:13 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 11K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Apr 10 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 273K Apr 9 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 727K Apr 9 19:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.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-S10J20-00
FORMULA_NAME PolyORBNT-PT-S10J20-01
FORMULA_NAME PolyORBNT-PT-S10J20-02
FORMULA_NAME PolyORBNT-PT-S10J20-03
FORMULA_NAME PolyORBNT-PT-S10J20-04
FORMULA_NAME PolyORBNT-PT-S10J20-05
FORMULA_NAME PolyORBNT-PT-S10J20-06
FORMULA_NAME PolyORBNT-PT-S10J20-07
FORMULA_NAME PolyORBNT-PT-S10J20-08
FORMULA_NAME PolyORBNT-PT-S10J20-09
FORMULA_NAME PolyORBNT-PT-S10J20-10
FORMULA_NAME PolyORBNT-PT-S10J20-11
FORMULA_NAME PolyORBNT-PT-S10J20-12
FORMULA_NAME PolyORBNT-PT-S10J20-13
FORMULA_NAME PolyORBNT-PT-S10J20-14
FORMULA_NAME PolyORBNT-PT-S10J20-15

=== Now, execution of the tool begins

BK_START 1591174460048

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 08:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:54:22] [INFO ] Load time of PNML (sax parser for PT used): 630 ms
[2020-06-03 08:54:22] [INFO ] Transformed 474 places.
[2020-06-03 08:54:22] [INFO ] Transformed 11760 transitions.
[2020-06-03 08:54:22] [INFO ] Parsed PT model containing 474 places and 11760 transitions in 766 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 99 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5600 resets, run finished after 2775 ms. (steps per millisecond=36 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1]
[2020-06-03 08:54:25] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2020-06-03 08:54:25] [INFO ] Computed 72 place invariants in 92 ms
[2020-06-03 08:54:25] [INFO ] [Real]Absence check using 45 positive place invariants in 44 ms returned sat
[2020-06-03 08:54:25] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 28 ms returned unsat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned unsat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive place invariants in 21 ms returned sat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 23 ms returned unsat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive place invariants in 4 ms returned unsat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive place invariants in 20 ms returned sat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 7 ms returned unsat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive place invariants in 24 ms returned sat
[2020-06-03 08:54:26] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 24 ms returned sat
[2020-06-03 08:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:54:29] [INFO ] [Real]Absence check using state equation in 3145 ms returned sat
[2020-06-03 08:54:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:54:29] [INFO ] [Nat]Absence check using 45 positive place invariants in 30 ms returned sat
[2020-06-03 08:54:29] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 31 ms returned sat
[2020-06-03 08:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:54:31] [INFO ] [Nat]Absence check using state equation in 1918 ms returned sat
[2020-06-03 08:54:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:54:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2338 ms returned sat
[2020-06-03 08:54:34] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 495 ms.
[2020-06-03 08:54:39] [INFO ] Added : 36 causal constraints over 8 iterations in 5306 ms. Result :sat
[2020-06-03 08:54:40] [INFO ] Deduced a trap composed of 151 places in 657 ms
[2020-06-03 08:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1075 ms
[2020-06-03 08:54:40] [INFO ] [Real]Absence check using 45 positive place invariants in 30 ms returned sat
[2020-06-03 08:54:40] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 65 ms returned sat
[2020-06-03 08:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:54:43] [INFO ] [Real]Absence check using state equation in 2652 ms returned sat
[2020-06-03 08:54:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:54:43] [INFO ] [Nat]Absence check using 45 positive place invariants in 33 ms returned sat
[2020-06-03 08:54:43] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 31 ms returned sat
[2020-06-03 08:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:54:46] [INFO ] [Nat]Absence check using state equation in 2657 ms returned sat
[2020-06-03 08:54:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 801 ms returned sat
[2020-06-03 08:54:47] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 226 ms.
[2020-06-03 08:54:48] [INFO ] Added : 18 causal constraints over 4 iterations in 1459 ms. Result :sat
[2020-06-03 08:54:48] [INFO ] [Real]Absence check using 45 positive place invariants in 28 ms returned sat
[2020-06-03 08:54:48] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 27 ms returned unsat
[2020-06-03 08:54:48] [INFO ] [Real]Absence check using 45 positive place invariants in 35 ms returned sat
[2020-06-03 08:54:48] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned sat
[2020-06-03 08:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:54:51] [INFO ] [Real]Absence check using state equation in 2254 ms returned sat
[2020-06-03 08:54:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:54:51] [INFO ] [Nat]Absence check using 45 positive place invariants in 36 ms returned sat
[2020-06-03 08:54:51] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 32 ms returned sat
[2020-06-03 08:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:54:53] [INFO ] [Nat]Absence check using state equation in 2510 ms returned sat
[2020-06-03 08:54:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 988 ms returned sat
[2020-06-03 08:54:54] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 189 ms.
[2020-06-03 08:55:04] [INFO ] Added : 40 causal constraints over 8 iterations in 9717 ms. Result :sat
[2020-06-03 08:55:05] [INFO ] Deduced a trap composed of 19 places in 454 ms
[2020-06-03 08:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1146 ms
[2020-06-03 08:55:05] [INFO ] [Real]Absence check using 45 positive place invariants in 33 ms returned sat
[2020-06-03 08:55:05] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 28 ms returned unsat
[2020-06-03 08:55:05] [INFO ] [Real]Absence check using 45 positive place invariants in 36 ms returned sat
[2020-06-03 08:55:05] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned sat
[2020-06-03 08:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:08] [INFO ] [Real]Absence check using state equation in 2107 ms returned sat
[2020-06-03 08:55:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:55:08] [INFO ] [Nat]Absence check using 45 positive place invariants in 34 ms returned sat
[2020-06-03 08:55:08] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 32 ms returned sat
[2020-06-03 08:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:13] [INFO ] [Nat]Absence check using state equation in 5302 ms returned sat
[2020-06-03 08:55:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2020-06-03 08:55:13] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 122 ms.
[2020-06-03 08:55:14] [INFO ] Added : 18 causal constraints over 4 iterations in 735 ms. Result :sat
[2020-06-03 08:55:14] [INFO ] Deduced a trap composed of 140 places in 605 ms
[2020-06-03 08:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1233 ms
[2020-06-03 08:55:15] [INFO ] [Real]Absence check using 45 positive place invariants in 29 ms returned sat
[2020-06-03 08:55:15] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 32 ms returned sat
[2020-06-03 08:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:18] [INFO ] [Real]Absence check using state equation in 2476 ms returned sat
[2020-06-03 08:55:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:55:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 29 ms returned sat
[2020-06-03 08:55:18] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 32 ms returned sat
[2020-06-03 08:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:20] [INFO ] [Nat]Absence check using state equation in 1914 ms returned sat
[2020-06-03 08:55:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1451 ms returned sat
[2020-06-03 08:55:22] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 200 ms.
[2020-06-03 08:55:22] [INFO ] Added : 12 causal constraints over 3 iterations in 889 ms. Result :sat
[2020-06-03 08:55:22] [INFO ] [Real]Absence check using 45 positive place invariants in 35 ms returned sat
[2020-06-03 08:55:22] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 31 ms returned sat
[2020-06-03 08:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:24] [INFO ] [Real]Absence check using state equation in 2061 ms returned sat
[2020-06-03 08:55:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:55:25] [INFO ] [Nat]Absence check using 45 positive place invariants in 21 ms returned sat
[2020-06-03 08:55:25] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2020-06-03 08:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:26] [INFO ] [Nat]Absence check using state equation in 1892 ms returned sat
[2020-06-03 08:55:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 888 ms returned sat
[2020-06-03 08:55:28] [INFO ] Deduced a trap composed of 72 places in 352 ms
[2020-06-03 08:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 522 ms
[2020-06-03 08:55:28] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 211 ms.
[2020-06-03 08:55:39] [INFO ] Added : 84 causal constraints over 17 iterations in 10842 ms. Result :sat
[2020-06-03 08:55:39] [INFO ] Deduced a trap composed of 19 places in 462 ms
[2020-06-03 08:55:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4287 ms
[2020-06-03 08:55:43] [INFO ] [Real]Absence check using 45 positive place invariants in 34 ms returned sat
[2020-06-03 08:55:43] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned unsat
[2020-06-03 08:55:43] [INFO ] [Real]Absence check using 45 positive place invariants in 31 ms returned sat
[2020-06-03 08:55:43] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 25 ms returned unsat
[2020-06-03 08:55:43] [INFO ] [Real]Absence check using 45 positive place invariants in 20 ms returned unsat
[2020-06-03 08:55:43] [INFO ] [Real]Absence check using 45 positive place invariants in 21 ms returned sat
[2020-06-03 08:55:43] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 19 ms returned sat
[2020-06-03 08:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:45] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2020-06-03 08:55:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:55:46] [INFO ] [Nat]Absence check using 45 positive place invariants in 35 ms returned sat
[2020-06-03 08:55:46] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 35 ms returned sat
[2020-06-03 08:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:55:48] [INFO ] [Nat]Absence check using state equation in 2289 ms returned sat
[2020-06-03 08:55:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1429 ms returned sat
[2020-06-03 08:55:50] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 207 ms.
[2020-06-03 08:55:59] [INFO ] Added : 45 causal constraints over 9 iterations in 9736 ms. Result :sat
[2020-06-03 08:56:00] [INFO ] Deduced a trap composed of 20 places in 510 ms
[2020-06-03 08:56:00] [INFO ] Deduced a trap composed of 19 places in 506 ms
[2020-06-03 08:56:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:56:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 6183 ms
[2020-06-03 08:56:05] [INFO ] [Real]Absence check using 45 positive place invariants in 29 ms returned sat
[2020-06-03 08:56:05] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned sat
[2020-06-03 08:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:08] [INFO ] [Real]Absence check using state equation in 2388 ms returned sat
[2020-06-03 08:56:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:56:08] [INFO ] [Nat]Absence check using 45 positive place invariants in 22 ms returned sat
[2020-06-03 08:56:08] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2020-06-03 08:56:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:10] [INFO ] [Nat]Absence check using state equation in 1766 ms returned sat
[2020-06-03 08:56:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2090 ms returned sat
[2020-06-03 08:56:12] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 161 ms.
[2020-06-03 08:56:13] [INFO ] Added : 23 causal constraints over 5 iterations in 1686 ms. Result :sat
[2020-06-03 08:56:14] [INFO ] Deduced a trap composed of 147 places in 624 ms
[2020-06-03 08:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 974 ms
[2020-06-03 08:56:15] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned unsat
[2020-06-03 08:56:15] [INFO ] [Real]Absence check using 45 positive place invariants in 34 ms returned sat
[2020-06-03 08:56:15] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 3 ms returned unsat
[2020-06-03 08:56:15] [INFO ] [Real]Absence check using 45 positive place invariants in 19 ms returned sat
[2020-06-03 08:56:15] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2020-06-03 08:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:16] [INFO ] [Real]Absence check using state equation in 1622 ms returned sat
[2020-06-03 08:56:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:56:16] [INFO ] [Nat]Absence check using 45 positive place invariants in 38 ms returned sat
[2020-06-03 08:56:17] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 24 ms returned sat
[2020-06-03 08:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:18] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2020-06-03 08:56:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 277 ms returned sat
[2020-06-03 08:56:19] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 216 ms.
[2020-06-03 08:56:26] [INFO ] Added : 68 causal constraints over 14 iterations in 7586 ms. Result :sat
[2020-06-03 08:56:27] [INFO ] Deduced a trap composed of 19 places in 341 ms
[2020-06-03 08:56:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:56:37] [INFO ] Deduced a trap composed of 9 places in 693 ms
[2020-06-03 08:56:37] [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 (> (+ s26 s82 s92 s125 s136 s216 s249 s381 s469) 0)") while checking expression at index 20
[2020-06-03 08:56:37] [INFO ] [Real]Absence check using 45 positive place invariants in 5 ms returned unsat
[2020-06-03 08:56:37] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned unsat
[2020-06-03 08:56:37] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned unsat
[2020-06-03 08:56:37] [INFO ] [Real]Absence check using 45 positive place invariants in 32 ms returned sat
[2020-06-03 08:56:37] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 28 ms returned sat
[2020-06-03 08:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:40] [INFO ] [Real]Absence check using state equation in 2109 ms returned sat
[2020-06-03 08:56:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:56:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 22 ms returned sat
[2020-06-03 08:56:40] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2020-06-03 08:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:41] [INFO ] [Nat]Absence check using state equation in 1783 ms returned sat
[2020-06-03 08:56:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:56:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 3120 ms returned sat
[2020-06-03 08:56:45] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 150 ms.
[2020-06-03 08:56:50] [INFO ] Added : 10 causal constraints over 2 iterations in 5203 ms. Result :sat
[2020-06-03 08:56:50] [INFO ] Deduced a trap composed of 24 places in 583 ms
[2020-06-03 08:56:51] [INFO ] Deduced a trap composed of 19 places in 380 ms
[2020-06-03 08:56:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1554 ms
[2020-06-03 08:56:51] [INFO ] [Real]Absence check using 45 positive place invariants in 32 ms returned sat
[2020-06-03 08:56:51] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 30 ms returned sat
[2020-06-03 08:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:54] [INFO ] [Real]Absence check using state equation in 2237 ms returned sat
[2020-06-03 08:56:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:56:54] [INFO ] [Nat]Absence check using 45 positive place invariants in 34 ms returned sat
[2020-06-03 08:56:54] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned sat
[2020-06-03 08:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:56:58] [INFO ] [Nat]Absence check using state equation in 3802 ms returned sat
[2020-06-03 08:56:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 352 ms returned sat
[2020-06-03 08:56:59] [INFO ] Deduced a trap composed of 147 places in 1386 ms
[2020-06-03 08:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1667 ms
[2020-06-03 08:57:00] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 208 ms.
[2020-06-03 08:57:03] [INFO ] Added : 21 causal constraints over 5 iterations in 3169 ms. Result :sat
[2020-06-03 08:57:03] [INFO ] [Real]Absence check using 45 positive place invariants in 45 ms returned unsat
[2020-06-03 08:57:03] [INFO ] [Real]Absence check using 45 positive place invariants in 199 ms returned sat
[2020-06-03 08:57:03] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 38 ms returned sat
[2020-06-03 08:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:57:06] [INFO ] [Real]Absence check using state equation in 2610 ms returned sat
[2020-06-03 08:57:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:57:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 21 ms returned sat
[2020-06-03 08:57:06] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2020-06-03 08:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:57:10] [INFO ] [Nat]Absence check using state equation in 3398 ms returned sat
[2020-06-03 08:57:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 404 ms returned sat
[2020-06-03 08:57:10] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 159 ms.
[2020-06-03 08:57:11] [INFO ] Added : 15 causal constraints over 3 iterations in 1317 ms. Result :sat
[2020-06-03 08:57:12] [INFO ] [Real]Absence check using 45 positive place invariants in 33 ms returned sat
[2020-06-03 08:57:12] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 31 ms returned sat
[2020-06-03 08:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:57:14] [INFO ] [Real]Absence check using state equation in 2086 ms returned sat
[2020-06-03 08:57:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:57:14] [INFO ] [Nat]Absence check using 45 positive place invariants in 192 ms returned sat
[2020-06-03 08:57:14] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 46 ms returned sat
[2020-06-03 08:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:57:17] [INFO ] [Nat]Absence check using state equation in 2518 ms returned sat
[2020-06-03 08:57:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 08:57:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 3810 ms returned sat
[2020-06-03 08:57:21] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 196 ms.
[2020-06-03 08:57:23] [INFO ] Added : 24 causal constraints over 5 iterations in 2973 ms. Result :sat
[2020-06-03 08:57:24] [INFO ] [Real]Absence check using 45 positive place invariants in 34 ms returned sat
[2020-06-03 08:57:24] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 32 ms returned sat
[2020-06-03 08:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:57:25] [INFO ] [Real]Absence check using state equation in 1787 ms returned sat
[2020-06-03 08:57:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:57:26] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2020-06-03 08:57:26] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 23 ms returned sat
[2020-06-03 08:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:57:29] [INFO ] [Nat]Absence check using state equation in 3406 ms returned sat
[2020-06-03 08:57:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-03 08:57:29] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 237 ms.
[2020-06-03 08:57:37] [INFO ] Added : 56 causal constraints over 12 iterations in 8144 ms. Result :sat
[2020-06-03 08:57:38] [INFO ] Deduced a trap composed of 19 places in 877 ms
[2020-06-03 08:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1304 ms
[2020-06-03 08:57:39] [INFO ] [Real]Absence check using 45 positive place invariants in 55 ms returned sat
[2020-06-03 08:57:39] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 6 ms returned unsat
Successfully simplified 17 atomic propositions for a total of 18 simplifications.
[2020-06-03 08:57:39] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-06-03 08:57:40] [INFO ] Flatten gal took : 544 ms
FORMULA PolyORBNT-PT-S10J20-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:57:40] [INFO ] Flatten gal took : 227 ms
[2020-06-03 08:57:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J20-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:57:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 08:57:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 30 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBNT-PT-S10J20 @ 3570 seconds

FORMULA PolyORBNT-PT-S10J20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBNT-PT-S10J20-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3546
rslt: Output for LTLCardinality @ PolyORBNT-PT-S10J20

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 08:57:41 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "F (G ((X ((p11 + 1 <= p0 + p117 + p125 + p168 + p223 + p261 + p297 + p298 + p313 + p316 + p342 + p372 + p391 + p404 + p418 + p421 + p40 + p24 + p53 + p80 + p94)) OR (p23 + 1 <= p314))))",
"processed_size": 185,
"rewrites": 19
},
"result":
{
"edges": 18,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1182
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "X (X (G ((p464 + 1 <= p67))))",
"processed_size": 29,
"rewrites": 19
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1773
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (G ((1 <= p409))) U (X (F ((F ((p409 <= 0)) OR (p394 + 1 <= p380)))) AND (p266 <= 0)))",
"processed_size": 89,
"rewrites": 19
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3546
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "((p409 <= 0) R F ((p266 + 1 <= p287)))",
"processed_size": 38,
"rewrites": 19
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 35168,
"runtime": 24.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((X(**) OR **))) : X(X(G(*))) : (X(G(**)) U (X(F((F(*) OR *))) AND **)) : (* R F(*))"
},
"net":
{
"arcs": 11909,
"conflict_clusters": 84,
"places": 474,
"places_significant": 402,
"singleton_clusters": 0,
"transitions": 1650
},
"result":
{
"preliminary_value": "no no yes no ",
"value": "no no 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: 2124/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15168
lola: finding significant places
lola: 474 places, 1650 transitions, 402 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 LTLCardinality.xml
lola: F (G (G ((X ((p11 + 1 <= p0 + p117 + p125 + p168 + p223 + p261 + p297 + p298 + p313 + p316 + p342 + p372 + p391 + p404 + p418 + p421 + p40 + p24 + p53 + p80 + p94)) OR (p23 + 1 <= p314))))) : X (G (NOT(X (((F ((p126 + p128 + p139 + p156 + p171 + p186 + p211 + p251 + p276 + p301 + p318 + p333 + p337 + p369 + p379 + p407 + p443 + p469 + p43 + p47 + p66 <= p134 + p175 + p189 + p267 + p335 + p376 + p380 + p445 + p39 + p75)) U (0 <= 0)) U (p67 <= p464)))))) : (X (G ((1 <= p409))) U (NOT(X (G ((G ((1 <= p409)) AND (p380 <= p394))))) AND (p266 <= 0))) : NOT(((1 <= p409) U G ((p287 <= p266))))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p11 + 1 <= p0 + p117 + p125 + p168 + p223 + p261 + p297 + p298 + p313 + p316 + p342 + p372 + p391 + p404 + p418 + p421 + p40 + p24 + p53 + p80 + p94)) OR (p23 + 1 <= p314))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p11 + 1 <= p0 + p117 + p125 + p168 + p223 + p261 + p297 + p298 + p313 + p316 + p342 + p372 + p391 + p404 + p418 + p421 + p40 + p24 + p53 + p80 + p94)) OR (p23 + 1 <= p314))))
lola: processed formula length: 185
lola: 19 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 18 edges
lola: ========================================
lola: subprocess 1 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p464 + 1 <= p67))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p464 + 1 <= p67))))
lola: processed formula length: 29
lola: 19 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p409))) U (X (F ((F ((p409 <= 0)) OR (p394 + 1 <= p380)))) AND (p266 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((1 <= p409))) U (X (F ((F ((p409 <= 0)) OR (p394 + 1 <= p380)))) AND (p266 <= 0)))
lola: processed formula length: 89
lola: 19 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 3 will run for 3546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p409 <= 0) R F ((p266 + 1 <= p287)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p409 <= 0) R F ((p266 + 1 <= p287)))
lola: processed formula length: 38
lola: 19 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no
lola:
preliminary result: no no yes no
lola: memory consumption: 35168 KB
lola: time consumption: 24 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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-S10J20"
export BK_EXAMINATION="LTLCardinality"
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-S10J20, examination is LTLCardinality"
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-158987872200673"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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