Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267800094.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-COL-S02J04T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 09:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 154K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621182956976

Running Version 0
[2021-05-16 16:35:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 16:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 16:35:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-16 16:35:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 16:36:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 798 ms
[2021-05-16 16:36:00] [INFO ] ms1 symmetric to ms2 in transition T_1124
[2021-05-16 16:36:00] [INFO ] ms1 symmetric to ms2 in transition T_1125
[2021-05-16 16:36:00] [INFO ] ms2 symmetric to ms3 in transition T_1125
[2021-05-16 16:36:00] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2021-05-16 16:36:00] [INFO ] ms4 symmetric to ms2 in transition T_1126
[2021-05-16 16:36:00] [INFO ] ms2 symmetric to ms3 in transition T_1126
[2021-05-16 16:36:00] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 16:36:00] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions in 51 ms.
[2021-05-16 16:36:00] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_14593859897573598201.dot
Incomplete random walk after 100000 steps, including 50 resets, run finished after 313 ms. (steps per millisecond=319 ) properties (out of 16) seen :4
Running SMT prover for 12 properties.
[2021-05-16 16:36:00] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2021-05-16 16:36:00] [INFO ] Computed 26 place invariants in 12 ms
[2021-05-16 16:36:00] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2021-05-16 16:36:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 16 ms returned sat
[2021-05-16 16:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:00] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-16 16:36:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 16:36:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2021-05-16 16:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:00] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-16 16:36:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-16 16:36:00] [INFO ] [Nat]Added 9 Read/Feed constraints in 27 ms returned sat
[2021-05-16 16:36:01] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2021-05-16 16:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2021-05-16 16:36:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-16 16:36:01] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2021-05-16 16:36:01] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2021-05-16 16:36:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2021-05-16 16:36:01] [INFO ] Added : 63 causal constraints over 14 iterations in 403 ms. Result :sat
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 30 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-16 16:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Nat]Added 9 Read/Feed constraints in 24 ms returned sat
[2021-05-16 16:36:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 16:36:01] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2021-05-16 16:36:01] [INFO ] Deduced a trap composed of 33 places in 16 ms of which 0 ms to minimize.
[2021-05-16 16:36:01] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2021-05-16 16:36:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 118 ms
[2021-05-16 16:36:01] [INFO ] Added : 57 causal constraints over 12 iterations in 249 ms. Result :sat
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 16:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:36:02] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 1 ms to minimize.
[2021-05-16 16:36:02] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2021-05-16 16:36:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2021-05-16 16:36:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 16:36:02] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2021-05-16 16:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-16 16:36:02] [INFO ] Added : 62 causal constraints over 13 iterations in 210 ms. Result :sat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-16 16:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 16:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:36:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-16 16:36:02] [INFO ] Added : 62 causal constraints over 13 iterations in 83 ms. Result :sat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-16 16:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:02] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-16 16:36:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2021-05-16 16:36:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2021-05-16 16:36:03] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2021-05-16 16:36:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2021-05-16 16:36:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-16 16:36:03] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2021-05-16 16:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-16 16:36:03] [INFO ] Added : 60 causal constraints over 12 iterations in 173 ms. Result :sat
[2021-05-16 16:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:36:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2021-05-16 16:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 16:36:03] [INFO ] Flatten gal took : 24 ms
[2021-05-16 16:36:03] [INFO ] Flatten gal took : 19 ms
[2021-05-16 16:36:03] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1412 transitions in 21 ms.
[2021-05-16 16:36:03] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2096621893213576987.dot
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :4
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2021-05-16 16:36:03] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2021-05-16 16:36:03] [INFO ] Computed 54 place invariants in 53 ms
[2021-05-16 16:36:03] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2021-05-16 16:36:03] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 45 ms returned sat
[2021-05-16 16:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:05] [INFO ] [Real]Absence check using state equation in 1283 ms returned sat
[2021-05-16 16:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2021-05-16 16:36:05] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 18 ms returned sat
[2021-05-16 16:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:10] [INFO ] [Nat]Absence check using state equation in 4876 ms returned unknown
[2021-05-16 16:36:10] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2021-05-16 16:36:10] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned sat
[2021-05-16 16:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:11] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2021-05-16 16:36:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2021-05-16 16:36:11] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-16 16:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:12] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2021-05-16 16:36:12] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 16:36:14] [INFO ] [Nat]Added 130 Read/Feed constraints in 1891 ms returned sat
[2021-05-16 16:36:14] [INFO ] Deduced a trap composed of 65 places in 34 ms of which 1 ms to minimize.
[2021-05-16 16:36:15] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2021-05-16 16:36:16] [INFO ] Deduced a trap composed of 429 places in 557 ms of which 1 ms to minimize.
[2021-05-16 16:36:17] [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 close... while checking expression at index 1
[2021-05-16 16:36:17] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2021-05-16 16:36:17] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2021-05-16 16:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:17] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2021-05-16 16:36:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2021-05-16 16:36:18] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned sat
[2021-05-16 16:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:18] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2021-05-16 16:36:19] [INFO ] [Nat]Added 130 Read/Feed constraints in 1349 ms returned sat
[2021-05-16 16:36:20] [INFO ] Deduced a trap composed of 65 places in 383 ms of which 0 ms to minimize.
[2021-05-16 16:36:21] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 1 ms to minimize.
[2021-05-16 16:36:21] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 0 ms to minimize.
[2021-05-16 16:36:21] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 0 ms to minimize.
[2021-05-16 16:36:21] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2021-05-16 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1975 ms
[2021-05-16 16:36:22] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 78 ms.
[2021-05-16 16:36:23] [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: Broken pipe ... while checking expression at index 2
[2021-05-16 16:36:23] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2021-05-16 16:36:23] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2021-05-16 16:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:24] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2021-05-16 16:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:36:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2021-05-16 16:36:24] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-16 16:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:36:24] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2021-05-16 16:36:25] [INFO ] [Nat]Added 130 Read/Feed constraints in 941 ms returned sat
[2021-05-16 16:36:26] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 0 ms to minimize.
[2021-05-16 16:36:26] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 0 ms to minimize.
[2021-05-16 16:36:26] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 0 ms to minimize.
[2021-05-16 16:36:27] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2021-05-16 16:36:27] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2021-05-16 16:36:27] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 0 ms to minimize.
[2021-05-16 16:36:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1914 ms
[2021-05-16 16:36:27] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 101 ms.
[2021-05-16 16:36:29] [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 close... while checking expression at index 3
Fused 4 Parikh solutions to 1 different solutions.
Support contains 89 out of 752 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 750 transition count 1372
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 92 place count 710 transition count 1362
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 102 place count 700 transition count 1362
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 102 place count 700 transition count 1292
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 242 place count 630 transition count 1292
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 342 place count 580 transition count 1242
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 362 place count 580 transition count 1222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 382 place count 560 transition count 1222
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 392 place count 560 transition count 1222
Applied a total of 392 rules in 291 ms. Remains 560 /752 variables (removed 192) and now considering 1222/1412 (removed 190) transitions.
[2021-05-16 16:36:29] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 560 cols
[2021-05-16 16:36:29] [INFO ] Computed 52 place invariants in 29 ms
[2021-05-16 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 726 ms returned [532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651]
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions :[651, 650, 649, 648, 647, 646, 645, 644, 643, 642, 641, 640, 639, 638, 637, 636, 635, 634, 633, 632, 631, 630, 629, 628, 627, 626, 625, 624, 623, 622, 621, 620, 619, 618, 617, 616, 615, 614, 613, 612, 611, 610, 609, 608, 607, 606, 605, 604, 603, 602, 601, 600, 599, 598, 597, 596, 595, 594, 593, 592, 591, 590, 589, 588, 587, 586, 585, 584, 583, 582, 581, 580, 579, 578, 577, 576, 575, 574, 573, 572, 571, 570, 569, 568, 567, 566, 565, 564, 563, 562, 561, 560, 559, 558, 557, 556, 555, 554, 553, 552, 541, 540, 539, 538, 537, 536, 535, 534, 533, 532]
Starting structural reductions, iteration 1 : 560/752 places, 1112/1412 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 559 transition count 1092
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 21 place count 539 transition count 1072
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 21 rules in 53 ms. Remains 539 /560 variables (removed 21) and now considering 1072/1112 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 539/752 places, 1072/1412 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 16:36:30] [INFO ] Flatten gal took : 109 ms
[2021-05-16 16:36:30] [INFO ] Flatten gal took : 82 ms
[2021-05-16 16:36:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14930254876864068490.gal : 20 ms
[2021-05-16 16:36:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12938516446397149774.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14930254876864068490.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12938516446397149774.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14930254876864068490.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12938516446397149774.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12938516446397149774.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 26
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :38 after 39
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :39 after 75
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :75 after 242
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :242 after 318
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :318 after 482
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :482 after 898
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :898 after 1688
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1688 after 3176
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3176 after 6655
Detected timeout of ITS tools.
[2021-05-16 16:36:45] [INFO ] Flatten gal took : 125 ms
[2021-05-16 16:36:45] [INFO ] Applying decomposition
[2021-05-16 16:36:45] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16407771195641405364.txt, -o, /tmp/graph16407771195641405364.bin, -w, /tmp/graph16407771195641405364.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16407771195641405364.bin, -l, -1, -v, -w, /tmp/graph16407771195641405364.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:36:46] [INFO ] Decomposing Gal with order
[2021-05-16 16:36:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:36:46] [INFO ] Removed a total of 1529 redundant transitions.
[2021-05-16 16:36:46] [INFO ] Flatten gal took : 396 ms
[2021-05-16 16:36:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 704 labels/synchronizations in 114 ms.
[2021-05-16 16:36:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16055603855237281781.gal : 33 ms
[2021-05-16 16:36:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4888833756027329024.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16055603855237281781.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4888833756027329024.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16055603855237281781.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4888833756027329024.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4888833756027329024.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :7 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :21 after 31
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :31 after 37
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :37 after 174
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :174 after 294
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :294 after 480
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :480 after 1266
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1266 after 13011
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :13011 after 30455
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :30455 after 39696
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15982748732332731958
[2021-05-16 16:37:02] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15982748732332731958
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15982748732332731958]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15982748732332731958] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15982748732332731958] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 261 resets, run finished after 4278 ms. (steps per millisecond=233 ) properties (out of 3) seen :1
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 291 resets, run finished after 2059 ms. (steps per millisecond=485 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-16 16:37:11] [INFO ] Flow matrix only has 1052 transitions (discarded 20 similar events)
// Phase 1: matrix 1052 rows 538 cols
[2021-05-16 16:37:11] [INFO ] Computed 52 place invariants in 15 ms
[2021-05-16 16:37:11] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 16:37:11] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 14 ms returned sat
[2021-05-16 16:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:37:11] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-16 16:37:11] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 16:37:11] [INFO ] [Real]Added 130 Read/Feed constraints in 119 ms returned sat
[2021-05-16 16:37:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:37:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 16:37:11] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 18 ms returned sat
[2021-05-16 16:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:37:12] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2021-05-16 16:37:12] [INFO ] [Nat]Added 130 Read/Feed constraints in 122 ms returned sat
[2021-05-16 16:37:12] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 0 ms to minimize.
[2021-05-16 16:37:12] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 1 ms to minimize.
[2021-05-16 16:37:12] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 1 ms to minimize.
[2021-05-16 16:37:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2021-05-16 16:37:13] [INFO ] Computed and/alt/rep : 420/798/410 causal constraints (skipped 640 transitions) in 111 ms.
[2021-05-16 16:37:16] [INFO ] Added : 282 causal constraints over 57 iterations in 3156 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-16 16:37:16] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 16:37:16] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 14 ms returned sat
[2021-05-16 16:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:37:16] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2021-05-16 16:37:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:37:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2021-05-16 16:37:16] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 15 ms returned sat
[2021-05-16 16:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:37:17] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2021-05-16 16:37:17] [INFO ] [Nat]Added 130 Read/Feed constraints in 124 ms returned sat
[2021-05-16 16:37:17] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2021-05-16 16:37:18] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 19 ms to minimize.
[2021-05-16 16:37:18] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2021-05-16 16:37:18] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 16 ms to minimize.
[2021-05-16 16:37:18] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2021-05-16 16:37:18] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2021-05-16 16:37:18] [INFO ] Deduced a trap composed of 44 places in 20 ms of which 0 ms to minimize.
[2021-05-16 16:37:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1043 ms
[2021-05-16 16:37:18] [INFO ] Computed and/alt/rep : 420/798/410 causal constraints (skipped 640 transitions) in 42 ms.
[2021-05-16 16:37:21] [INFO ] Added : 276 causal constraints over 56 iterations in 3022 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 319800 steps, including 1002 resets, run finished after 1001 ms. (steps per millisecond=319 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 292500 steps, including 1002 resets, run finished after 866 ms. (steps per millisecond=337 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 58 out of 538 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 538/538 places, 1072/1072 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 538 transition count 1052
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 518 transition count 1052
Applied a total of 40 rules in 22 ms. Remains 518 /538 variables (removed 20) and now considering 1052/1072 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 518/538 places, 1052/1072 transitions.
[2021-05-16 16:37:23] [INFO ] Flatten gal took : 80 ms
[2021-05-16 16:37:23] [INFO ] Flatten gal took : 56 ms
[2021-05-16 16:37:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13735421279181219147.gal : 5 ms
[2021-05-16 16:37:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18003232751749670674.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13735421279181219147.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18003232751749670674.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13735421279181219147.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18003232751749670674.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18003232751749670674.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :69 after 185
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :185 after 278
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :278 after 305
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :305 after 357
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :357 after 599
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :599 after 1350
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1350 after 3232
Detected timeout of ITS tools.
[2021-05-16 16:37:39] [INFO ] Flatten gal took : 77 ms
[2021-05-16 16:37:39] [INFO ] Applying decomposition
[2021-05-16 16:37:39] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3567602466469845831.txt, -o, /tmp/graph3567602466469845831.bin, -w, /tmp/graph3567602466469845831.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3567602466469845831.bin, -l, -1, -v, -w, /tmp/graph3567602466469845831.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:37:39] [INFO ] Decomposing Gal with order
[2021-05-16 16:37:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:37:39] [INFO ] Removed a total of 1625 redundant transitions.
[2021-05-16 16:37:39] [INFO ] Flatten gal took : 101 ms
[2021-05-16 16:37:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 438 labels/synchronizations in 30 ms.
[2021-05-16 16:37:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14995284375184670965.gal : 6 ms
[2021-05-16 16:37:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8939339078876574547.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14995284375184670965.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8939339078876574547.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14995284375184670965.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8939339078876574547.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8939339078876574547.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13 after 40
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :40 after 82
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :82 after 162
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :162 after 189
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :189 after 409
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :409 after 729
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :729 after 1248
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1248 after 3336
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3336 after 8637
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :8637 after 17650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15165084230102961281
[2021-05-16 16:37:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15165084230102961281
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15165084230102961281]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15165084230102961281] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15165084230102961281] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 299 resets, run finished after 3480 ms. (steps per millisecond=287 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1601 ms. (steps per millisecond=624 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 274 resets, run finished after 1929 ms. (steps per millisecond=518 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3648959 steps, run timeout after 30087 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 3648959 steps, saw 1971070 distinct states, run finished after 30092 ms. (steps per millisecond=121 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-16 16:38:32] [INFO ] Flow matrix only has 1032 transitions (discarded 20 similar events)
// Phase 1: matrix 1032 rows 518 cols
[2021-05-16 16:38:32] [INFO ] Computed 52 place invariants in 14 ms
[2021-05-16 16:38:32] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 16:38:32] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-16 16:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:33] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2021-05-16 16:38:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:38:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 16:38:33] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 16 ms returned sat
[2021-05-16 16:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:33] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2021-05-16 16:38:33] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 16:38:33] [INFO ] [Nat]Added 130 Read/Feed constraints in 51 ms returned sat
[2021-05-16 16:38:33] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 0 ms to minimize.
[2021-05-16 16:38:33] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 0 ms to minimize.
[2021-05-16 16:38:34] [INFO ] Deduced a trap composed of 222 places in 158 ms of which 0 ms to minimize.
[2021-05-16 16:38:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 598 ms
[2021-05-16 16:38:34] [INFO ] Computed and/alt/rep : 400/778/390 causal constraints (skipped 640 transitions) in 77 ms.
[2021-05-16 16:38:37] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2021-05-16 16:38:37] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2021-05-16 16:38:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2021-05-16 16:38:37] [INFO ] Added : 284 causal constraints over 57 iterations in 3199 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-16 16:38:37] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-16 16:38:37] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-16 16:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:37] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2021-05-16 16:38:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:38:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 16:38:37] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-16 16:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:38] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2021-05-16 16:38:38] [INFO ] [Nat]Added 130 Read/Feed constraints in 154 ms returned sat
[2021-05-16 16:38:38] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2021-05-16 16:38:38] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2021-05-16 16:38:38] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 7 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2021-05-16 16:38:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1236 ms
[2021-05-16 16:38:39] [INFO ] Computed and/alt/rep : 400/778/390 causal constraints (skipped 640 transitions) in 51 ms.
[2021-05-16 16:38:42] [INFO ] Deduced a trap composed of 173 places in 130 ms of which 0 ms to minimize.
[2021-05-16 16:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2021-05-16 16:38:42] [INFO ] Added : 259 causal constraints over 52 iterations in 2801 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
Incomplete Parikh walk after 308000 steps, including 1002 resets, run finished after 1098 ms. (steps per millisecond=280 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 547900 steps, including 1002 resets, run finished after 1959 ms. (steps per millisecond=279 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 58 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 1052/1052 transitions.
Applied a total of 0 rules in 18 ms. Remains 518 /518 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 518/518 places, 1052/1052 transitions.
Starting structural reductions, iteration 0 : 518/518 places, 1052/1052 transitions.
Applied a total of 0 rules in 17 ms. Remains 518 /518 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
[2021-05-16 16:38:45] [INFO ] Flow matrix only has 1032 transitions (discarded 20 similar events)
// Phase 1: matrix 1032 rows 518 cols
[2021-05-16 16:38:45] [INFO ] Computed 52 place invariants in 11 ms
[2021-05-16 16:38:46] [INFO ] Implicit Places using invariants in 455 ms returned []
[2021-05-16 16:38:46] [INFO ] Flow matrix only has 1032 transitions (discarded 20 similar events)
// Phase 1: matrix 1032 rows 518 cols
[2021-05-16 16:38:46] [INFO ] Computed 52 place invariants in 16 ms
[2021-05-16 16:38:46] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 16:38:51] [INFO ] Implicit Places using invariants and state equation in 4945 ms returned []
Implicit Place search using SMT with State Equation took 5402 ms to find 0 implicit places.
[2021-05-16 16:38:51] [INFO ] Redundant transitions in 47 ms returned []
[2021-05-16 16:38:51] [INFO ] Flow matrix only has 1032 transitions (discarded 20 similar events)
// Phase 1: matrix 1032 rows 518 cols
[2021-05-16 16:38:51] [INFO ] Computed 52 place invariants in 15 ms
[2021-05-16 16:38:51] [INFO ] Dead Transitions using invariants and state equation in 437 ms returned []
Finished structural reductions, in 1 iterations. Remains : 518/518 places, 1052/1052 transitions.
Incomplete random walk after 100000 steps, including 29 resets, run finished after 384 ms. (steps per millisecond=260 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-16 16:38:52] [INFO ] Flow matrix only has 1032 transitions (discarded 20 similar events)
// Phase 1: matrix 1032 rows 518 cols
[2021-05-16 16:38:52] [INFO ] Computed 52 place invariants in 17 ms
[2021-05-16 16:38:52] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 16:38:52] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-16 16:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:52] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2021-05-16 16:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:38:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 16:38:52] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-16 16:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:53] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-16 16:38:53] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 16:38:53] [INFO ] [Nat]Added 130 Read/Feed constraints in 67 ms returned sat
[2021-05-16 16:38:53] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 0 ms to minimize.
[2021-05-16 16:38:53] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 0 ms to minimize.
[2021-05-16 16:38:53] [INFO ] Deduced a trap composed of 222 places in 212 ms of which 0 ms to minimize.
[2021-05-16 16:38:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 886 ms
[2021-05-16 16:38:54] [INFO ] Computed and/alt/rep : 400/778/390 causal constraints (skipped 640 transitions) in 110 ms.
[2021-05-16 16:38:57] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2021-05-16 16:38:57] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2021-05-16 16:38:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2021-05-16 16:38:57] [INFO ] Added : 284 causal constraints over 57 iterations in 3861 ms. Result :sat
[2021-05-16 16:38:57] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2021-05-16 16:38:57] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 27 ms returned sat
[2021-05-16 16:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:58] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2021-05-16 16:38:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:38:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 16:38:58] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 27 ms returned sat
[2021-05-16 16:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:38:59] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2021-05-16 16:38:59] [INFO ] [Nat]Added 130 Read/Feed constraints in 142 ms returned sat
[2021-05-16 16:38:59] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 0 ms to minimize.
[2021-05-16 16:38:59] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-16 16:38:59] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2021-05-16 16:38:59] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2021-05-16 16:39:00] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2021-05-16 16:39:00] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2021-05-16 16:39:00] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 0 ms to minimize.
[2021-05-16 16:39:00] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2021-05-16 16:39:00] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2021-05-16 16:39:00] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2021-05-16 16:39:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1356 ms
[2021-05-16 16:39:00] [INFO ] Computed and/alt/rep : 400/778/390 causal constraints (skipped 640 transitions) in 57 ms.
[2021-05-16 16:39:03] [INFO ] Deduced a trap composed of 173 places in 130 ms of which 0 ms to minimize.
[2021-05-16 16:39:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2021-05-16 16:39:03] [INFO ] Added : 259 causal constraints over 52 iterations in 2842 ms. Result :sat
[2021-05-16 16:39:03] [INFO ] Flatten gal took : 39 ms
[2021-05-16 16:39:03] [INFO ] Flatten gal took : 38 ms
[2021-05-16 16:39:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11540937301726505551.gal : 4 ms
[2021-05-16 16:39:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8105902036734859241.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11540937301726505551.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8105902036734859241.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11540937301726505551.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8105902036734859241.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8105902036734859241.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :69 after 185
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :185 after 278
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :278 after 305
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :305 after 357
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :357 after 599
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :599 after 1350
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1350 after 3232
Detected timeout of ITS tools.
[2021-05-16 16:39:18] [INFO ] Flatten gal took : 37 ms
[2021-05-16 16:39:18] [INFO ] Applying decomposition
[2021-05-16 16:39:18] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15918922260945539261.txt, -o, /tmp/graph15918922260945539261.bin, -w, /tmp/graph15918922260945539261.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15918922260945539261.bin, -l, -1, -v, -w, /tmp/graph15918922260945539261.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:39:18] [INFO ] Decomposing Gal with order
[2021-05-16 16:39:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:39:18] [INFO ] Removed a total of 1456 redundant transitions.
[2021-05-16 16:39:19] [INFO ] Flatten gal took : 108 ms
[2021-05-16 16:39:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 666 labels/synchronizations in 30 ms.
[2021-05-16 16:39:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4792634402871892081.gal : 23 ms
[2021-05-16 16:39:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7928431251411284354.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4792634402871892081.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7928431251411284354.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4792634402871892081.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7928431251411284354.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7928431251411284354.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :13 after 82
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :82 after 177
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :177 after 222
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :222 after 939
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :939 after 1315
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1315 after 2080
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2080 after 3883
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3883 after 13498
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :13498 after 32995
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3249638516802478672
[2021-05-16 16:39:34] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3249638516802478672
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3249638516802478672]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3249638516802478672] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3249638516802478672] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 518 transition count 1032
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 508 transition count 1072
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 80 place count 508 transition count 1032
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 508 transition count 1022
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 498 transition count 1022
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 498 transition count 1012
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 488 transition count 1012
Applied a total of 120 rules in 143 ms. Remains 488 /518 variables (removed 30) and now considering 1012/1052 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1012 rows 488 cols
[2021-05-16 16:39:35] [INFO ] Computed 52 place invariants in 11 ms
[2021-05-16 16:39:35] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2021-05-16 16:39:35] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 27 ms returned sat
[2021-05-16 16:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:39:36] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2021-05-16 16:39:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:39:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-16 16:39:36] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-16 16:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:39:37] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2021-05-16 16:39:37] [INFO ] Computed and/alt/rep : 439/889/439 causal constraints (skipped 570 transitions) in 48 ms.
[2021-05-16 16:39:39] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2021-05-16 16:39:39] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2021-05-16 16:39:39] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2021-05-16 16:39:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 430 ms
[2021-05-16 16:39:39] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2021-05-16 16:39:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2021-05-16 16:39:40] [INFO ] Added : 208 causal constraints over 43 iterations in 2885 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-16 16:39:40] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-16 16:39:40] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-16 16:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:39:40] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2021-05-16 16:39:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:39:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-16 16:39:40] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-16 16:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:39:40] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2021-05-16 16:39:41] [INFO ] Deduced a trap composed of 40 places in 24 ms of which 0 ms to minimize.
[2021-05-16 16:39:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-16 16:39:41] [INFO ] Computed and/alt/rep : 439/889/439 causal constraints (skipped 570 transitions) in 39 ms.
[2021-05-16 16:39:42] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2021-05-16 16:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2021-05-16 16:39:42] [INFO ] Added : 181 causal constraints over 37 iterations in 1902 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-16 16:39:43] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18438136049308289466
[2021-05-16 16:39:43] [INFO ] Computing symmetric may disable matrix : 1052 transitions.
[2021-05-16 16:39:43] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 16:39:43] [INFO ] Computing symmetric may enable matrix : 1052 transitions.
[2021-05-16 16:39:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 16:39:43] [INFO ] Applying decomposition
[2021-05-16 16:39:43] [INFO ] Flatten gal took : 81 ms
[2021-05-16 16:39:43] [INFO ] Flatten gal took : 42 ms
[2021-05-16 16:39:43] [INFO ] Computing Do-Not-Accords matrix : 1052 transitions.
[2021-05-16 16:39:43] [INFO ] Input system was already deterministic with 1052 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3126743934315201242.txt, -o, /tmp/graph3126743934315201242.bin, -w, /tmp/graph3126743934315201242.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3126743934315201242.bin, -l, -1, -v, -w, /tmp/graph3126743934315201242.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:39:43] [INFO ] Decomposing Gal with order
[2021-05-16 16:39:43] [INFO ] Computation of Completed DNA matrix. took 82 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 16:39:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:39:43] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18438136049308289466
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18438136049308289466]
[2021-05-16 16:39:43] [INFO ] Removed a total of 1234 redundant transitions.
[2021-05-16 16:39:43] [INFO ] Flatten gal took : 253 ms
[2021-05-16 16:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 593 labels/synchronizations in 42 ms.
[2021-05-16 16:39:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15782302332461478950.gal : 5 ms
[2021-05-16 16:39:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2441920868588871690.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15782302332461478950.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2441920868588871690.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15782302332461478950.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2441920868588871690.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2441920868588871690.prop.
[2021-05-16 16:39:44] [INFO ] Ran tautology test, simplified 0 / 2 in 980 ms.
[2021-05-16 16:39:44] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(UNSAT) depth K=0 took 18 ms
[2021-05-16 16:39:44] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2021-05-16 16:39:44] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(UNSAT) depth K=1 took 4 ms
[2021-05-16 16:39:44] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=1 took 3 ms
[2021-05-16 16:39:44] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(UNSAT) depth K=2 took 97 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 10
[2021-05-16 16:39:44] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=2 took 159 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :13 after 82
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :82 after 225
[2021-05-16 16:39:44] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(UNSAT) depth K=3 took 415 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1032 out of 1052 initially.
// Phase 1: matrix 1032 rows 518 cols
[2021-05-16 16:39:44] [INFO ] Computed 52 place invariants in 11 ms
inv : -Abort_Check_Sources_E_0 - Abort_Check_Sources_E_1 - Abort_Check_Sources_E_2 - Abort_Check_Sources_E_3 - Abort_Check_Sources_E_4 - Abort_Check_Sources_E_5 - Abort_Check_Sources_E_6 - Abort_Check_Sources_E_7 - Abort_Check_Sources_E_8 - Abort_Check_Sources_E_9 - Check_Sources_B_0 - Check_Sources_B_1 - Check_Sources_B_2 - Check_Sources_B_3 - Check_Sources_B_4 - Check_Sources_B_5 - Check_Sources_B_6 - Check_Sources_B_7 - Check_Sources_B_8 - Check_Sources_B_9 - Check_Sources_E_0 - Check_Sources_E_1 - Check_Sources_E_2 - Check_Sources_E_3 - Check_Sources_E_4 - Check_Sources_E_5 - Check_Sources_E_6 - Check_Sources_E_7 - Check_Sources_E_8 - Check_Sources_E_9 - Idle_0 - Idle_1 - Idle_2 - Idle_3 - Idle_4 - Idle_5 - Idle_6 - Idle_7 - Idle_8 - Idle_9 - RunB_0 - RunB_1 - RunB_2 - RunB_3 - RunB_4 - RunB_5 - RunB_6 - RunB_7 - RunB_8 - RunB_9 + ORB_Lock_0 - P_2579_0 - P_2579_1 - P_2579_2 - P_2579_3 - P_2579_4 - P_2579_5 - P_2579_6 - P_2579_7 - P_2579_8 - P_2579_9 - P_2579_10 - P_2579_11 - P_2579_12 - P_2579_13 - P_2579_14 - P_2579_15 - P_2579_16 - P_2579_17 - P_2579_18 - P_2579_19 = -9
inv : NotifyEventJobQueuedB_2 + NotifyEventJobQueuedB_7 + NotifyEventJobQueuedB_12 + NotifyEventJobQueuedB_17 + NotifyEventJobQueuedB_22 + NotifyEventJobQueuedB_27 + NotifyEventJobQueuedB_32 + NotifyEventJobQueuedB_37 + NotifyEventJobQueuedB_42 + NotifyEventJobQueuedB_47 + QueueJobB_2 + QueueJobB_7 + QueueJobB_12 + QueueJobB_17 + QueueJobB_22 + QueueJobB_27 + QueueJobB_32 + QueueJobB_37 + QueueJobB_42 + QueueJobB_47 + P_1725_2 + P_1724_2 + FetchJobE_2 + FetchJobE_7 + FetchJobE_12 + FetchJobE_17 + FetchJobE_22 + FetchJobE_27 + FetchJobE_32 + FetchJobE_37 + FetchJobE_42 + FetchJobE_47 + P_1712_2 - CreatedJobs_4 - CreatedJobs_5 = 0
inv : NotifyEventJobQueuedB_1 + NotifyEventJobQueuedB_2 + NotifyEventJobQueuedB_3 - NotifyEventJobQueuedB_4 + NotifyEventJobQueuedB_6 + NotifyEventJobQueuedB_7 + NotifyEventJobQueuedB_8 - NotifyEventJobQueuedB_9 + NotifyEventJobQueuedB_11 + NotifyEventJobQueuedB_12 + NotifyEventJobQueuedB_13 - NotifyEventJobQueuedB_14 + NotifyEventJobQueuedB_16 + NotifyEventJobQueuedB_17 + NotifyEventJobQueuedB_18 - NotifyEventJobQueuedB_19 + NotifyEventJobQueuedB_21 + NotifyEventJobQueuedB_22 + NotifyEventJobQueuedB_23 - NotifyEventJobQueuedB_24 + NotifyEventJobQueuedB_26 + NotifyEventJobQueuedB_27 + NotifyEventJobQueuedB_28 - NotifyEventJobQueuedB_29 + NotifyEventJobQueuedB_31 + NotifyEventJobQueuedB_32 + NotifyEventJobQueuedB_33 - NotifyEventJobQueuedB_34 + NotifyEventJobQueuedB_36 + NotifyEventJobQueuedB_37 + NotifyEventJobQueuedB_38 - NotifyEventJobQueuedB_39 + NotifyEventJobQueuedB_41 + NotifyEventJobQueuedB_42 + NotifyEventJobQueuedB_43 - NotifyEventJobQueuedB_44 + NotifyEventJobQueuedB_46 + NotifyEventJobQueuedB_47 + NotifyEventJobQueuedB_48 - NotifyEventJobQueuedB_49 + QueueJobB_1 + QueueJobB_2 + QueueJobB_3 - QueueJobB_4 + QueueJobB_6 + QueueJobB_7 + QueueJobB_8 - QueueJobB_9 + QueueJobB_11 + QueueJobB_12 + QueueJobB_13 - QueueJobB_14 + QueueJobB_16 + QueueJobB_17 + QueueJobB_18 - QueueJobB_19 + QueueJobB_21 + QueueJobB_22 + QueueJobB_23 - QueueJobB_24 + QueueJobB_26 + QueueJobB_27 + QueueJobB_28 - QueueJobB_29 + QueueJobB_31 + QueueJobB_32 + QueueJobB_33 - QueueJobB_34 + QueueJobB_36 + QueueJobB_37 + QueueJobB_38 - QueueJobB_39 + QueueJobB_41 + QueueJobB_42 + QueueJobB_43 - QueueJobB_44 + QueueJobB_46 + QueueJobB_47 + QueueJobB_48 - QueueJobB_49 + P_1727_0 - P_1725_0 - 2*P_1725_4 + P_1724_0 + 2*P_1724_1 + 2*P_1724_2 + 2*P_1724_3 + FetchJobE_1 + FetchJobE_2 + FetchJobE_3 - FetchJobE_4 + FetchJobE_6 + FetchJobE_7 + FetchJobE_8 - FetchJobE_9 + FetchJobE_11 + FetchJobE_12 + FetchJobE_13 - FetchJobE_14 + FetchJobE_16 + FetchJobE_17 + FetchJobE_18 - FetchJobE_19 + FetchJobE_21 + FetchJobE_22 + FetchJobE_23 - FetchJobE_24 + FetchJobE_26 + FetchJobE_27 + FetchJobE_28 - FetchJobE_29 + FetchJobE_31 + FetchJobE_32 + FetchJobE_33 - FetchJobE_34 + FetchJobE_36 + FetchJobE_37 + FetchJobE_38 - FetchJobE_39 + FetchJobE_41 + FetchJobE_42 + FetchJobE_43 - FetchJobE_44 + FetchJobE_46 + FetchJobE_47 + FetchJobE_48 - FetchJobE_49 + MarkerRead_0 + P_1716_0 + P_1712_1 + P_1712_2 + P_1712_3 - P_1712_4 - CreatedJobs_2 - CreatedJobs_3 - CreatedJobs_4 - CreatedJobs_5 - CreatedJobs_6 - CreatedJobs_7 + CreatedJobs_8 + CreatedJobs_9 = 1
inv : -ScheduleTaskE_Check_0 - ScheduleTaskE_Check_1 - ScheduleTaskE_Check_2 - ScheduleTaskE_Check_3 - ScheduleTaskE_Check_4 - ScheduleTaskE_Check_5 - ScheduleTaskE_Check_6 - ScheduleTaskE_Check_7 - ScheduleTaskE_Check_8 - ScheduleTaskE_Check_9 + CanInjectEvent_0 - NotifyEventEndOfCheckSourcesB_0 - NotifyEventEndOfCheckSourcesB_1 - NotifyEventEndOfCheckSourcesB_2 - NotifyEventEndOfCheckSourcesB_3 - NotifyEventEndOfCheckSourcesB_4 - NotifyEventEndOfCheckSourcesB_5 - NotifyEventEndOfCheckSourcesB_6 - NotifyEventEndOfCheckSourcesB_7 - NotifyEventEndOfCheckSourcesB_8 - NotifyEventEndOfCheckSourcesB_9 - Check_Sources_B_0 - Check_Sources_B_1 - Check_Sources_B_2 - Check_Sources_B_3 - Check_Sources_B_4 - Check_Sources_B_5 - Check_Sources_B_6 - Check_Sources_B_7 - Check_Sources_B_8 - Check_Sources_B_9 - Try_Check_Sources_B_0 - Try_Check_Sources_B_1 - Try_Check_Sources_B_2 - Try_Check_Sources_B_3 - Try_Check_Sources_B_4 - Try_Check_Sources_B_5 - Try_Check_Sources_B_6 - Try_Check_Sources_B_7 - Try_Check_Sources_B_8 - Try_Check_Sources_B_9 + IsMonitoring_0 = 1
inv : AwakeTasks_9 + IdleTasks_9 - Idle_9 = 0
inv : -10*ScheduleTaskE_Check_0 - 10*ScheduleTaskE_Check_1 - 10*ScheduleTaskE_Check_2 - 10*ScheduleTaskE_Check_3 - 10*ScheduleTaskE_Check_4 - 10*ScheduleTaskE_Check_5 - 10*ScheduleTaskE_Check_6 - 10*ScheduleTaskE_Check_7 - 10*ScheduleTaskE_Check_8 - 10*ScheduleTaskE_Check_9 + cSources_0 - 10*ProcessingEvt_0 - 10*ProcessingEvt_1 - 10*ProcessingEvt_2 - 10*ProcessingEvt_3 - 10*ProcessingEvt_4 - 10*ProcessingEvt_5 - 10*ProcessingEvt_6 - 10*ProcessingEvt_7 - 10*ProcessingEvt_8 - 10*ProcessingEvt_9 - 10*NotifyEventEndOfCheckSourcesB_0 - 10*NotifyEventEndOfCheckSourcesB_1 - 10*NotifyEventEndOfCheckSourcesB_2 - 10*NotifyEventEndOfCheckSourcesB_3 - 10*NotifyEventEndOfCheckSourcesB_4 - 10*NotifyEventEndOfCheckSourcesB_5 - 10*NotifyEventEndOfCheckSourcesB_6 - 10*NotifyEventEndOfCheckSourcesB_7 - 10*NotifyEventEndOfCheckSourcesB_8 - 10*NotifyEventEndOfCheckSourcesB_9 - 10*Check_Sources_B_0 - 10*Check_Sources_B_1 - 10*Check_Sources_B_2 - 10*Check_Sources_B_3 - 10*Check_Sources_B_4 - 10*Check_Sources_B_5 - 10*Check_Sources_B_6 - 10*Check_Sources_B_7 - 10*Check_Sources_B_8 - 10*Check_Sources_B_9 - 10*Check_Sources_E_0 - 10*Check_Sources_E_1 - 10*Check_Sources_E_2 - 10*Check_Sources_E_3 - 10*Check_Sources_E_4 - 10*Check_Sources_E_5 - 10*Check_Sources_E_6 - 10*Check_Sources_E_7 - 10*Check_Sources_E_8 - 10*Check_Sources_E_9 + ModifiedSrc_0 + ModifiedSrc_1 - 10*Try_Check_Sources_B_0 - 10*Try_Check_Sources_B_1 - 10*Try_Check_Sources_B_2 - 10*Try_Check_Sources_B_3 - 10*Try_Check_Sources_B_4 - 10*Try_Check_Sources_B_5 - 10*Try_Check_Sources_B_6 - 10*Try_Check_Sources_B_7 - 10*Try_Check_Sources_B_8 - 10*Try_Check_Sources_B_9 + 10*IsMonitoring_0 = 10
inv : P_2321_3 - TryAllocateOneTaskE_3 - TryAllocateOneTaskB_3 + P_2318_3 = 0
inv : P_2321_1 + P_2321_2 + P_2321_5 + P_2321_6 + P_2321_9 + TryAllocateOneTaskE_0 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskB_0 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 - P_2318_0 - P_2318_3 - P_2318_4 - P_2318_7 - P_2318_8 + EnablePollingE_0 + EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingB_0 + EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + EnablePollingB_9 + FetchJobE_0 + FetchJobE_1 + FetchJobE_2 + FetchJobE_3 + FetchJobE_4 + FetchJobE_5 + FetchJobE_6 + FetchJobE_7 + FetchJobE_8 + FetchJobE_9 + FetchJobE_10 + FetchJobE_11 + FetchJobE_12 + FetchJobE_13 + FetchJobE_14 + FetchJobE_15 + FetchJobE_16 + FetchJobE_17 + FetchJobE_18 + FetchJobE_19 + FetchJobE_20 + FetchJobE_21 + FetchJobE_22 + FetchJobE_23 + FetchJobE_24 + FetchJobE_25 + FetchJobE_26 + FetchJobE_27 + FetchJobE_28 + FetchJobE_29 + FetchJobE_30 + FetchJobE_31 + FetchJobE_32 + FetchJobE_33 + FetchJobE_34 + FetchJobE_35 + FetchJobE_36 + FetchJobE_37 + FetchJobE_38 + FetchJobE_39 + FetchJobE_40 + FetchJobE_41 + FetchJobE_42 + FetchJobE_43 + FetchJobE_44 + FetchJobE_45 + FetchJobE_46 + FetchJobE_47 + FetchJobE_48 + FetchJobE_49 + FetchJobB_0 + FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8 + FetchJobB_9 + ScheduleTaskB_0 + ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + Abort_Check_Sources_E_0 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9 + Abort_Check_Sources_B_0 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 + Abort_Check_Sources_B_9 + Insert_Source_B_0 + Insert_Source_B_1 + Insert_Source_B_2 + Insert_Source_B_3 + Insert_Source_B_4 + Insert_Source_B_5 + Insert_Source_B_6 + Insert_Source_B_7 + Insert_Source_B_8 + Insert_Source_B_9 + Insert_Source_B_10 + Insert_Source_B_11 + Insert_Source_B_12 + Insert_Source_B_13 + Insert_Source_B_14 + Insert_Source_B_15 + Insert_Source_B_16 + Insert_Source_B_17 + Insert_Source_B_18 + Insert_Source_B_19 + Idle_0 + Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + NotifyEventJobCompletedE_0 + NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + NotifyEventJobCompletedE_9 + RunB_0 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9 + Perform_Work_E_0 + Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 + Perform_Work_E_9 + IsMonitoring_0 + P_1617_0 + P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_2579_0 + P_2579_1 + P_2579_2 + P_2579_3 + P_2579_4 + P_2579_5 + P_2579_6 + P_2579_7 + P_2579_8 + P_2579_9 + P_2579_10 + P_2579_11 + P_2579_12 + P_2579_13 + P_2579_14 + P_2579_15 + P_2579_16 + P_2579_17 + P_2579_18 + P_2579_19 + ScheduleTaskE_Idle_0 + ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_9 = 10
inv : NotifyEventJobQueuedB_3 + NotifyEventJobQueuedB_8 + NotifyEventJobQueuedB_13 + NotifyEventJobQueuedB_18 + NotifyEventJobQueuedB_23 + NotifyEventJobQueuedB_28 + NotifyEventJobQueuedB_33 + NotifyEventJobQueuedB_38 + NotifyEventJobQueuedB_43 + NotifyEventJobQueuedB_48 + QueueJobB_3 + QueueJobB_8 + QueueJobB_13 + QueueJobB_18 + QueueJobB_23 + QueueJobB_28 + QueueJobB_33 + QueueJobB_38 + QueueJobB_43 + QueueJobB_48 + P_1725_3 + P_1724_3 + FetchJobE_3 + FetchJobE_8 + FetchJobE_13 + FetchJobE_18 + FetchJobE_23 + FetchJobE_28 + FetchJobE_33 + FetchJobE_38 + FetchJobE_43 + FetchJobE_48 + P_1712_3 - CreatedJobs_6 - CreatedJobs_7 = 0
inv : MarkerRead_0 + P_1717_0 + P_1716_0 = 1
inv : PlaceSources_1 + Insert_Source_B_1 + Insert_Source_B_3 + Insert_Source_B_5 + Insert_Source_B_7 + Insert_Source_B_9 + Insert_Source_B_11 + Insert_Source_B_13 + Insert_Source_B_15 + Insert_Source_B_17 + Insert_Source_B_19 - AvailableJobId_0 + P_1119_1 + P_1119_3 + P_1119_5 + P_1119_7 + P_1119_9 + P_1119_11 + P_1119_13 + P_1119_15 + P_1119_17 + P_1119_19 - CreatedJobs_0 + CreatedJobs_3 + CreatedJobs_5 + CreatedJobs_7 + CreatedJobs_9 + ModifiedSrc_1 + AbourtToModifySrc_1 + P_2579_1 + P_2579_3 + P_2579_5 + P_2579_7 + P_2579_9 + P_2579_11 + P_2579_13 + P_2579_15 + P_2579_17 + P_2579_19 = 0
inv : NotifyEventJobQueuedB_4 + NotifyEventJobQueuedB_9 + NotifyEventJobQueuedB_14 + NotifyEventJobQueuedB_19 + NotifyEventJobQueuedB_24 + NotifyEventJobQueuedB_29 + NotifyEventJobQueuedB_34 + NotifyEventJobQueuedB_39 + NotifyEventJobQueuedB_44 + NotifyEventJobQueuedB_49 + QueueJobB_4 + QueueJobB_9 + QueueJobB_14 + QueueJobB_19 + QueueJobB_24 + QueueJobB_29 + QueueJobB_34 + QueueJobB_39 + QueueJobB_44 + QueueJobB_49 + P_1725_4 + P_1724_4 + FetchJobE_4 + FetchJobE_9 + FetchJobE_14 + FetchJobE_19 + FetchJobE_24 + FetchJobE_29 + FetchJobE_34 + FetchJobE_39 + FetchJobE_44 + FetchJobE_49 + P_1712_4 - CreatedJobs_8 - CreatedJobs_9 = 0
inv : P_2321_7 - TryAllocateOneTaskE_7 - TryAllocateOneTaskB_7 + P_2318_7 = 0
inv : AvailableJobId_4 + CreatedJobs_8 + CreatedJobs_9 = 1
inv : NotifyEventJobQueuedB_0 + NotifyEventJobQueuedB_1 + NotifyEventJobQueuedB_2 + NotifyEventJobQueuedB_3 + NotifyEventJobQueuedB_4 + NotifyEventJobQueuedB_5 + NotifyEventJobQueuedB_6 + NotifyEventJobQueuedB_7 + NotifyEventJobQueuedB_8 + NotifyEventJobQueuedB_9 + NotifyEventJobQueuedB_10 + NotifyEventJobQueuedB_11 + NotifyEventJobQueuedB_12 + NotifyEventJobQueuedB_13 + NotifyEventJobQueuedB_14 + NotifyEventJobQueuedB_15 + NotifyEventJobQueuedB_16 + NotifyEventJobQueuedB_17 + NotifyEventJobQueuedB_18 + NotifyEventJobQueuedB_19 + NotifyEventJobQueuedB_20 + NotifyEventJobQueuedB_21 + NotifyEventJobQueuedB_22 + NotifyEventJobQueuedB_23 + NotifyEventJobQueuedB_24 + NotifyEventJobQueuedB_25 + NotifyEventJobQueuedB_26 + NotifyEventJobQueuedB_27 + NotifyEventJobQueuedB_28 + NotifyEventJobQueuedB_29 + NotifyEventJobQueuedB_30 + NotifyEventJobQueuedB_31 + NotifyEventJobQueuedB_32 + NotifyEventJobQueuedB_33 + NotifyEventJobQueuedB_34 + NotifyEventJobQueuedB_35 + NotifyEventJobQueuedB_36 + NotifyEventJobQueuedB_37 + NotifyEventJobQueuedB_38 + NotifyEventJobQueuedB_39 + NotifyEventJobQueuedB_40 + NotifyEventJobQueuedB_41 + NotifyEventJobQueuedB_42 + NotifyEventJobQueuedB_43 + NotifyEventJobQueuedB_44 + NotifyEventJobQueuedB_45 + NotifyEventJobQueuedB_46 + NotifyEventJobQueuedB_47 + NotifyEventJobQueuedB_48 + NotifyEventJobQueuedB_49 + QueueJobB_0 + QueueJobB_1 + QueueJobB_2 + QueueJobB_3 + QueueJobB_4 + QueueJobB_5 + QueueJobB_6 + QueueJobB_7 + QueueJobB_8 + QueueJobB_9 + QueueJobB_10 + QueueJobB_11 + QueueJobB_12 + QueueJobB_13 + QueueJobB_14 + QueueJobB_15 + QueueJobB_16 + QueueJobB_17 + QueueJobB_18 + QueueJobB_19 + QueueJobB_20 + QueueJobB_21 + QueueJobB_22 + QueueJobB_23 + QueueJobB_24 + QueueJobB_25 + QueueJobB_26 + QueueJobB_27 + QueueJobB_28 + QueueJobB_29 + QueueJobB_30 + QueueJobB_31 + QueueJobB_32 + QueueJobB_33 + QueueJobB_34 + QueueJobB_35 + QueueJobB_36 + QueueJobB_37 + QueueJobB_38 + QueueJobB_39 + QueueJobB_40 + QueueJobB_41 + QueueJobB_42 + QueueJobB_43 + QueueJobB_44 + QueueJobB_45 + QueueJobB_46 + QueueJobB_47 + QueueJobB_48 + QueueJobB_49 + P_2318_0 + P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 + 2*ScheduleTaskE_Check_0 + 2*ScheduleTaskE_Check_1 + 2*ScheduleTaskE_Check_2 + 2*ScheduleTaskE_Check_3 + 2*ScheduleTaskE_Check_4 + 2*ScheduleTaskE_Check_5 + 2*ScheduleTaskE_Check_6 + 2*ScheduleTaskE_Check_7 + 2*ScheduleTaskE_Check_8 + 2*ScheduleTaskE_Check_9 + P_1093_0 + P_1119_0 + P_1119_1 + P_1119_2 + P_1119_3 + P_1119_4 + P_1119_5 + P_1119_6 + P_1119_7 + P_1119_8 + P_1119_9 + P_1119_10 + P_1119_11 + P_1119_12 + P_1119_13 + P_1119_14 + P_1119_15 + P_1119_16 + P_1119_17 + P_1119_18 + P_1119_19 + 2*ProcessingEvt_0 + 2*ProcessingEvt_1 + 2*ProcessingEvt_2 + 2*ProcessingEvt_3 + 2*ProcessingEvt_4 + 2*ProcessingEvt_5 + 2*ProcessingEvt_6 + 2*ProcessingEvt_7 + 2*ProcessingEvt_8 + 2*ProcessingEvt_9 + P_1158_0 + P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + 2*NotifyEventEndOfCheckSourcesB_0 + 2*NotifyEventEndOfCheckSourcesB_1 + 2*NotifyEventEndOfCheckSourcesB_2 + 2*NotifyEventEndOfCheckSourcesB_3 + 2*NotifyEventEndOfCheckSourcesB_4 + 2*NotifyEventEndOfCheckSourcesB_5 + 2*NotifyEventEndOfCheckSourcesB_6 + 2*NotifyEventEndOfCheckSourcesB_7 + 2*NotifyEventEndOfCheckSourcesB_8 + 2*NotifyEventEndOfCheckSourcesB_9 + 2*Check_Sources_B_0 + 2*Check_Sources_B_1 + 2*Check_Sources_B_2 + 2*Check_Sources_B_3 + 2*Check_Sources_B_4 + 2*Check_Sources_B_5 + 2*Check_Sources_B_6 + 2*Check_Sources_B_7 + 2*Check_Sources_B_8 + 2*Check_Sources_B_9 + 2*Check_Sources_E_0 + 2*Check_Sources_E_1 + 2*Check_Sources_E_2 + 2*Check_Sources_E_3 + 2*Check_Sources_E_4 + 2*Check_Sources_E_5 + 2*Check_Sources_E_6 + 2*Check_Sources_E_7 + 2*Check_Sources_E_8 + 2*Check_Sources_E_9 + 2*Try_Check_Sources_B_0 + 2*Try_Check_Sources_B_1 + 2*Try_Check_Sources_B_2 + 2*Try_Check_Sources_B_3 + 2*Try_Check_Sources_B_4 + 2*Try_Check_Sources_B_5 + 2*Try_Check_Sources_B_6 + 2*Try_Check_Sources_B_7 + 2*Try_Check_Sources_B_8 + 2*Try_Check_Sources_B_9 - 2*IsMonitoring_0 = 0
inv : AvailableJobId_1 + CreatedJobs_2 + CreatedJobs_3 = 1
inv : AwakeTasks_8 + IdleTasks_8 - Idle_8 = 0
inv : AwakeTasks_5 + IdleTasks_5 - Idle_5 = 0
inv : AwakeTasks_0 + IdleTasks_0 - Idle_0 = 0
inv : NotifyEventJobQueuedB_0 + NotifyEventJobQueuedB_1 + NotifyEventJobQueuedB_2 + NotifyEventJobQueuedB_3 + NotifyEventJobQueuedB_4 + NotifyEventJobQueuedB_5 + NotifyEventJobQueuedB_6 + NotifyEventJobQueuedB_7 + NotifyEventJobQueuedB_8 + NotifyEventJobQueuedB_9 + NotifyEventJobQueuedB_10 + NotifyEventJobQueuedB_11 + NotifyEventJobQueuedB_12 + NotifyEventJobQueuedB_13 + NotifyEventJobQueuedB_14 + NotifyEventJobQueuedB_15 + NotifyEventJobQueuedB_16 + NotifyEventJobQueuedB_17 + NotifyEventJobQueuedB_18 + NotifyEventJobQueuedB_19 + NotifyEventJobQueuedB_20 + NotifyEventJobQueuedB_21 + NotifyEventJobQueuedB_22 + NotifyEventJobQueuedB_23 + NotifyEventJobQueuedB_24 + NotifyEventJobQueuedB_25 + NotifyEventJobQueuedB_26 + NotifyEventJobQueuedB_27 + NotifyEventJobQueuedB_28 + NotifyEventJobQueuedB_29 + NotifyEventJobQueuedB_30 + NotifyEventJobQueuedB_31 + NotifyEventJobQueuedB_32 + NotifyEventJobQueuedB_33 + NotifyEventJobQueuedB_34 + NotifyEventJobQueuedB_35 + NotifyEventJobQueuedB_36 + NotifyEventJobQueuedB_37 + NotifyEventJobQueuedB_38 + NotifyEventJobQueuedB_39 + NotifyEventJobQueuedB_40 + NotifyEventJobQueuedB_41 + NotifyEventJobQueuedB_42 + NotifyEventJobQueuedB_43 + NotifyEventJobQueuedB_44 + NotifyEventJobQueuedB_45 + NotifyEventJobQueuedB_46 + NotifyEventJobQueuedB_47 + NotifyEventJobQueuedB_48 + NotifyEventJobQueuedB_49 + QueueJobB_0 + QueueJobB_1 + QueueJobB_2 + QueueJobB_3 + QueueJobB_4 + QueueJobB_5 + QueueJobB_6 + QueueJobB_7 + QueueJobB_8 + QueueJobB_9 + QueueJobB_10 + QueueJobB_11 + QueueJobB_12 + QueueJobB_13 + QueueJobB_14 + QueueJobB_15 + QueueJobB_16 + QueueJobB_17 + QueueJobB_18 + QueueJobB_19 + QueueJobB_20 + QueueJobB_21 + QueueJobB_22 + QueueJobB_23 + QueueJobB_24 + QueueJobB_25 + QueueJobB_26 + QueueJobB_27 + QueueJobB_28 + QueueJobB_29 + QueueJobB_30 + QueueJobB_31 + QueueJobB_32 + QueueJobB_33 + QueueJobB_34 + QueueJobB_35 + QueueJobB_36 + QueueJobB_37 + QueueJobB_38 + QueueJobB_39 + QueueJobB_40 + QueueJobB_41 + QueueJobB_42 + QueueJobB_43 + QueueJobB_44 + QueueJobB_45 + QueueJobB_46 + QueueJobB_47 + QueueJobB_48 + QueueJobB_49 - P_2321_5 + TryAllocateOneTaskE_5 + TryAllocateOneTaskB_5 + P_2318_0 + P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 + 2*ScheduleTaskE_Check_0 + 2*ScheduleTaskE_Check_1 + 2*ScheduleTaskE_Check_2 + 2*ScheduleTaskE_Check_3 + 2*ScheduleTaskE_Check_4 + 2*ScheduleTaskE_Check_5 + 2*ScheduleTaskE_Check_6 + 2*ScheduleTaskE_Check_7 + 2*ScheduleTaskE_Check_8 + 2*ScheduleTaskE_Check_9 + P_1093_0 + P_1119_0 + P_1119_1 + P_1119_2 + P_1119_3 + P_1119_4 + P_1119_5 + P_1119_6 + P_1119_7 + P_1119_8 + P_1119_9 + P_1119_10 + P_1119_11 + P_1119_12 + P_1119_13 + P_1119_14 + P_1119_15 + P_1119_16 + P_1119_17 + P_1119_18 + P_1119_19 + 2*ProcessingEvt_0 + 2*ProcessingEvt_1 + 2*ProcessingEvt_2 + 2*ProcessingEvt_3 + 2*ProcessingEvt_4 + 2*ProcessingEvt_5 + 2*ProcessingEvt_6 + 2*ProcessingEvt_7 + 2*ProcessingEvt_8 + 2*ProcessingEvt_9 + P_1158_0 + P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + 2*NotifyEventEndOfCheckSourcesB_0 + 2*NotifyEventEndOfCheckSourcesB_1 + 2*NotifyEventEndOfCheckSourcesB_2 + 2*NotifyEventEndOfCheckSourcesB_3 + 2*NotifyEventEndOfCheckSourcesB_4 + 2*NotifyEventEndOfCheckSourcesB_5 + 2*NotifyEventEndOfCheckSourcesB_6 + 2*NotifyEventEndOfCheckSourcesB_7 + 2*NotifyEventEndOfCheckSourcesB_8 + 2*NotifyEventEndOfCheckSourcesB_9 + 2*Check_Sources_B_0 + 2*Check_Sources_B_1 + 2*Check_Sources_B_2 + 2*Check_Sources_B_3 + 2*Check_Sources_B_4 + 2*Check_Sources_B_5 + 2*Check_Sources_B_6 + 2*Check_Sources_B_7 + 2*Check_Sources_B_8 + 2*Check_Sources_B_9 + 2*Check_Sources_E_0 + 2*Check_Sources_E_1 + 2*Check_Sources_E_2 + 2*Check_Sources_E_3 + 2*Check_Sources_E_4 + 2*Check_Sources_E_5 + 2*Check_Sources_E_6 + 2*Check_Sources_E_7 + 2*Check_Sources_E_8 + 2*Check_Sources_E_9 + 2*Try_Check_Sources_B_0 + 2*Try_Check_Sources_B_1 + 2*Try_Check_Sources_B_2 + 2*Try_Check_Sources_B_3 + 2*Try_Check_Sources_B_4 + 2*Try_Check_Sources_B_5 + 2*Try_Check_Sources_B_6 + 2*Try_Check_Sources_B_7 + 2*Try_Check_Sources_B_8 + 2*Try_Check_Sources_B_9 - 2*IsMonitoring_0 = 0
inv : P_2321_8 - TryAllocateOneTaskE_8 - TryAllocateOneTaskB_8 + P_2318_8 = 0
inv : cJobCnt_0 - NotifyEventJobQueuedB_0 - NotifyEventJobQueuedB_1 - NotifyEventJobQueuedB_2 - NotifyEventJobQueuedB_3 - NotifyEventJobQueuedB_4 - NotifyEventJobQueuedB_5 - NotifyEventJobQueuedB_6 - NotifyEventJobQueuedB_7 - NotifyEventJobQueuedB_8 - NotifyEventJobQueuedB_9 - NotifyEventJobQueuedB_10 - NotifyEventJobQueuedB_11 - NotifyEventJobQueuedB_12 - NotifyEventJobQueuedB_13 - NotifyEventJobQueuedB_14 - NotifyEventJobQueuedB_15 - NotifyEventJobQueuedB_16 - NotifyEventJobQueuedB_17 - NotifyEventJobQueuedB_18 - NotifyEventJobQueuedB_19 - NotifyEventJobQueuedB_20 - NotifyEventJobQueuedB_21 - NotifyEventJobQueuedB_22 - NotifyEventJobQueuedB_23 - NotifyEventJobQueuedB_24 - NotifyEventJobQueuedB_25 - NotifyEventJobQueuedB_26 - NotifyEventJobQueuedB_27 - NotifyEventJobQueuedB_28 - NotifyEventJobQueuedB_29 - NotifyEventJobQueuedB_30 - NotifyEventJobQueuedB_31 - NotifyEventJobQueuedB_32 - NotifyEventJobQueuedB_33 - NotifyEventJobQueuedB_34 - NotifyEventJobQueuedB_35 - NotifyEventJobQueuedB_36 - NotifyEventJobQueuedB_37 - NotifyEventJobQueuedB_38 - NotifyEventJobQueuedB_39 - NotifyEventJobQueuedB_40 - NotifyEventJobQueuedB_41 - NotifyEventJobQueuedB_42 - NotifyEventJobQueuedB_43 - NotifyEventJobQueuedB_44 - NotifyEventJobQueuedB_45 - NotifyEventJobQueuedB_46 - NotifyEventJobQueuedB_47 - NotifyEventJobQueuedB_48 - NotifyEventJobQueuedB_49 + P_2321_1 + P_2321_2 + P_2321_5 + P_2321_6 + P_2321_9 + TryAllocateOneTaskE_0 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskB_0 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 - P_2318_0 - P_2318_3 - P_2318_4 - P_2318_7 - P_2318_8 + EnablePollingE_0 + EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingB_0 + EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + EnablePollingB_9 + ScheduleTaskB_0 + ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + Abort_Check_Sources_E_0 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9 + Abort_Check_Sources_B_0 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 + Abort_Check_Sources_B_9 + Insert_Source_B_0 + Insert_Source_B_1 + Insert_Source_B_2 + Insert_Source_B_3 + Insert_Source_B_4 + Insert_Source_B_5 + Insert_Source_B_6 + Insert_Source_B_7 + Insert_Source_B_8 + Insert_Source_B_9 + Insert_Source_B_10 + Insert_Source_B_11 + Insert_Source_B_12 + Insert_Source_B_13 + Insert_Source_B_14 + Insert_Source_B_15 + Insert_Source_B_16 + Insert_Source_B_17 + Insert_Source_B_18 + Insert_Source_B_19 - AvailableJobId_0 + CreatedJobs_2 + CreatedJobs_3 + CreatedJobs_4 + CreatedJobs_5 + CreatedJobs_6 + CreatedJobs_7 + CreatedJobs_8 + CreatedJobs_9 + Idle_0 + Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + NotifyEventJobCompletedE_0 + NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + NotifyEventJobCompletedE_9 + RunB_0 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9 + Perform_Work_E_0 + Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 + Perform_Work_E_9 + IsMonitoring_0 + P_1617_0 + P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_2579_0 + P_2579_1 + P_2579_2 + P_2579_3 + P_2579_4 + P_2579_5 + P_2579_6 + P_2579_7 + P_2579_8 + P_2579_9 + P_2579_10 + P_2579_11 + P_2579_12 + P_2579_13 + P_2579_14 + P_2579_15 + P_2579_16 + P_2579_17 + P_2579_18 + P_2579_19 + ScheduleTaskE_Idle_0 + ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_9 = 19
inv : -P_2321_6 + TryAllocateOneTaskE_6 + TryAllocateOneTaskB_6 - P_2318_6 = 0
inv : cPollingAbort_0 + Abort_Check_Sources_E_0 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9 + Abort_Check_Sources_B_0 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 + Abort_Check_Sources_B_9 = 1
inv : BlockedTasks_0 + ScheduleTaskE_Check_0 + ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 + ScheduleTaskE_Check_9 - IsMonitoring_0 = 0
inv : cBlockedTasks_0 - ScheduleTaskE_Check_0 - ScheduleTaskE_Check_1 - ScheduleTaskE_Check_2 - ScheduleTaskE_Check_3 - ScheduleTaskE_Check_4 - ScheduleTaskE_Check_5 - ScheduleTaskE_Check_6 - ScheduleTaskE_Check_7 - ScheduleTaskE_Check_8 - ScheduleTaskE_Check_9 + IsMonitoring_0 = 10
inv : AwakeTasks_3 + IdleTasks_3 - Idle_3 = 0
inv : NotifyEventJobQueuedB_1 + NotifyEventJobQueuedB_6 + NotifyEventJobQueuedB_11 + NotifyEventJobQueuedB_16 + NotifyEventJobQueuedB_21 + NotifyEventJobQueuedB_26 + NotifyEventJobQueuedB_31 + NotifyEventJobQueuedB_36 + NotifyEventJobQueuedB_41 + NotifyEventJobQueuedB_46 + QueueJobB_1 + QueueJobB_6 + QueueJobB_11 + QueueJobB_16 + QueueJobB_21 + QueueJobB_26 + QueueJobB_31 + QueueJobB_36 + QueueJobB_41 + QueueJobB_46 + P_1725_1 + P_1724_1 + FetchJobE_1 + FetchJobE_6 + FetchJobE_11 + FetchJobE_16 + FetchJobE_21 + FetchJobE_26 + FetchJobE_31 + FetchJobE_36 + FetchJobE_41 + FetchJobE_46 + P_1712_1 - CreatedJobs_2 - CreatedJobs_3 = 0
inv : IdleTasks_0 + IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4 + IdleTasks_5 + IdleTasks_6 + IdleTasks_7 + IdleTasks_8 + IdleTasks_9 + cIdleTasks_0 + ScheduleTaskE_Idle_0 + ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_9 = 10
inv : NotifyEventJobQueuedB_0 + NotifyEventJobQueuedB_5 + NotifyEventJobQueuedB_10 + NotifyEventJobQueuedB_15 + NotifyEventJobQueuedB_20 + NotifyEventJobQueuedB_25 + NotifyEventJobQueuedB_30 + NotifyEventJobQueuedB_35 + NotifyEventJobQueuedB_40 + NotifyEventJobQueuedB_45 + QueueJobB_0 + QueueJobB_5 + QueueJobB_10 + QueueJobB_15 + QueueJobB_20 + QueueJobB_25 + QueueJobB_30 + QueueJobB_35 + QueueJobB_40 + QueueJobB_45 + P_1725_0 + P_1724_0 + FetchJobE_0 + FetchJobE_5 + FetchJobE_10 + FetchJobE_15 + FetchJobE_20 + FetchJobE_25 + FetchJobE_30 + FetchJobE_35 + FetchJobE_40 + FetchJobE_45 + P_1712_0 + AvailableJobId_0 = 1
inv : AwakeTasks_6 + IdleTasks_6 - Idle_6 = 0
inv : P_2321_0 - TryAllocateOneTaskE_0 - TryAllocateOneTaskB_0 + P_2318_0 = 0
inv : AvailableJobId_0 + CreatedJobs_0 + CreatedJobs_1 = 1
inv : PollingAbort_0 - Abort_Check_Sources_E_0 - Abort_Check_Sources_E_1 - Abort_Check_Sources_E_2 - Abort_Check_Sources_E_3 - Abort_Check_Sources_E_4 - Abort_Check_Sources_E_5 - Abort_Check_Sources_E_6 - Abort_Check_Sources_E_7 - Abort_Check_Sources_E_8 - Abort_Check_Sources_E_9 - Abort_Check_Sources_B_0 - Abort_Check_Sources_B_1 - Abort_Check_Sources_B_2 - Abort_Check_Sources_B_3 - Abort_Check_Sources_B_4 - Abort_Check_Sources_B_5 - Abort_Check_Sources_B_6 - Abort_Check_Sources_B_7 - Abort_Check_Sources_B_8 - Abort_Check_Sources_B_9 = 0
inv : -P_2321_1 + TryAllocateOneTaskE_1 + TryAllocateOneTaskB_1 - P_2318_1 = 0
inv : NotifyEventJobQueuedB_0 - NotifyEventJobQueuedB_1 - NotifyEventJobQueuedB_2 - NotifyEventJobQueuedB_3 + NotifyEventJobQueuedB_5 - NotifyEventJobQueuedB_6 - NotifyEventJobQueuedB_7 - NotifyEventJobQueuedB_8 + NotifyEventJobQueuedB_10 - NotifyEventJobQueuedB_11 - NotifyEventJobQueuedB_12 - NotifyEventJobQueuedB_13 + NotifyEventJobQueuedB_15 - NotifyEventJobQueuedB_16 - NotifyEventJobQueuedB_17 - NotifyEventJobQueuedB_18 + NotifyEventJobQueuedB_20 - NotifyEventJobQueuedB_21 - NotifyEventJobQueuedB_22 - NotifyEventJobQueuedB_23 + NotifyEventJobQueuedB_25 - NotifyEventJobQueuedB_26 - NotifyEventJobQueuedB_27 - NotifyEventJobQueuedB_28 + NotifyEventJobQueuedB_30 - NotifyEventJobQueuedB_31 - NotifyEventJobQueuedB_32 - NotifyEventJobQueuedB_33 + NotifyEventJobQueuedB_35 - NotifyEventJobQueuedB_36 - NotifyEventJobQueuedB_37 - NotifyEventJobQueuedB_38 + NotifyEventJobQueuedB_40 - NotifyEventJobQueuedB_41 - NotifyEventJobQueuedB_42 - NotifyEventJobQueuedB_43 + NotifyEventJobQueuedB_45 - NotifyEventJobQueuedB_46 - NotifyEventJobQueuedB_47 - NotifyEventJobQueuedB_48 + QueueJobB_0 - QueueJobB_1 - QueueJobB_2 - QueueJobB_3 + QueueJobB_5 - QueueJobB_6 - QueueJobB_7 - QueueJobB_8 + QueueJobB_10 - QueueJobB_11 - QueueJobB_12 - QueueJobB_13 + QueueJobB_15 - QueueJobB_16 - QueueJobB_17 - QueueJobB_18 + QueueJobB_20 - QueueJobB_21 - QueueJobB_22 - QueueJobB_23 + QueueJobB_25 - QueueJobB_26 - QueueJobB_27 - QueueJobB_28 + QueueJobB_30 - QueueJobB_31 - QueueJobB_32 - QueueJobB_33 + QueueJobB_35 - QueueJobB_36 - QueueJobB_37 - QueueJobB_38 + QueueJobB_40 - QueueJobB_41 - QueueJobB_42 - QueueJobB_43 + QueueJobB_45 - QueueJobB_46 - QueueJobB_47 - QueueJobB_48 + MarkerWrite_0 + 2*P_1725_0 + P_1725_4 + P_1724_0 - P_1724_1 - P_1724_2 - P_1724_3 + FetchJobE_0 - FetchJobE_1 - FetchJobE_2 - FetchJobE_3 + FetchJobE_5 - FetchJobE_6 - FetchJobE_7 - FetchJobE_8 + FetchJobE_10 - FetchJobE_11 - FetchJobE_12 - FetchJobE_13 + FetchJobE_15 - FetchJobE_16 - FetchJobE_17 - FetchJobE_18 + FetchJobE_20 - FetchJobE_21 - FetchJobE_22 - FetchJobE_23 + FetchJobE_25 - FetchJobE_26 - FetchJobE_27 - FetchJobE_28 + FetchJobE_30 - FetchJobE_31 - FetchJobE_32 - FetchJobE_33 + FetchJobE_35 - FetchJobE_36 - FetchJobE_37 - FetchJobE_38 + FetchJobE_40 - FetchJobE_41 - FetchJobE_42 - FetchJobE_43 + FetchJobE_45 - FetchJobE_46 - FetchJobE_47 - FetchJobE_48 - MarkerRead_0 - 2*P_1712_1 - 2*P_1712_2 - 2*P_1712_3 - P_1712_4 + AvailableJobId_0 + CreatedJobs_2 + CreatedJobs_3 + CreatedJobs_4 + CreatedJobs_5 + CreatedJobs_6 + CreatedJobs_7 = 1
inv : AwakeTasks_7 + IdleTasks_7 - Idle_7 = 0
inv : SigAbort_0 + NoSigAbort_0 = 1
inv : JobCnt_0 + NotifyEventJobQueuedB_0 + NotifyEventJobQueuedB_1 + NotifyEventJobQueuedB_2 + NotifyEventJobQueuedB_3 + NotifyEventJobQueuedB_4 + NotifyEventJobQueuedB_5 + NotifyEventJobQueuedB_6 + NotifyEventJobQueuedB_7 + NotifyEventJobQueuedB_8 + NotifyEventJobQueuedB_9 + NotifyEventJobQueuedB_10 + NotifyEventJobQueuedB_11 + NotifyEventJobQueuedB_12 + NotifyEventJobQueuedB_13 + NotifyEventJobQueuedB_14 + NotifyEventJobQueuedB_15 + NotifyEventJobQueuedB_16 + NotifyEventJobQueuedB_17 + NotifyEventJobQueuedB_18 + NotifyEventJobQueuedB_19 + NotifyEventJobQueuedB_20 + NotifyEventJobQueuedB_21 + NotifyEventJobQueuedB_22 + NotifyEventJobQueuedB_23 + NotifyEventJobQueuedB_24 + NotifyEventJobQueuedB_25 + NotifyEventJobQueuedB_26 + NotifyEventJobQueuedB_27 + NotifyEventJobQueuedB_28 + NotifyEventJobQueuedB_29 + NotifyEventJobQueuedB_30 + NotifyEventJobQueuedB_31 + NotifyEventJobQueuedB_32 + NotifyEventJobQueuedB_33 + NotifyEventJobQueuedB_34 + NotifyEventJobQueuedB_35 + NotifyEventJobQueuedB_36 + NotifyEventJobQueuedB_37 + NotifyEventJobQueuedB_38 + NotifyEventJobQueuedB_39 + NotifyEventJobQueuedB_40 + NotifyEventJobQueuedB_41 + NotifyEventJobQueuedB_42 + NotifyEventJobQueuedB_43 + NotifyEventJobQueuedB_44 + NotifyEventJobQueuedB_45 + NotifyEventJobQueuedB_46 + NotifyEventJobQueuedB_47 + NotifyEventJobQueuedB_48 + NotifyEventJobQueuedB_49 - P_2321_1 - P_2321_2 - P_2321_5 - P_2321_6 - P_2321_9 - TryAllocateOneTaskE_0 - TryAllocateOneTaskE_3 - TryAllocateOneTaskE_4 - TryAllocateOneTaskE_7 - TryAllocateOneTaskE_8 - TryAllocateOneTaskB_0 - TryAllocateOneTaskB_3 - TryAllocateOneTaskB_4 - TryAllocateOneTaskB_7 - TryAllocateOneTaskB_8 + P_2318_0 + P_2318_3 + P_2318_4 + P_2318_7 + P_2318_8 - EnablePollingE_0 - EnablePollingE_1 - EnablePollingE_2 - EnablePollingE_3 - EnablePollingE_4 - EnablePollingE_5 - EnablePollingE_6 - EnablePollingE_7 - EnablePollingE_8 - EnablePollingE_9 - EnablePollingB_0 - EnablePollingB_1 - EnablePollingB_2 - EnablePollingB_3 - EnablePollingB_4 - EnablePollingB_5 - EnablePollingB_6 - EnablePollingB_7 - EnablePollingB_8 - EnablePollingB_9 - ScheduleTaskB_0 - ScheduleTaskB_1 - ScheduleTaskB_2 - ScheduleTaskB_3 - ScheduleTaskB_4 - ScheduleTaskB_5 - ScheduleTaskB_6 - ScheduleTaskB_7 - ScheduleTaskB_8 - ScheduleTaskB_9 - Abort_Check_Sources_E_0 - Abort_Check_Sources_E_1 - Abort_Check_Sources_E_2 - Abort_Check_Sources_E_3 - Abort_Check_Sources_E_4 - Abort_Check_Sources_E_5 - Abort_Check_Sources_E_6 - Abort_Check_Sources_E_7 - Abort_Check_Sources_E_8 - Abort_Check_Sources_E_9 - Abort_Check_Sources_B_0 - Abort_Check_Sources_B_1 - Abort_Check_Sources_B_2 - Abort_Check_Sources_B_3 - Abort_Check_Sources_B_4 - Abort_Check_Sources_B_5 - Abort_Check_Sources_B_6 - Abort_Check_Sources_B_7 - Abort_Check_Sources_B_8 - Abort_Check_Sources_B_9 - Insert_Source_B_0 - Insert_Source_B_1 - Insert_Source_B_2 - Insert_Source_B_3 - Insert_Source_B_4 - Insert_Source_B_5 - Insert_Source_B_6 - Insert_Source_B_7 - Insert_Source_B_8 - Insert_Source_B_9 - Insert_Source_B_10 - Insert_Source_B_11 - Insert_Source_B_12 - Insert_Source_B_13 - Insert_Source_B_14 - Insert_Source_B_15 - Insert_Source_B_16 - Insert_Source_B_17 - Insert_Source_B_18 - Insert_Source_B_19 + AvailableJobId_0 - CreatedJobs_2 - CreatedJobs_3 - CreatedJobs_4 - CreatedJobs_5 - CreatedJobs_6 - CreatedJobs_7 - CreatedJobs_8 - CreatedJobs_9 - Idle_0 - Idle_1 - Idle_2 - Idle_3 - Idle_4 - Idle_5 - Idle_6 - Idle_7 - Idle_8 - Idle_9 - NotifyEventJobCompletedE_0 - NotifyEventJobCompletedE_1 - NotifyEventJobCompletedE_2 - NotifyEventJobCompletedE_3 - NotifyEventJobCompletedE_4 - NotifyEventJobCompletedE_5 - NotifyEventJobCompletedE_6 - NotifyEventJobCompletedE_7 - NotifyEventJobCompletedE_8 - NotifyEventJobCompletedE_9 - RunB_0 - RunB_1 - RunB_2 - RunB_3 - RunB_4 - RunB_5 - RunB_6 - RunB_7 - RunB_8 - RunB_9 - Perform_Work_E_0 - Perform_Work_E_1 - Perform_Work_E_2 - Perform_Work_E_3 - Perform_Work_E_4 - Perform_Work_E_5 - Perform_Work_E_6 - Perform_Work_E_7 - Perform_Work_E_8 - Perform_Work_E_9 - IsMonitoring_0 - P_1617_0 - P_1617_1 - P_1617_2 - P_1617_3 - P_1617_4 - P_1617_5 - P_1617_6 - P_1617_7 - P_1617_8 - P_1617_9 - P_2579_0 - P_2579_1 - P_2579_2 - P_2579_3 - P_2579_4 - P_2579_5 - P_2579_6 - P_2579_7 - P_2579_8 - P_2579_9 - P_2579_10 - P_2579_11 - P_2579_12 - P_2579_13 - P_2579_14 - P_2579_15 - P_2579_16 - P_2579_17 - P_2579_18 - P_2579_19 - ScheduleTaskE_Idle_0 - ScheduleTaskE_Idle_1 - ScheduleTaskE_Idle_2 - ScheduleTaskE_Idle_3 - ScheduleTaskE_Idle_4 - ScheduleTaskE_Idle_5 - ScheduleTaskE_Idle_6 - ScheduleTaskE_Idle_7 - ScheduleTaskE_Idle_8 - ScheduleTaskE_Idle_9 = -9
inv : P_2321_4 - TryAllocateOneTaskE_4 - TryAllocateOneTaskB_4 + P_2318_4 = 0
inv : Abort_Check_Sources_E_0 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9 + Abort_Check_Sources_B_0 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 + Abort_Check_Sources_B_9 + PlaceSources_0 + Insert_Source_B_0 + Insert_Source_B_2 + Insert_Source_B_4 + Insert_Source_B_6 + Insert_Source_B_8 + Insert_Source_B_10 + Insert_Source_B_12 + Insert_Source_B_14 + Insert_Source_B_16 + Insert_Source_B_18 + P_1119_0 + P_1119_2 + P_1119_4 + P_1119_6 + P_1119_8 + P_1119_10 + P_1119_12 + P_1119_14 + P_1119_16 + P_1119_18 + CreatedJobs_0 + CreatedJobs_2 + CreatedJobs_4 + CreatedJobs_6 + CreatedJobs_8 + ModifiedSrc_0 - AbourtToModifySrc_1 + P_2579_0 + P_2579_2 + P_2579_4 + P_2579_6 + P_2579_8 + P_2579_10 + P_2579_12 + P_2579_14 + P_2579_16 + P_2579_18 = 1
inv : AwakeTasks_1 + IdleTasks_1 - Idle_1 = 0
inv : cIsMonitoring_0 + IsMonitoring_0 = 1
inv : -Abort_Check_Sources_E_0 - Abort_Check_Sources_E_1 - Abort_Check_Sources_E_2 - Abort_Check_Sources_E_3 - Abort_Check_Sources_E_4 - Abort_Check_Sources_E_5 - Abort_Check_Sources_E_6 - Abort_Check_Sources_E_7 - Abort_Check_Sources_E_8 - Abort_Check_Sources_E_9 - Abort_Check_Sources_B_0 - Abort_Check_Sources_B_1 - Abort_Check_Sources_B_2 - Abort_Check_Sources_B_3 - Abort_Check_Sources_B_4 - Abort_Check_Sources_B_5 - Abort_Check_Sources_B_6 - Abort_Check_Sources_B_7 - Abort_Check_Sources_B_8 - Abort_Check_Sources_B_9 + AbourtToModifySrc_0 + AbourtToModifySrc_1 = 0
inv : AvailableJobId_3 + CreatedJobs_6 + CreatedJobs_7 = 1
inv : 2*ScheduleTaskE_Check_0 + 2*ScheduleTaskE_Check_1 + 2*ScheduleTaskE_Check_2 + 2*ScheduleTaskE_Check_3 + 2*ScheduleTaskE_Check_4 + 2*ScheduleTaskE_Check_5 + 2*ScheduleTaskE_Check_6 + 2*ScheduleTaskE_Check_7 + 2*ScheduleTaskE_Check_8 + 2*ScheduleTaskE_Check_9 + 2*P_1093_0 + P_1095_0 + 2*ProcessingEvt_0 + 2*ProcessingEvt_1 + 2*ProcessingEvt_2 + 2*ProcessingEvt_3 + 2*ProcessingEvt_4 + 2*ProcessingEvt_5 + 2*ProcessingEvt_6 + 2*ProcessingEvt_7 + 2*ProcessingEvt_8 + 2*ProcessingEvt_9 + P_1158_0 + P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + 2*NotifyEventEndOfCheckSourcesB_0 + 2*NotifyEventEndOfCheckSourcesB_1 + 2*NotifyEventEndOfCheckSourcesB_2 + 2*NotifyEventEndOfCheckSourcesB_3 + 2*NotifyEventEndOfCheckSourcesB_4 + 2*NotifyEventEndOfCheckSourcesB_5 + 2*NotifyEventEndOfCheckSourcesB_6 + 2*NotifyEventEndOfCheckSourcesB_7 + 2*NotifyEventEndOfCheckSourcesB_8 + 2*NotifyEventEndOfCheckSourcesB_9 + 2*Check_Sources_B_0 + 2*Check_Sources_B_1 + 2*Check_Sources_B_2 + 2*Check_Sources_B_3 + 2*Check_Sources_B_4 + 2*Check_Sources_B_5 + 2*Check_Sources_B_6 + 2*Check_Sources_B_7 + 2*Check_Sources_B_8 + 2*Check_Sources_B_9 + 2*Check_Sources_E_0 + 2*Check_Sources_E_1 + 2*Check_Sources_E_2 + 2*Check_Sources_E_3 + 2*Check_Sources_E_4 + 2*Check_Sources_E_5 + 2*Check_Sources_E_6 + 2*Check_Sources_E_7 + 2*Check_Sources_E_8 + 2*Check_Sources_E_9 + 2*Try_Check_Sources_B_0 + 2*Try_Check_Sources_B_1 + 2*Try_Check_Sources_B_2 + 2*Try_Check_Sources_B_3 + 2*Try_Check_Sources_B_4 + 2*Try_Check_Sources_B_5 + 2*Try_Check_Sources_B_6 + 2*Try_Check_Sources_B_7 + 2*Try_Check_Sources_B_8 + 2*Try_Check_Sources_B_9 - 2*IsMonitoring_0 = 0
inv : AwakeTasks_2 + IdleTasks_2 - Idle_2 = 0
inv : -P_2321_9 + TryAllocateOneTaskE_9 + TryAllocateOneTaskB_9 - P_2318_9 = 0
inv : AvailableJobId_2 + CreatedJobs_4 + CreatedJobs_5 = 1
inv : AwakeTasks_4 + IdleTasks_4 - Idle_4 = 0
inv : -P_2321_2 + TryAllocateOneTaskE_2 + TryAllocateOneTaskB_2 - P_2318_2 = 0
inv : -NotifyEventJobQueuedB_0 + NotifyEventJobQueuedB_4 - NotifyEventJobQueuedB_5 + NotifyEventJobQueuedB_9 - NotifyEventJobQueuedB_10 + NotifyEventJobQueuedB_14 - NotifyEventJobQueuedB_15 + NotifyEventJobQueuedB_19 - NotifyEventJobQueuedB_20 + NotifyEventJobQueuedB_24 - NotifyEventJobQueuedB_25 + NotifyEventJobQueuedB_29 - NotifyEventJobQueuedB_30 + NotifyEventJobQueuedB_34 - NotifyEventJobQueuedB_35 + NotifyEventJobQueuedB_39 - NotifyEventJobQueuedB_40 + NotifyEventJobQueuedB_44 - NotifyEventJobQueuedB_45 + NotifyEventJobQueuedB_49 - QueueJobB_0 + QueueJobB_4 - QueueJobB_5 + QueueJobB_9 - QueueJobB_10 + QueueJobB_14 - QueueJobB_15 + QueueJobB_19 - QueueJobB_20 + QueueJobB_24 - QueueJobB_25 + QueueJobB_29 - QueueJobB_30 + QueueJobB_34 - QueueJobB_35 + QueueJobB_39 - QueueJobB_40 + QueueJobB_44 - QueueJobB_45 + QueueJobB_49 + P_1726_0 - P_1725_0 + P_1725_4 - 2*P_1724_0 - P_1724_1 - P_1724_2 - P_1724_3 - FetchJobE_0 + FetchJobE_4 - FetchJobE_5 + FetchJobE_9 - FetchJobE_10 + FetchJobE_14 - FetchJobE_15 + FetchJobE_19 - FetchJobE_20 + FetchJobE_24 - FetchJobE_25 + FetchJobE_29 - FetchJobE_30 + FetchJobE_34 - FetchJobE_35 + FetchJobE_39 - FetchJobE_40 + FetchJobE_44 - FetchJobE_45 + FetchJobE_49 - P_1716_0 + P_1712_1 + P_1712_2 + P_1712_3 + 2*P_1712_4 - AvailableJobId_0 - CreatedJobs_8 - CreatedJobs_9 = -1
Total of 52 invariants.
[2021-05-16 16:39:45] [INFO ] Computed 52 place invariants in 63 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :225 after 791
[2021-05-16 16:39:45] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=3 took 378 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :791 after 1386
[2021-05-16 16:39:46] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(UNSAT) depth K=4 took 1331 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1386 after 2234
[2021-05-16 16:39:47] [INFO ] Proved 518 variables to be positive in 2972 ms
[2021-05-16 16:39:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBLF-COL-S02J04T10-ReachabilityCardinality-12
[2021-05-16 16:39:48] [INFO ] KInduction solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(SAT) depth K=0 took 123 ms
[2021-05-16 16:39:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBLF-COL-S02J04T10-ReachabilityCardinality-13
[2021-05-16 16:39:48] [INFO ] KInduction solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(SAT) depth K=0 took 193 ms
[2021-05-16 16:39:49] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=4 took 2403 ms
[2021-05-16 16:39:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBLF-COL-S02J04T10-ReachabilityCardinality-12
[2021-05-16 16:39:49] [INFO ] KInduction solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(SAT) depth K=1 took 1424 ms
Compilation finished in 6875 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18438136049308289466]
Link finished in 139 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBLFCOLS02J04T10ReachabilityCardinality12==true], workingDir=/tmp/ltsmin18438136049308289466]
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2234 after 3393
[2021-05-16 16:39:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBLF-COL-S02J04T10-ReachabilityCardinality-13
[2021-05-16 16:39:50] [INFO ] KInduction solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(SAT) depth K=1 took 988 ms
[2021-05-16 16:39:57] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(UNSAT) depth K=5 took 7973 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3393 after 6019
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6019 after 25967
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :25967 after 230492
[2021-05-16 16:44:46] [INFO ] Induction result is UNSAT, proved invariant PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12
[2021-05-16 16:44:46] [INFO ] Induction result is UNSAT, successfully proved induction at step 2 for PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12 TRUE TECHNIQUES SAT_SMT K_INDUCTION(2)
[2021-05-16 16:44:46] [INFO ] KInduction solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12(TRUE) depth K=2 took 295910 ms
[2021-05-16 16:45:08] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=5 took 311656 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :230492 after 293482
[2021-05-16 16:49:10] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=6 took 241312 ms
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :293482 after 2.04829e+06
Detected timeout of ITS tools.
[2021-05-16 17:00:58] [INFO ] Applying decomposition
[2021-05-16 17:00:58] [INFO ] Flatten gal took : 418 ms
[2021-05-16 17:00:58] [INFO ] Decomposing Gal with order
[2021-05-16 17:00:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 17:00:59] [INFO ] Removed a total of 3299 redundant transitions.
[2021-05-16 17:00:59] [INFO ] Flatten gal took : 423 ms
[2021-05-16 17:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 49 ms.
[2021-05-16 17:00:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17542046248878600190.gal : 47 ms
[2021-05-16 17:00:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3026017433635870834.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17542046248878600190.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3026017433635870834.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17542046248878600190.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3026017433635870834.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3026017433635870834.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 67
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :67 after 86
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86 after 203
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :203 after 384
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :384 after 574
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :574 after 723
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :723 after 1022
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1022 after 2870
[2021-05-16 17:01:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBLF-COL-S02J04T10-ReachabilityCardinality-13
[2021-05-16 17:01:44] [INFO ] KInduction solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(SAT) depth K=2 took 1018330 ms
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2870 after 5693
[2021-05-16 17:02:42] [INFO ] BMC solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(UNSAT) depth K=7 took 812715 ms
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5693 after 26281
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :26281 after 137207
WARNING : LTSmin timed out (>1800 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBLFCOLS02J04T10ReachabilityCardinality12==true], workingDir=/tmp/ltsmin18438136049308289466]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PolyORBLFCOLS02J04T10ReachabilityCardinality13==true], workingDir=/tmp/ltsmin18438136049308289466]
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :137207 after 341521
Detected timeout of ITS tools.
[2021-05-16 17:22:14] [INFO ] Flatten gal took : 144 ms
[2021-05-16 17:22:15] [INFO ] Input system was already deterministic with 1052 transitions.
[2021-05-16 17:22:15] [INFO ] Transformed 518 places.
[2021-05-16 17:22:15] [INFO ] Transformed 1052 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 17:22:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14194251753344766483.gal : 4 ms
[2021-05-16 17:22:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2744410682814764759.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14194251753344766483.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2744410682814764759.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14194251753344766483.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2744410682814764759.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality2744410682814764759.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 241
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :241 after 421
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :421 after 1391
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1391 after 3441
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3441 after 13011
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :13011 after 23400
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23400 after 40704
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :40704 after 62826
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :62826 after 442569
[2021-05-16 17:28:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBLF-COL-S02J04T10-ReachabilityCardinality-13
[2021-05-16 17:28:51] [INFO ] KInduction solution for property PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13(SAT) depth K=3 took 1625949 ms
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :442569 after 818204

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PolyORBLF-COL-S02J04T10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089267800094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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