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-158987871500203.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 PhilosophersDyn-COL-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871500203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591134274970

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:44:36] [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-02 21:44:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:44:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 21:44:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 532 ms
[2020-06-02 21:44:37] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2020-06-02 21:44:37] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 16 ms.
[2020-06-02 21:44:37] [INFO ] Computed order based on color domains.
[2020-06-02 21:44:37] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 75 ms.
[2020-06-02 21:44:37] [INFO ] Unfolded HLPN properties in 1 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 137 ms.
Incomplete random walk after 100000 steps, including 11923 resets, run finished after 1557 ms. (steps per millisecond=64 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1]
[2020-06-02 21:44:38] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2020-06-02 21:44:39] [INFO ] Computed 39 place invariants in 100 ms
[2020-06-02 21:44:39] [INFO ] [Real]Absence check using 30 positive place invariants in 30 ms returned sat
[2020-06-02 21:44:39] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-02 21:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:44:40] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2020-06-02 21:44:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:44:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-06-02 21:44:40] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-02 21:44:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:44:41] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2020-06-02 21:44:41] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2020-06-02 21:44:41] [INFO ] [Nat]Added 1030 Read/Feed constraints in 755 ms returned sat
[2020-06-02 21:44:42] [INFO ] Deduced a trap composed of 48 places in 439 ms
[2020-06-02 21:44:42] [INFO ] Deduced a trap composed of 48 places in 327 ms
[2020-06-02 21:44:43] [INFO ] Deduced a trap composed of 48 places in 373 ms
[2020-06-02 21:44:43] [INFO ] Deduced a trap composed of 48 places in 302 ms
[2020-06-02 21:44:43] [INFO ] Deduced a trap composed of 50 places in 291 ms
[2020-06-02 21:44:44] [INFO ] Deduced a trap composed of 40 places in 351 ms
[2020-06-02 21:44:45] [INFO ] Deduced a trap composed of 63 places in 415 ms
[2020-06-02 21:44:45] [INFO ] Deduced a trap composed of 75 places in 378 ms
[2020-06-02 21:44:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3763 ms
[2020-06-02 21:44:46] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 686 ms.
[2020-06-02 21:45: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 (=> (> t969 0) (and (or (and (> t16 0) (< o16 o969)) (and (> t100 0) (< o100 o969)) (and (> t140 0) (< o140 o969)) (and (> t149 0) (< o149 o969)) (and (> t157 0) (< o157 o969)) (and (> t165 0) (< o165 o969)) (and (> t173 0) (< o173 o969)) (and (> t181 0) (< o181 o969)) (and (> t198 0) (< o198 o969)) (and (> t206 0) (< o206 o969)) (and (> t214 0) (< o214 o969)) (and (> t267 0) (< o267 o969)) (and (> t348 0) (< o348 o969)) (and (> t429 0) (< o429 o969)) (and (> t510 0) (< o510 o969)) (and (> t590 0) (< o590 o969)) (and (> t671 0) (< o671 o969)) (and (> t752 0) (< o752 o969)) (and (> t833 0) (< o833 o969)) (and (> t1005 0) (< o1005 o969)) (and (> t1006 0) (< o1006 o969)) (and (> t1007 0) (< o1007 o969)) (and (> t1008 0) (< o1008 o969)) (and (> t1009 0) (< o1009 o969)) (and (> t1010 0) (< o1010 o969)) (and (> t1011 0) (< o1011 o969)) (and (> t1012 0) (< o1012 o969))) (or (and (> t16 0) (< o16 o969)) (and (> t60 0) (< o60 o969)) (and (> t149 0) (< o149 o969)) (and (> t229 0) (< o229 o969)) (and (> t310 0) (< o310 o969)) (and (> t391 0) (< o391 o969)) (and (> t472 0) (< o472 o969)) (and (> t541 0) (< o541 o969)) (and (> t558 0) (< o558 o969)) (and (> t566 0) (< o566 o969)) (and (> t574 0) (< o574 o969)) (and (> t582 0) (< o582 o969)) (and (> t590 0) (< o590 o969)) (and (> t599 0) (< o599 o969)) (and (> t607 0) (< o607 o969)) (and (> t615 0) (< o615 o969)) (and (> t635 0) (< o635 o969)) (and (> t716 0) (< o716 o969)) (and (> t797 0) (< o797 o969)) (and (> t1369 0) (< o1369 o969)) (and (> t1370 0) (< o1370 o969)) (and (> t1371 0) (< o1371 o969)) (and (> t1372 0) (< o1372 o969)) (and (> t1373 0) (< o1373 o969)) (and (> t1374 0) (< o1374 o969)) (and (> t1375 0) (< o1375 o969)) (and (> t1376 0) (< o1376 o969))) (or (and (> t15 0) (< o15 o969)) (and (> t16 0) (< o16 o969)) (and (> t17 0) (< o17 o969)) (and (> t18 0) (< o18 o969)) (and (> t19 0) (< o19 o969)) (and (> t20 0) (< o20 o969)) (and (> t27 0) (< o27 o969)) (and (> t34 0) (< o34 o969)) (and (> t42 0) (< o42 o969)) (and (> t51 0) (< o51 o969)) (and (> t60 0) (< o60 o969)) (and (> t69 0) (< o69 o969)) (and (> t78 0) (< o78 o969)) (and (> t87 0) (< o87 o969)) (and (> t96 0) (< o96 o969)) (and (> t105 0) (< o105 o969)) (and (> t114 0) (< o114 o969)) (and (> t123 0) (< o123 o969)) (and (> t132 0) (< o132 o969)) (and (> t140 0) (< o140 o969)) (and (> t149 0) (< o149 o969)) (and (> t157 0) (< o157 o969)) (and (> t165 0) (< o165 o969)) (and (> t173 0) (< o173 o969)) (and (> t181 0) (< o181 o969)) (and (> t198 0) (< o198 o969)) (and (> t206 0) (< o206 o969)) (and (> t214 0) (< o214 o969)) (and (> t221 0) (< o221 o969)) (and (> t229 0) (< o229 o969)) (and (> t238 0) (< o238 o969)) (and (> t246 0) (< o246 o969)) (and (> t254 0) (< o254 o969)) (and (> t262 0) (< o262 o969)) (and (> t279 0) (< o279 o969)) (and (> t287 0) (< o287 o969)) (and (> t295 0) (< o295 o969)) (and (> t302 0) (< o302 o969)) (and (> t310 0) (< o310 o969)) (and (> t318 0) (< o318 o969)) (and (> t327 0) (< o327 o969)) (and (> t335 0) (< o335 o969)) (and (> t343 0) (< o343 o969)) (and (> t360 0) (< o360 o969)) (and (> t368 0) (< o368 o969)) (and (> t376 0) (< o376 o969)) (and (> t383 0) (< o383 o969)) (and (> t391 0) (< o391 o969)) (and (> t399 0) (< o399 o969)) (and (> t407 0) (< o407 o969)) (and (> t416 0) (< o416 o969)) (and (> t424 0) (< o424 o969)) (and (> t441 0) (< o441 o969)) (and (> t449 0) (< o449 o969)) (and (> t457 0) (< o457 o969)) (and (> t464 0) (< o464 o969)) (and (> t472 0) (< o472 o969)) (and (> t480 0) (< o480 o969)) (and (> t488 0) (< o488 o969)) (and (> t496 0) (< o496 o969)) (and (> t505 0) (< o505 o969)) (and (> t522 0) (< o522 o969)) (and (> t530 0) (< o530 o969)) (and (> t538 0) (< o538 o969)) (and (> t627 0) (< o627 o969)) (and (> t635 0) (< o635 o969)) (and (> t643 0) (< o643 o969)) (and (> t651 0) (< o651 o969)) (and (> t659 0) (< o659 o969)) (and (> t667 0) (< o667 o969)) (and (> t684 0) (< o684 o969)) (and (> t693 0) (< o693 o969)) (and (> t701 0) (< o701 o969)) (and (> t708 0) (< o708 o969)) (and (> t716 0) (< o716 o969)) (and (> t724 0) (< o724 o969)) (and (> t732 0) (< o732 o969)) (and (> t740 0) (< o740 o969)) (and (> t748 0) (< o748 o969)) (and (> t765 0) (< o765 o969)) (and (> t773 0) (< o773 o969)) (and (> t782 0) (< o782 o969)) (and (> t789 0) (< o789 o969)) (and (> t797 0) (< o797 o969)) (and (> t805 0) (< o805 o969)) (and (> t813 0) (< o813 o969)) (and (> t821 0) (< o821 o969)) (and (> t829 0) (< o829 o969)) (and (> t846 0) (< o846 o969)) (and (> t854 0) (< o854 o969)) (and (> t862 0) (< o862 o969)) (and (> t1801 0) (< o1801 o969)) (and (> t1811 0) (< o1811 o969)) (and (> t1821 0) (< o1821 o969)) (and (> t1831 0) (< o1831 o969)) (and (> t1841 0) (< o1841 o969)) (and (> t1851 0) (< o1851 o969)) (and (> t1861 0) (< o1861 o969)) (and (> t1871 0) (< o1871 o969)) (and (> t1881 0) (< o1881 o969)) (and (> t1891 0) (< o1891 o969))) (or (and (> t15 0) (< o15 o969)) (and (> t16 0) (< o16 o969)) (and (> t17 0) (< o17 o969)) (and (> t18 0) (< o18 o969)) (and (> t19 0) (< o19 o969)) (and (> t20 0) (< o20 o969)) (and (> t27 0) (< o27 o969)) (and (> t34 0) (< o34 o969)) (and (> t42 0) (< o42 o969)) (and (> t1801 0) (< o1801 o969)) (and (> t1811 0) (< o1811 o969)) (and (> t1821 0) (< o1821 o969)) (and (> t1831 0) (< o1831 o969)) (and (> t1841 0) (< o1841 o969)) (and (> t1851 0) (< o1851 o969)) (and (> t1855 0) (< o1855 o969)) (and (> t1856 0) (< o1856 o969)) (and (> t1857 0) (< o1857 o969)) (and (> t1858 0) (< o1858 o969)) (and (> t1859 0) (< o1859 o969)) (and (> t1860 0) (< o1860 o969)) (and (> t1861 0) (< o1861 o969)) (and (> t1862 0) (< o1862 o969)) (and (> t1863 0) (< o1863 o969)) (and (> t1864 0) (< o1864 o969)) (and (> t1871 0) (< o1871 o969)) (and (> t1881 0) (< o1881 o969)) (and (> t1891 0) (< o1891 o969)))))") while checking expression at index 0
[2020-06-02 21:45:00] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-06-02 21:45:00] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-02 21:45:00] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 8 ms returned sat
[2020-06-02 21:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:01] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2020-06-02 21:45:01] [INFO ] [Real]Added 1030 Read/Feed constraints in 215 ms returned sat
[2020-06-02 21:45:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:45:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 46 ms returned sat
[2020-06-02 21:45:01] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 8 ms returned sat
[2020-06-02 21:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:03] [INFO ] [Nat]Absence check using state equation in 1473 ms returned sat
[2020-06-02 21:45:04] [INFO ] [Nat]Added 1030 Read/Feed constraints in 971 ms returned sat
[2020-06-02 21:45:04] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 247 ms.
[2020-06-02 21:45:21] [INFO ] Added : 125 causal constraints over 25 iterations in 17396 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 21:45:21] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-02 21:45:21] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-02 21:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:22] [INFO ] [Real]Absence check using state equation in 657 ms returned unsat
[2020-06-02 21:45:22] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-06-02 21:45:22] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:23] [INFO ] [Real]Absence check using state equation in 905 ms returned sat
[2020-06-02 21:45:23] [INFO ] [Real]Added 1030 Read/Feed constraints in 286 ms returned sat
[2020-06-02 21:45:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:45:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2020-06-02 21:45:23] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:24] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2020-06-02 21:45:25] [INFO ] [Nat]Added 1030 Read/Feed constraints in 719 ms returned sat
[2020-06-02 21:45:25] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 461 ms.
[2020-06-02 21:45:43] [INFO ] Added : 110 causal constraints over 22 iterations in 18300 ms. Result :unknown
[2020-06-02 21:45:43] [INFO ] [Real]Absence check using 30 positive place invariants in 78 ms returned sat
[2020-06-02 21:45:43] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 10 ms returned sat
[2020-06-02 21:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:45] [INFO ] [Real]Absence check using state equation in 1652 ms returned sat
[2020-06-02 21:45:45] [INFO ] [Real]Added 1030 Read/Feed constraints in 312 ms returned sat
[2020-06-02 21:45:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:45:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-02 21:45:46] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:45:46] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2020-06-02 21:45:47] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1006 ms returned sat
[2020-06-02 21:45:48] [INFO ] Deduced a trap composed of 48 places in 649 ms
[2020-06-02 21:45:49] [INFO ] Deduced a trap composed of 48 places in 624 ms
[2020-06-02 21:45:51] [INFO ] Deduced a trap composed of 48 places in 2385 ms
[2020-06-02 21:45:52] [INFO ] Deduced a trap composed of 48 places in 796 ms
[2020-06-02 21:45:55] [INFO ] Deduced a trap composed of 48 places in 2633 ms
[2020-06-02 21:45:56] [INFO ] Deduced a trap composed of 61 places in 1071 ms
[2020-06-02 21:45:57] [INFO ] Deduced a trap composed of 63 places in 529 ms
[2020-06-02 21:45:57] [INFO ] Deduced a trap composed of 70 places in 609 ms
[2020-06-02 21:45:58] [INFO ] Deduced a trap composed of 48 places in 748 ms
[2020-06-02 21:46:00] [INFO ] Deduced a trap composed of 54 places in 1909 ms
[2020-06-02 21:46:01] [INFO ] Deduced a trap composed of 48 places in 498 ms
[2020-06-02 21:46:01] [INFO ] Deduced a trap composed of 48 places in 597 ms
[2020-06-02 21:46:02] [INFO ] Deduced a trap composed of 40 places in 570 ms
[2020-06-02 21:46:04] [INFO ] Deduced a trap composed of 74 places in 1714 ms
[2020-06-02 21:46:05] [INFO ] Deduced a trap composed of 69 places in 1211 ms
[2020-06-02 21:46:06] [INFO ] Deduced a trap composed of 83 places in 625 ms
[2020-06-02 21:46:06] [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 (> (+ s10 s11 s12 s15 s16 s17 s23 s24 s25 s30 s31 s33 s34 s35 s37 s38 s40 s41 s42 s44 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s57 s58 s60 s61 s62 s63 s64 s65 s70 s71 s72 s75 s76 s77 s78 s79 s90 s93 s94 s95 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s120 s121 s122 s126 s127 s128 s129 s150 s151 s152 s155 s156 s157 s158 s159 s160 s161 s162 s163 s165 s166 s168 s169) 0)") while checking expression at index 5
[2020-06-02 21:46:06] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-06-02 21:46:06] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-02 21:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:46:07] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2020-06-02 21:46:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:46:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-06-02 21:46:08] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:46:09] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2020-06-02 21:46:10] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1007 ms returned sat
[2020-06-02 21:46:10] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 302 ms.
[2020-06-02 21:46:23] [INFO ] Added : 80 causal constraints over 16 iterations in 13008 ms. Result :sat
[2020-06-02 21:46:23] [INFO ] [Real]Absence check using 30 positive place invariants in 41 ms returned sat
[2020-06-02 21:46:23] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 8 ms returned unsat
[2020-06-02 21:46:23] [INFO ] [Real]Absence check using 30 positive place invariants in 54 ms returned sat
[2020-06-02 21:46:23] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 24 ms returned sat
[2020-06-02 21:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:46:24] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2020-06-02 21:46:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:46:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-06-02 21:46:24] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-02 21:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:46:26] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2020-06-02 21:46:27] [INFO ] [Nat]Added 1030 Read/Feed constraints in 786 ms returned sat
[2020-06-02 21:46:27] [INFO ] Deduced a trap composed of 48 places in 581 ms
[2020-06-02 21:46:28] [INFO ] Deduced a trap composed of 51 places in 357 ms
[2020-06-02 21:46:29] [INFO ] Deduced a trap composed of 40 places in 1041 ms
[2020-06-02 21:46:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2567 ms
[2020-06-02 21:46:29] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 291 ms.
[2020-06-02 21:46:44] [INFO ] Added : 110 causal constraints over 22 iterations in 15212 ms. Result :(error "Failed to check-sat")
[2020-06-02 21:46:44] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-06-02 21:46:44] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 8 ms returned sat
[2020-06-02 21:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:46:45] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2020-06-02 21:46:46] [INFO ] [Real]Added 1030 Read/Feed constraints in 398 ms returned sat
[2020-06-02 21:46:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:46:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-02 21:46:46] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-02 21:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:46:47] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2020-06-02 21:46:47] [INFO ] [Nat]Added 1030 Read/Feed constraints in 870 ms returned sat
[2020-06-02 21:46:48] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 403 ms.
[2020-06-02 21:47:00] [INFO ] Added : 85 causal constraints over 17 iterations in 12377 ms. Result :sat
[2020-06-02 21:47:00] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-06-02 21:47:00] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:47:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:47:01] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2020-06-02 21:47:01] [INFO ] [Real]Added 1030 Read/Feed constraints in 358 ms returned sat
[2020-06-02 21:47:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:47:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-02 21:47:02] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-02 21:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:47:02] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2020-06-02 21:47:03] [INFO ] [Nat]Added 1030 Read/Feed constraints in 701 ms returned sat
[2020-06-02 21:47:04] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 491 ms.
[2020-06-02 21:47:15] [INFO ] Added : 85 causal constraints over 17 iterations in 11672 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-02 21:47:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 21:47:16] [INFO ] Flatten gal took : 427 ms
[2020-06-02 21:47:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 21:47:16] [INFO ] Flatten gal took : 311 ms
FORMULA PhilosophersDyn-COL-10-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 21:47:16] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 16 ms.
[2020-06-02 21:47:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PhilosophersDyn-COL-10 @ 3570 seconds
check_solution: Variable C400 = -1 is below its lower bound 0
check_solution: Variable C715 = -1 is below its lower bound 0
check_solution: Variable C725 = -1 is below its lower bound 0
check_solution: Variable C735 = -1 is below its lower bound 0
check_solution: Variable C745 = -1 is below its lower bound 0
check_solution: Variable C755 = -1 is below its lower bound 0
check_solution: Variable C1011 = -1 is below its lower bound 0
check_solution: Variable C1012 = -1 is below its lower bound 0
check_solution: Variable C1013 = -1 is below its lower bound 0
check_solution: Variable C1014 = -1 is below its lower bound 0

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA PhilosophersDyn-COL-10-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3475
rslt: Output for CTLCardinality @ PhilosophersDyn-COL-10

{
"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": "Tue Jun 2 21:47:16 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 234
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 251
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 120,
"visible_transitions": 0
},
"processed": "EX((EX((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND AF((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))",
"processed_size": 753,
"rewrites": 32
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 302,
"markings": 253,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))",
"processed_size": 82,
"rewrites": 30
},
"result":
{
"edges": 617305,
"markings": 199051,
"produced_by": "state space",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2)",
"processed_size": 74,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2155
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 110,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 110,
"visible_transitions": 0
},
"processed": "EX((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))",
"processed_size": 664,
"rewrites": 30
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))",
"processed_size": 82,
"rewrites": 30
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"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": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 120,
"visible_transitions": 0
},
"processed": "E (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))))",
"processed_size": 749,
"rewrites": 30
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2255
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "AF(EG((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 2)))",
"processed_size": 602,
"rewrites": 31
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 160,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 130,
"visible_transitions": 0
},
"processed": "EG((AF((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))))",
"processed_size": 1044,
"rewrites": 31
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 868,
"markings": 438,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 499
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2)",
"processed_size": 74,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 583
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)",
"processed_size": 144,
"rewrites": 33
},
"result":
{
"edges": 1507,
"markings": 617,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 110
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 699
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G ((((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0) OR (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))",
"processed_size": 309,
"rewrites": 31
},
"result":
{
"edges": 16,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 874
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1)",
"processed_size": 74,
"rewrites": 32
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1166
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "E (((3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))",
"processed_size": 227,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 100
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1166
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) U ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) AND (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))",
"processed_size": 374,
"rewrites": 32
},
"result":
{
"edges": 617305,
"markings": 199051,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1055
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1737
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2)",
"processed_size": 74,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 260,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 150,
"visible_transitions": 0
},
"processed": "((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))))",
"processed_size": 1638,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 120,
"visible_transitions": 0
},
"processed": "((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))",
"processed_size": 741,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2255
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 106236,
"runtime": 95.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G((A(F(**)) OR (** OR (** OR **))))) : (NODEADLOCK OR A(X(A(G(**))))) : A(F(A(G(**)))) : E(X((E(X(**)) AND A(F(**))))) : (A(F(A(G(**)))) OR **) : E(F(**)) : (A(X(*)) AND E(F(**))) : E(G(E(F(*)))) : (A(F(**)) OR E(X(**))) : A(F(E(G(*)))) : (A((** U **)) AND E((** U **))) : (A(F(*)) AND (** OR (A(G(*)) OR **))) : E(G(**)) : (E((** U **)) OR A(F(**))) : A(G((** OR A(F(**)))))"
},
"net":
{
"arcs": 17110,
"conflict_clusters": 1,
"places": 170,
"places_significant": 131,
"singleton_clusters": 0,
"transitions": 2265
},
"result":
{
"preliminary_value": "yes yes no no no yes no yes no yes no no yes no no ",
"value": "yes yes no no no yes no yes no yes no no yes no 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: 2435/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2265 transitions, 131 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: E (G ((((A (F ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))) OR (2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) OR (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))) : (E (X (E (G ((0 <= 0))))) OR A (G (A (X ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))))) : A (F (A (G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) : E (X ((E (X ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) AND A (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))) : (A (F (A (G ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))))) OR ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))))) : E (((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U E (F ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))))) : (NOT(E (X (((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) AND (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) AND E (F (A (F ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))))) : E (G (NOT(A (G ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))))) : (A (((0 <= 0) U (3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR E (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))) : A (F (NOT(A (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))))) : (A ((((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) OR (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)) U (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 2))) AND E (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) U ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) AND (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))) : (NOT(E (G (((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))))) AND ((((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2) OR (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 2)) OR NOT(E (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))) OR ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) AND (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))) : E (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))) : (E (((3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))) OR A (F (A (F ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))))) : A (G ((((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0) OR (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR A (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:326
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK OR A (X (A (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (X ((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) AND A (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EX((1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND AF((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p... (shortened)
lola: processed formula length: 753
lola: 32 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 253 markings, 302 edges
lola: ========================================
lola: subprocess 2 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2) OR (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))) AND E (F ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))
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 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))
lola: processed formula length: 82
lola: 30 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 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
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: sara is running 0 secs || 35018 markings, 99901 edges, 7004 markings/sec, 0 secs
lola: sara is running 5 secs || 79884 markings, 238010 edges, 8973 markings/sec, 5 secs
lola: sara is running 10 secs || 123783 markings, 376883 edges, 8780 markings/sec, 10 secs
lola: sara is running 15 secs || 168285 markings, 518008 edges, 8900 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 199051 markings, 617305 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR E (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
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: (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2)
lola: processed formula length: 74
lola: 32 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: (3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)
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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 ... (shortened)
lola: processed formula length: 664
lola: 30 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))
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 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))
lola: processed formula length: 82
lola: 30 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 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
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: 6 markings, 5 edges
lola: subprocess 5 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + ... (shortened)
lola: processed formula length: 749
lola: 30 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 equation: write sara problem file to CTLCardinality-4-0.sara
lola: ========================================
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 0))
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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p... (shortened)
lola: processed formula length: 602
lola: 31 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))) OR ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67... (shortened)
lola: processed formula length: 1044
lola: 31 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: 438 markings, 868 edges
lola: ========================================
lola: subprocess 8 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2)
lola: processed formula length: 74
lola: 32 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: (3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
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 /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 5 markings, 4 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 9 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
lola: processed formula length: 144
lola: 33 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
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 /EGEF
lola: The predicate is not eventually invariant.
lola: 617 markings, 1507 edges
lola: ========================================
lola: subprocess 10 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0) OR (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR A (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0) OR (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))
lola: processed formula length: 309
lola: 31 rewrites
lola: closed formula file CTLCardinality.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 13 markings, 16 edges
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))) OR A (F ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))
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: (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1)
lola: processed formula length: 74
lola: 32 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: (2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 1166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: processed formula length: 227
lola: 32 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 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: (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + 1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
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 /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: ========================================
lola: subprocess 12 will run for 1166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) OR (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)) U (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 2))) AND E (((p130 + p131 + p132 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) U ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) AND (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) U ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) AND (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))
lola: processed formula length: 374
lola: 32 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 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: ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) AND (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 37205 markings, 108110 edges, 7441 markings/sec, 0 secs
lola: sara is running 5 secs || 82940 markings, 248354 edges, 9147 markings/sec, 5 secs
lola: sara is running 10 secs || 128541 markings, 393150 edges, 9120 markings/sec, 10 secs
lola: sara is running 15 secs || 174615 markings, 539549 edges, 9215 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 199051 markings, 617305 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))))) OR ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2)
lola: processed formula length: 74
lola: 33 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: state equation task get result started, id 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 5 markings, 4 edges
lola: formula 0: (3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 3475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 1) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + ... (shortened)
lola: processed formula length: 1638
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 3475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= 0) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= 0) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p2... (shortened)
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: ((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 +... (shortened)
lola: processed formula length: 741
lola: 32 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: formula 0: ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= 0) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))
lola: state equation task get result unparse finished id 0
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no yes no yes no no yes no no
lola:
preliminary result: yes yes no no no yes no yes no yes no no yes no no
lola: memory consumption: 106236 KB
lola: time consumption: 95 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="PhilosophersDyn-COL-10"
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 PhilosophersDyn-COL-10, 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-158987871500203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 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 ;