Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277027100281.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is PolyORBNT-COL-S05J40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 30 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655084576968

Running Version 0
[2022-06-13 01:42:58] [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]
[2022-06-13 01:42:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:42:58] [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.
[2022-06-13 01:42:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-13 01:42:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2022-06-13 01:42:59] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-06-13 01:42:59] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-06-13 01:42:59] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-06-13 01:42:59] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-06-13 01:42:59] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-06-13 01:42:59] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-06-13 01:42:59] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-06-13 01:42:59] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 4 ms.
[2022-06-13 01:42:59] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6409374691098165623.dot
Incomplete random walk after 100001 steps, including 7988 resets, run finished after 220 ms. (steps per millisecond=454 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-06-13 01:42:59] [INFO ] Computed 13 place invariants in 12 ms
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned unsat
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-13 01:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:42:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-13 01:42:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:42:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:42:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2022-06-13 01:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:42:59] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-06-13 01:42:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:42:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
[2022-06-13 01:43:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-06-13 01:43:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-06-13 01:43:00] [INFO ] Added : 33 causal constraints over 7 iterations in 165 ms. Result :sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-13 01:43:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-13 01:43:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-13 01:43:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2022-06-13 01:43:00] [INFO ] Added : 20 causal constraints over 4 iterations in 43 ms. Result :sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-13 01:43:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:00] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-13 01:43:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 2 ms to minimize.
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 18 places in 14 ms of which 0 ms to minimize.
[2022-06-13 01:43:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 158 ms
[2022-06-13 01:43:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2022-06-13 01:43:00] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2022-06-13 01:43:01] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2022-06-13 01:43:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 75 ms
[2022-06-13 01:43:01] [INFO ] Added : 36 causal constraints over 8 iterations in 206 ms. Result :sat
[2022-06-13 01:43:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2022-06-13 01:43:01] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2022-06-13 01:43:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-13 01:43:01] [INFO ] Flatten gal took : 26 ms
[2022-06-13 01:43:01] [INFO ] Flatten gal took : 7 ms
[2022-06-13 01:43:01] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 28 ms.
[2022-06-13 01:43:01] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_6162167414080034118.dot
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 40 transitions.
Incomplete random walk after 10000 steps, including 682 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :1
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-13 01:43:01] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2022-06-13 01:43:01] [INFO ] Computed 102 place invariants in 90 ms
[2022-06-13 01:43:01] [INFO ] [Real]Absence check using 95 positive place invariants in 28 ms returned sat
[2022-06-13 01:43:01] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-06-13 01:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:01] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2022-06-13 01:43:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:43:02] [INFO ] [Nat]Absence check using 95 positive place invariants in 25 ms returned sat
[2022-06-13 01:43:02] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-06-13 01:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:06] [INFO ] [Nat]Absence check using state equation in 4895 ms returned unknown
[2022-06-13 01:43:07] [INFO ] [Real]Absence check using 95 positive place invariants in 26 ms returned sat
[2022-06-13 01:43:07] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-06-13 01:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:07] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2022-06-13 01:43:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:43:07] [INFO ] [Nat]Absence check using 95 positive place invariants in 27 ms returned sat
[2022-06-13 01:43:07] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2022-06-13 01:43:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:43:07] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2022-06-13 01:43:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:43:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-06-13 01:43:07] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 88 ms.
[2022-06-13 01:43:09] [INFO ] Deduced a trap composed of 266 places in 252 ms of which 1 ms to minimize.
[2022-06-13 01:43:09] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 0 ms to minimize.
[2022-06-13 01:43:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1107 ms
[2022-06-13 01:43:10] [INFO ] Added : 42 causal constraints over 9 iterations in 2627 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 15800 steps, including 1115 resets, run finished after 63 ms. (steps per millisecond=250 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 133 out of 629 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 624 transition count 933
Reduce places removed 2 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 44 rules applied. Total rules applied 51 place count 622 transition count 891
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 93 place count 580 transition count 891
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 93 place count 580 transition count 887
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 576 transition count 887
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 575 transition count 886
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 575 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 574 transition count 885
Applied a total of 105 rules in 206 ms. Remains 574 /629 variables (removed 55) and now considering 885/935 (removed 50) transitions.
[2022-06-13 01:43:10] [INFO ] Flow matrix only has 881 transitions (discarded 4 similar events)
// Phase 1: matrix 881 rows 574 cols
[2022-06-13 01:43:10] [INFO ] Computed 97 place invariants in 55 ms
[2022-06-13 01:43:11] [INFO ] Dead Transitions using invariants and state equation in 589 ms returned [547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 588, 589, 590, 591, 592, 594, 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, 623, 624, 625, 626, 627, 629, 632, 633, 634, 635, 636, 637, 639, 642, 646, 647, 648, 649, 650, 651, 652, 654, 657, 661, 666]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[666, 661, 657, 654, 652, 651, 650, 649, 648, 647, 646, 642, 639, 637, 636, 635, 634, 633, 632, 629, 627, 626, 625, 624, 623, 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, 594, 592, 591, 590, 589, 588, 586, 585, 584, 583, 582, 581, 580, 579, 578, 577, 576, 575, 574, 573, 572, 571, 570, 569, 568, 566, 565, 564, 563, 562, 561, 560, 559, 558, 557, 556, 555, 554, 553, 552, 551, 550, 549, 548, 547]
Starting structural reductions, iteration 1 : 574/629 places, 790/935 transitions.
Applied a total of 0 rules in 42 ms. Remains 574 /574 variables (removed 0) and now considering 790/790 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 574/629 places, 790/935 transitions.
[2022-06-13 01:43:11] [INFO ] Flatten gal took : 91 ms
[2022-06-13 01:43:11] [INFO ] Flatten gal took : 82 ms
[2022-06-13 01:43:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6862462664884189558.gal : 24 ms
[2022-06-13 01:43:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9876955859854617509.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/ReachabilityCardinality6862462664884189558.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9876955859854617509.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/ReachabilityCardinality6862462664884189558.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9876955859854617509.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9876955859854617509.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 64
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 65
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :65 after 66
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :66 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 81
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :81 after 85
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 93
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :93 after 521
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :521 after 605
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :605 after 734
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :734 after 1019
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1019 after 20431
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :20431 after 27397
Detected timeout of ITS tools.
[2022-06-13 01:43:26] [INFO ] Flatten gal took : 65 ms
[2022-06-13 01:43:26] [INFO ] Applying decomposition
[2022-06-13 01:43:26] [INFO ] Flatten gal took : 55 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/graph6414407758857099328.txt, -o, /tmp/graph6414407758857099328.bin, -w, /tmp/graph6414407758857099328.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/graph6414407758857099328.bin, -l, -1, -v, -w, /tmp/graph6414407758857099328.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:43:26] [INFO ] Decomposing Gal with order
[2022-06-13 01:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:43:27] [INFO ] Removed a total of 1094 redundant transitions.
[2022-06-13 01:43:27] [INFO ] Flatten gal took : 298 ms
[2022-06-13 01:43:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 37 ms.
[2022-06-13 01:43:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15941805978944859101.gal : 14 ms
[2022-06-13 01:43:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8243281910225730303.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/ReachabilityCardinality15941805978944859101.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8243281910225730303.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/ReachabilityCardinality15941805978944859101.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8243281910225730303.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8243281910225730303.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 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 39
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :39 after 45
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :45 after 57
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :57 after 893
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :893 after 999
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :999 after 1297
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1297 after 1756
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1756 after 2606
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2606 after 63521
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14598828535015919732
[2022-06-13 01:43:42] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14598828535015919732
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/ltsmin14598828535015919732]
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/ltsmin14598828535015919732] 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/ltsmin14598828535015919732] 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 47706 resets, run finished after 4297 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2899 resets, run finished after 3029 ms. (steps per millisecond=330 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4475 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4640648 steps, run timeout after 30001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 4640648 steps, saw 1481922 distinct states, run finished after 30023 ms. (steps per millisecond=154 ) properties seen :{}
Running SMT prover for 2 properties.
[2022-06-13 01:44:22] [INFO ] Flow matrix only has 786 transitions (discarded 4 similar events)
// Phase 1: matrix 786 rows 574 cols
[2022-06-13 01:44:22] [INFO ] Computed 97 place invariants in 42 ms
[2022-06-13 01:44:22] [INFO ] [Real]Absence check using 91 positive place invariants in 23 ms returned sat
[2022-06-13 01:44:22] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-13 01:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:44:22] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-06-13 01:44:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:44:22] [INFO ] [Nat]Absence check using 91 positive place invariants in 23 ms returned sat
[2022-06-13 01:44:22] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-13 01:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:44:25] [INFO ] [Nat]Absence check using state equation in 2483 ms returned sat
[2022-06-13 01:44:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:44:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-06-13 01:44:25] [INFO ] Deduced a trap composed of 204 places in 196 ms of which 1 ms to minimize.
[2022-06-13 01:44:25] [INFO ] Deduced a trap composed of 192 places in 166 ms of which 1 ms to minimize.
[2022-06-13 01:44:25] [INFO ] Deduced a trap composed of 204 places in 180 ms of which 0 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 207 places in 190 ms of which 1 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 207 places in 203 ms of which 1 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 204 places in 186 ms of which 0 ms to minimize.
[2022-06-13 01:44:26] [INFO ] Deduced a trap composed of 225 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 213 places in 173 ms of which 1 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 207 places in 182 ms of which 1 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 207 places in 236 ms of which 0 ms to minimize.
[2022-06-13 01:44:27] [INFO ] Deduced a trap composed of 210 places in 176 ms of which 0 ms to minimize.
[2022-06-13 01:44:28] [INFO ] Deduced a trap composed of 198 places in 165 ms of which 0 ms to minimize.
[2022-06-13 01:44:28] [INFO ] Deduced a trap composed of 195 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:45:07] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2022-06-13 01:45:07] [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 0
[2022-06-13 01:45:07] [INFO ] [Real]Absence check using 91 positive place invariants in 29 ms returned sat
[2022-06-13 01:45:07] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-13 01:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:08] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2022-06-13 01:45:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:45:08] [INFO ] [Nat]Absence check using 91 positive place invariants in 23 ms returned sat
[2022-06-13 01:45:08] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-13 01:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:08] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-06-13 01:45:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-13 01:45:08] [INFO ] Computed and/alt/rep : 405/975/405 causal constraints (skipped 375 transitions) in 46 ms.
[2022-06-13 01:45:09] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2022-06-13 01:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-06-13 01:45:09] [INFO ] Added : 30 causal constraints over 7 iterations in 817 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 9700 steps, including 871 resets, run finished after 46 ms. (steps per millisecond=210 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 133 out of 574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 574/574 places, 790/790 transitions.
Applied a total of 0 rules in 37 ms. Remains 574 /574 variables (removed 0) and now considering 790/790 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 574/574 places, 790/790 transitions.
Starting structural reductions, iteration 0 : 574/574 places, 790/790 transitions.
Applied a total of 0 rules in 38 ms. Remains 574 /574 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2022-06-13 01:45:09] [INFO ] Flow matrix only has 786 transitions (discarded 4 similar events)
// Phase 1: matrix 786 rows 574 cols
[2022-06-13 01:45:09] [INFO ] Computed 97 place invariants in 25 ms
[2022-06-13 01:45:09] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-06-13 01:45:09] [INFO ] Flow matrix only has 786 transitions (discarded 4 similar events)
// Phase 1: matrix 786 rows 574 cols
[2022-06-13 01:45:09] [INFO ] Computed 97 place invariants in 26 ms
[2022-06-13 01:45:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:45:12] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 2502 ms to find 0 implicit places.
[2022-06-13 01:45:12] [INFO ] Redundant transitions in 60 ms returned []
[2022-06-13 01:45:12] [INFO ] Flow matrix only has 786 transitions (discarded 4 similar events)
// Phase 1: matrix 786 rows 574 cols
[2022-06-13 01:45:12] [INFO ] Computed 97 place invariants in 22 ms
[2022-06-13 01:45:12] [INFO ] Dead Transitions using invariants and state equation in 563 ms returned []
Finished structural reductions, in 1 iterations. Remains : 574/574 places, 790/790 transitions.
Incomplete random walk after 100001 steps, including 4723 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-13 01:45:13] [INFO ] Flow matrix only has 786 transitions (discarded 4 similar events)
// Phase 1: matrix 786 rows 574 cols
[2022-06-13 01:45:13] [INFO ] Computed 97 place invariants in 18 ms
[2022-06-13 01:45:13] [INFO ] [Real]Absence check using 91 positive place invariants in 33 ms returned sat
[2022-06-13 01:45:13] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-13 01:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:13] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-06-13 01:45:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:45:13] [INFO ] [Nat]Absence check using 91 positive place invariants in 25 ms returned sat
[2022-06-13 01:45:13] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-13 01:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:16] [INFO ] [Nat]Absence check using state equation in 2494 ms returned sat
[2022-06-13 01:45:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-13 01:45:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2022-06-13 01:45:16] [INFO ] Deduced a trap composed of 204 places in 192 ms of which 0 ms to minimize.
[2022-06-13 01:45:16] [INFO ] Deduced a trap composed of 192 places in 166 ms of which 1 ms to minimize.
[2022-06-13 01:45:16] [INFO ] Deduced a trap composed of 204 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 207 places in 193 ms of which 1 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 207 places in 185 ms of which 6 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 204 places in 176 ms of which 1 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 225 places in 177 ms of which 1 ms to minimize.
[2022-06-13 01:45:17] [INFO ] Deduced a trap composed of 213 places in 178 ms of which 1 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 207 places in 169 ms of which 0 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 207 places in 174 ms of which 0 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 210 places in 180 ms of which 1 ms to minimize.
[2022-06-13 01:45:18] [INFO ] Deduced a trap composed of 198 places in 179 ms of which 1 ms to minimize.
[2022-06-13 01:45:19] [INFO ] Deduced a trap composed of 195 places in 177 ms of which 0 ms to minimize.
[2022-06-13 01:45:33] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2022-06-13 01:45:33] [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 0
[2022-06-13 01:45:33] [INFO ] [Real]Absence check using 91 positive place invariants in 42 ms returned sat
[2022-06-13 01:45:33] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 9 ms returned sat
[2022-06-13 01:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:34] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-06-13 01:45:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:45:34] [INFO ] [Nat]Absence check using 91 positive place invariants in 23 ms returned sat
[2022-06-13 01:45:34] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 11 ms returned sat
[2022-06-13 01:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:45:34] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-06-13 01:45:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-13 01:45:34] [INFO ] Computed and/alt/rep : 405/975/405 causal constraints (skipped 375 transitions) in 59 ms.
[2022-06-13 01:45:35] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 1 ms to minimize.
[2022-06-13 01:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2022-06-13 01:45:35] [INFO ] Added : 30 causal constraints over 7 iterations in 843 ms. Result :sat
[2022-06-13 01:45:35] [INFO ] Flatten gal took : 49 ms
[2022-06-13 01:45:35] [INFO ] Flatten gal took : 42 ms
[2022-06-13 01:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13502938462397426589.gal : 6 ms
[2022-06-13 01:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1425642352947197940.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/ReachabilityCardinality13502938462397426589.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1425642352947197940.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/ReachabilityCardinality13502938462397426589.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1425642352947197940.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1425642352947197940.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 64
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 65
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :65 after 66
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :66 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 81
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :81 after 85
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 93
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :93 after 521
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :521 after 605
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :605 after 734
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :734 after 1019
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1019 after 20431
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :20431 after 27397
Detected timeout of ITS tools.
[2022-06-13 01:45:50] [INFO ] Flatten gal took : 53 ms
[2022-06-13 01:45:50] [INFO ] Applying decomposition
[2022-06-13 01:45:50] [INFO ] Flatten gal took : 43 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/graph16781846306661253985.txt, -o, /tmp/graph16781846306661253985.bin, -w, /tmp/graph16781846306661253985.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/graph16781846306661253985.bin, -l, -1, -v, -w, /tmp/graph16781846306661253985.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:45:50] [INFO ] Decomposing Gal with order
[2022-06-13 01:45:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:45:50] [INFO ] Removed a total of 974 redundant transitions.
[2022-06-13 01:45:50] [INFO ] Flatten gal took : 158 ms
[2022-06-13 01:45:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 43 ms.
[2022-06-13 01:45:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8000467119654200509.gal : 7 ms
[2022-06-13 01:45:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14371701756844036959.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/ReachabilityCardinality8000467119654200509.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14371701756844036959.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/ReachabilityCardinality8000467119654200509.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14371701756844036959.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14371701756844036959.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 32
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :32 after 35
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :35 after 44
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :44 after 293
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :293 after 359
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :359 after 492
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :492 after 737
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :737 after 10561
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10561 after 19462
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :19462 after 35280
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6245223905244634697
[2022-06-13 01:46:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6245223905244634697
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/ltsmin6245223905244634697]
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/ltsmin6245223905244634697] 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/ltsmin6245223905244634697] 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 574 transition count 786
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 574 transition count 785
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 573 transition count 785
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 573 transition count 784
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 572 transition count 784
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 572 transition count 779
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 567 transition count 779
Applied a total of 18 rules in 123 ms. Remains 567 /574 variables (removed 7) and now considering 779/790 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 779 rows 567 cols
[2022-06-13 01:46:07] [INFO ] Computed 97 place invariants in 13 ms
[2022-06-13 01:46:07] [INFO ] [Real]Absence check using 91 positive place invariants in 19 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 7 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:46:07] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-06-13 01:46:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:46:07] [INFO ] [Nat]Absence check using 91 positive place invariants in 24 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-13 01:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:46:08] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 213 places in 167 ms of which 0 ms to minimize.
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 222 places in 168 ms of which 0 ms to minimize.
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:46:08] [INFO ] Deduced a trap composed of 225 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 0 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 192 places in 171 ms of which 2 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 201 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:46:09] [INFO ] Deduced a trap composed of 204 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 1 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 198 places in 173 ms of which 9 ms to minimize.
[2022-06-13 01:46:10] [INFO ] Deduced a trap composed of 207 places in 169 ms of which 1 ms to minimize.
[2022-06-13 01:46:11] [INFO ] Deduced a trap composed of 198 places in 169 ms of which 0 ms to minimize.
[2022-06-13 01:46:11] [INFO ] Deduced a trap composed of 186 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:46:12] [INFO ] Deduced a trap composed of 192 places in 158 ms of which 1 ms to minimize.
[2022-06-13 01:46:52] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2022-06-13 01:46:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 01:46:52] [INFO ] [Real]Absence check using 91 positive place invariants in 22 ms returned sat
[2022-06-13 01:46:52] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 9 ms returned sat
[2022-06-13 01:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:46:53] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-06-13 01:46:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:46:53] [INFO ] [Nat]Absence check using 91 positive place invariants in 22 ms returned sat
[2022-06-13 01:46:53] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 9 ms returned sat
[2022-06-13 01:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:46:53] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-06-13 01:46:53] [INFO ] Computed and/alt/rep : 375/870/375 causal constraints (skipped 374 transitions) in 39 ms.
[2022-06-13 01:46:54] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 0 ms to minimize.
[2022-06-13 01:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 551 ms
[2022-06-13 01:46:54] [INFO ] Added : 27 causal constraints over 6 iterations in 1109 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:46:54] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin146120404326763508
[2022-06-13 01:46:54] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2022-06-13 01:46:54] [INFO ] Applying decomposition
[2022-06-13 01:46:54] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 01:46:54] [INFO ] Flatten gal took : 62 ms
[2022-06-13 01:46:54] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2022-06-13 01:46:54] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 01:46:54] [INFO ] Input system was already deterministic with 790 transitions.
[2022-06-13 01:46:54] [INFO ] Flatten gal took : 87 ms
[2022-06-13 01:46:54] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2022-06-13 01:46:55] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 01:46:55] [INFO ] Built C files in 267ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin146120404326763508
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/ltsmin146120404326763508]
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/graph13685942548161048283.txt, -o, /tmp/graph13685942548161048283.bin, -w, /tmp/graph13685942548161048283.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/graph13685942548161048283.bin, -l, -1, -v, -w, /tmp/graph13685942548161048283.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:46:55] [INFO ] Decomposing Gal with order
[2022-06-13 01:46:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:46:55] [INFO ] Removed a total of 975 redundant transitions.
[2022-06-13 01:46:55] [INFO ] Flatten gal took : 167 ms
[2022-06-13 01:46:55] [INFO ] Ran tautology test, simplified 0 / 2 in 465 ms.
[2022-06-13 01:46:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 16 ms.
[2022-06-13 01:46:55] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(UNSAT) depth K=0 took 29 ms
[2022-06-13 01:46:55] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2022-06-13 01:46:55] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(UNSAT) depth K=1 took 37 ms
[2022-06-13 01:46:55] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(UNSAT) depth K=1 took 2 ms
[2022-06-13 01:46:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4785506644501065620.gal : 12 ms
[2022-06-13 01:46:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3014919390726934569.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/ReachabilityCardinality4785506644501065620.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3014919390726934569.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/ReachabilityCardinality4785506644501065620.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3014919390726934569.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3014919390726934569.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 786 out of 790 initially.
// Phase 1: matrix 786 rows 574 cols
[2022-06-13 01:46:55] [INFO ] Computed 97 place invariants in 38 ms
inv : CreatedJobs_125 + CreatedJobs_126 + CreatedJobs_127 + CreatedJobs_128 + CreatedJobs_129 + AvailableJobId_25 = 1
inv : FetchJobE_0 + QueueJobB_0 + f3_0 + f2_0 + f1_0 + NotifyEventJobQueuedB_0 + AvailableJobId_0 + Perform_Work_B_0 = 1
inv : FetchJobB_0 - 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 - f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f3_21 - f3_22 - f3_23 - f3_24 - f3_25 - f3_26 - f3_27 - f3_28 - f3_29 - f3_30 - f3_31 - f3_32 - f3_33 - f3_34 - f3_35 - f3_36 - f3_37 - f3_38 - f3_39 - f3_40 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f2_21 - f2_22 - f2_23 - f2_24 - f2_25 - f2_26 - f2_27 - f2_28 - f2_29 - f2_30 - f2_31 - f2_32 - f2_33 - f2_34 - f2_35 - f2_36 - f2_37 - f2_38 - f2_39 - f2_40 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - f1_21 - f1_22 - f1_23 - f1_24 - f1_25 - f1_26 - f1_27 - f1_28 - f1_29 - f1_30 - f1_31 - f1_32 - f1_33 - f1_34 - f1_35 - f1_36 - f1_37 - f1_38 - f1_39 - f1_40 - cJobCnt_0 = -10
inv : FetchJobE_2 + QueueJobB_2 + f3_2 + f2_2 + f1_2 + NotifyEventJobQueuedB_2 + AvailableJobId_2 + Perform_Work_B_2 = 1
inv : CreatedJobs_50 + CreatedJobs_51 + CreatedJobs_52 + CreatedJobs_53 + CreatedJobs_54 + AvailableJobId_10 = 1
inv : FetchJobE_1 + QueueJobB_1 + f3_1 + f2_1 + f1_1 + NotifyEventJobQueuedB_1 + AvailableJobId_1 + Perform_Work_B_1 = 1
inv : FetchJobE_4 + QueueJobB_4 + f3_4 + f2_4 + f1_4 + NotifyEventJobQueuedB_4 + AvailableJobId_4 + Perform_Work_B_4 = 1
inv : CreatedJobs_135 + CreatedJobs_136 + CreatedJobs_137 + CreatedJobs_138 + CreatedJobs_139 + AvailableJobId_27 = 1
inv : CreatedJobs_115 + CreatedJobs_116 + CreatedJobs_117 + CreatedJobs_118 + CreatedJobs_119 + AvailableJobId_23 = 1
inv : FetchJobE_3 + QueueJobB_3 + f3_3 + f2_3 + f1_3 + NotifyEventJobQueuedB_3 + AvailableJobId_3 + Perform_Work_B_3 = 1
inv : CreatedJobs_60 + CreatedJobs_61 + CreatedJobs_62 + CreatedJobs_63 + CreatedJobs_64 + AvailableJobId_12 = 1
inv : FetchJobE_6 + QueueJobB_6 + f3_6 + f2_6 + f1_6 + NotifyEventJobQueuedB_6 + AvailableJobId_6 + Perform_Work_B_6 = 1
inv : CreatedJobs_200 + CreatedJobs_201 + CreatedJobs_202 + CreatedJobs_203 + CreatedJobs_204 + AvailableJobId_40 = 1
inv : CreatedJobs_190 + CreatedJobs_191 + CreatedJobs_192 + CreatedJobs_193 + CreatedJobs_194 + AvailableJobId_38 = 1
inv : FetchJobE_5 + QueueJobB_5 + f3_5 + f2_5 + f1_5 + NotifyEventJobQueuedB_5 + AvailableJobId_5 + Perform_Work_B_5 = 1
inv : CreatedJobs_180 + CreatedJobs_181 + CreatedJobs_182 + CreatedJobs_183 + CreatedJobs_184 + AvailableJobId_36 = 1
inv : f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + mo1_0 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - f1_21 - f1_22 - f1_23 - f1_24 - f1_25 - f1_26 - f1_27 - f1_28 - f1_29 - f1_30 - f1_31 - f1_32 - f1_33 - f1_34 - f1_35 - f1_36 - f1_37 - f1_38 - f1_39 - f1_40 - mi1_0 = 0
inv : FetchJobE_9 + QueueJobB_9 + f3_9 + f2_9 + f1_9 + NotifyEventJobQueuedB_9 + AvailableJobId_9 + Perform_Work_B_9 = 1
inv : CreatedJobs_70 + CreatedJobs_71 + CreatedJobs_72 + CreatedJobs_73 + CreatedJobs_74 + AvailableJobId_14 = 1
inv : CreatedJobs_40 + CreatedJobs_41 + CreatedJobs_42 + CreatedJobs_43 + CreatedJobs_44 + AvailableJobId_8 = 1
inv : FetchJobE_7 + QueueJobB_7 + f3_7 + f2_7 + f1_7 + NotifyEventJobQueuedB_7 + AvailableJobId_7 + Perform_Work_B_7 = 1
inv : FetchJobE_11 + QueueJobB_11 + f3_11 + f2_11 + f1_11 + NotifyEventJobQueuedB_11 + AvailableJobId_11 + Perform_Work_B_11 = 1
inv : FetchJobE_17 + QueueJobB_17 + f3_17 + f2_17 + f1_17 + NotifyEventJobQueuedB_17 + AvailableJobId_17 + Perform_Work_B_17 = 1
inv : CreatedJobs_90 + CreatedJobs_91 + CreatedJobs_92 + CreatedJobs_93 + CreatedJobs_94 + AvailableJobId_18 = 1
inv : CreatedJobs_25 + CreatedJobs_26 + CreatedJobs_27 + CreatedJobs_28 + CreatedJobs_29 + AvailableJobId_5 = 1
inv : FetchJobE_13 + QueueJobB_13 + f3_13 + f2_13 + f1_13 + NotifyEventJobQueuedB_13 + AvailableJobId_13 + Perform_Work_B_13 = 1
inv : CreatedJobs_10 + CreatedJobs_11 + CreatedJobs_12 + CreatedJobs_13 + CreatedJobs_14 + AvailableJobId_2 = 1
inv : 12*FetchJobE_0 + 12*FetchJobE_1 + 12*FetchJobE_2 + 12*FetchJobE_3 + 12*FetchJobE_4 + 12*FetchJobE_5 + 12*FetchJobE_6 + 12*FetchJobE_7 + 12*FetchJobE_8 + 12*FetchJobE_9 + 12*FetchJobE_10 + 12*FetchJobE_11 + 12*FetchJobE_12 + 12*FetchJobE_13 + 12*FetchJobE_14 + 12*FetchJobE_15 + 12*FetchJobE_16 + 12*FetchJobE_17 + 12*FetchJobE_18 + 12*FetchJobE_19 + 12*FetchJobE_20 + 12*FetchJobE_21 + 12*FetchJobE_22 + 12*FetchJobE_23 + 12*FetchJobE_24 + 12*FetchJobE_25 + 12*FetchJobE_26 + 12*FetchJobE_27 + 12*FetchJobE_28 + 12*FetchJobE_29 + 12*FetchJobE_30 + 12*FetchJobE_31 + 12*FetchJobE_32 + 12*FetchJobE_33 + 12*FetchJobE_34 + 12*FetchJobE_35 + 12*FetchJobE_36 + 12*FetchJobE_37 + 12*FetchJobE_38 + 12*FetchJobE_39 + 12*FetchJobE_40 + 12*QueueJobB_0 + 12*QueueJobB_1 + 12*QueueJobB_2 + 12*QueueJobB_3 + 12*QueueJobB_4 + 12*QueueJobB_5 + 12*QueueJobB_6 + 12*QueueJobB_7 + 12*QueueJobB_8 + 12*QueueJobB_9 + 12*QueueJobB_10 + 12*QueueJobB_11 + 12*QueueJobB_12 + 12*QueueJobB_13 + 12*QueueJobB_14 + 12*QueueJobB_15 + 12*QueueJobB_16 + 12*QueueJobB_17 + 12*QueueJobB_18 + 12*QueueJobB_19 + 12*QueueJobB_20 + 12*QueueJobB_21 + 12*QueueJobB_22 + 12*QueueJobB_23 + 12*QueueJobB_24 + 12*QueueJobB_25 + 12*QueueJobB_26 + 12*QueueJobB_27 + 12*QueueJobB_28 + 12*QueueJobB_29 + 12*QueueJobB_30 + 12*QueueJobB_31 + 12*QueueJobB_32 + 12*QueueJobB_33 + 12*QueueJobB_34 + 12*QueueJobB_35 + 12*QueueJobB_36 + 12*QueueJobB_37 + 12*QueueJobB_38 + 12*QueueJobB_39 + 12*QueueJobB_40 + 12*f3_0 + 12*f3_1 + 12*f3_2 + 12*f3_3 + 12*f3_4 + 12*f3_5 + 12*f3_6 + 12*f3_7 + 12*f3_8 + 12*f3_9 + 12*f3_10 + 12*f3_11 + 12*f3_12 + 12*f3_13 + 12*f3_14 + 12*f3_15 + 12*f3_16 + 12*f3_17 + 12*f3_18 + 12*f3_19 + 12*f3_20 + 12*f3_21 + 12*f3_22 + 12*f3_23 + 12*f3_24 + 12*f3_25 + 12*f3_26 + 12*f3_27 + 12*f3_28 + 12*f3_29 + 12*f3_30 + 12*f3_31 + 12*f3_32 + 12*f3_33 + 12*f3_34 + 12*f3_35 + 12*f3_36 + 12*f3_37 + 12*f3_38 + 12*f3_39 + 12*f3_40 + 12*f2_0 + 12*f2_1 + 12*f2_2 + 12*f2_3 + 12*f2_4 + 12*f2_5 + 12*f2_6 + 12*f2_7 + 12*f2_8 + 12*f2_9 + 12*f2_10 + 12*f2_11 + 12*f2_12 + 12*f2_13 + 12*f2_14 + 12*f2_15 + 12*f2_16 + 12*f2_17 + 12*f2_18 + 12*f2_19 + 12*f2_20 + 12*f2_21 + 12*f2_22 + 12*f2_23 + 12*f2_24 + 12*f2_25 + 12*f2_26 + 12*f2_27 + 12*f2_28 + 12*f2_29 + 12*f2_30 + 12*f2_31 + 12*f2_32 + 12*f2_33 + 12*f2_34 + 12*f2_35 + 12*f2_36 + 12*f2_37 + 12*f2_38 + 12*f2_39 + 12*f2_40 + 12*f1_0 + 12*f1_1 + 12*f1_2 + 12*f1_3 + 12*f1_4 + 12*f1_5 + 12*f1_6 + 12*f1_7 + 12*f1_8 + 12*f1_9 + 12*f1_10 + 12*f1_11 + 12*f1_12 + 12*f1_13 + 12*f1_14 + 12*f1_15 + 12*f1_16 + 12*f1_17 + 12*f1_18 + 12*f1_19 + 12*f1_20 + 12*f1_21 + 12*f1_22 + 12*f1_23 + 12*f1_24 + 12*f1_25 + 12*f1_26 + 12*f1_27 + 12*f1_28 + 12*f1_29 + 12*f1_30 + 12*f1_31 + 12*f1_32 + 12*f1_33 + 12*f1_34 + 12*f1_35 + 12*f1_36 + 12*f1_37 + 12*f1_38 + 12*f1_39 + 12*f1_40 + 12*NotifyEventEndOfCheckSourcesE_0 + 12*NotifyEventEndOfCheckSourcesB_0 + 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 12*place_518_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 + 12*Check_Sources_E_0 + 12*place_787_0 + 12*Perform_Work_B_0 + 12*Perform_Work_B_1 + 12*Perform_Work_B_2 + 12*Perform_Work_B_3 + 12*Perform_Work_B_4 + 12*Perform_Work_B_5 + 12*Perform_Work_B_6 + 12*Perform_Work_B_7 + 12*Perform_Work_B_8 + 12*Perform_Work_B_9 + 12*Perform_Work_B_10 + 12*Perform_Work_B_11 + 12*Perform_Work_B_12 + 12*Perform_Work_B_13 + 12*Perform_Work_B_14 + 12*Perform_Work_B_15 + 12*Perform_Work_B_16 + 12*Perform_Work_B_17 + 12*Perform_Work_B_18 + 12*Perform_Work_B_19 + 12*Perform_Work_B_20 + 12*Perform_Work_B_21 + 12*Perform_Work_B_22 + 12*Perform_Work_B_23 + 12*Perform_Work_B_24 + 12*Perform_Work_B_25 + 12*Perform_Work_B_26 + 12*Perform_Work_B_27 + 12*Perform_Work_B_28 + 12*Perform_Work_B_29 + 12*Perform_Work_B_30 + 12*Perform_Work_B_31 + 12*Perform_Work_B_32 + 12*Perform_Work_B_33 + 12*Perform_Work_B_34 + 12*Perform_Work_B_35 + 12*Perform_Work_B_36 + 12*Perform_Work_B_37 + 12*Perform_Work_B_38 + 12*Perform_Work_B_39 + 12*Perform_Work_B_40 + 12*Schedule_Task_B_0 + 12*cJobCnt_0 = 132
inv : -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 + QueueJobE_0 - f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f3_21 - f3_22 - f3_23 - f3_24 - f3_25 - f3_26 - f3_27 - f3_28 - f3_29 - f3_30 - f3_31 - f3_32 - f3_33 - f3_34 - f3_35 - f3_36 - f3_37 - f3_38 - f3_39 - f3_40 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f2_21 - f2_22 - f2_23 - f2_24 - f2_25 - f2_26 - f2_27 - f2_28 - f2_29 - f2_30 - f2_31 - f2_32 - f2_33 - f2_34 - f2_35 - f2_36 - f2_37 - f2_38 - f2_39 - f2_40 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - f1_21 - f1_22 - f1_23 - f1_24 - f1_25 - f1_26 - f1_27 - f1_28 - f1_29 - f1_30 - f1_31 - f1_32 - f1_33 - f1_34 - f1_35 - f1_36 - f1_37 - f1_38 - f1_39 - f1_40 + place_482_0 + place_482_1 + place_482_2 + place_482_3 + place_482_4 - place_462_0 - place_460_0 - place_458_0 - place_456_0 - AvailableJobId_0 - AvailableJobId_1 - AvailableJobId_2 - AvailableJobId_3 - AvailableJobId_4 - AvailableJobId_5 - AvailableJobId_6 - AvailableJobId_7 - AvailableJobId_8 - AvailableJobId_9 - AvailableJobId_10 - AvailableJobId_11 - AvailableJobId_12 - AvailableJobId_13 - AvailableJobId_14 - AvailableJobId_15 - AvailableJobId_16 - AvailableJobId_17 - AvailableJobId_18 - AvailableJobId_19 - AvailableJobId_20 - AvailableJobId_21 - AvailableJobId_22 - AvailableJobId_23 - AvailableJobId_24 - AvailableJobId_25 - AvailableJobId_26 - AvailableJobId_27 - AvailableJobId_28 - AvailableJobId_29 - AvailableJobId_30 - AvailableJobId_31 - AvailableJobId_32 - AvailableJobId_33 - AvailableJobId_34 - AvailableJobId_35 - AvailableJobId_36 - AvailableJobId_37 - AvailableJobId_38 - AvailableJobId_39 - AvailableJobId_40 - Perform_Work_B_0 - Perform_Work_B_1 - Perform_Work_B_2 - Perform_Work_B_3 - Perform_Work_B_4 - Perform_Work_B_5 - Perform_Work_B_6 - Perform_Work_B_7 - Perform_Work_B_8 - Perform_Work_B_9 - Perform_Work_B_10 - Perform_Work_B_11 - Perform_Work_B_12 - Perform_Work_B_13 - Perform_Work_B_14 - Perform_Work_B_15 - Perform_Work_B_16 - Perform_Work_B_17 - Perform_Work_B_18 - Perform_Work_B_19 - Perform_Work_B_20 - Perform_Work_B_21 - Perform_Work_B_22 - Perform_Work_B_23 - Perform_Work_B_24 - Perform_Work_B_25 - Perform_Work_B_26 - Perform_Work_B_27 - Perform_Work_B_28 - Perform_Work_B_29 - Perform_Work_B_30 - Perform_Work_B_31 - Perform_Work_B_32 - Perform_Work_B_33 - Perform_Work_B_34 - Perform_Work_B_35 - Perform_Work_B_36 - Perform_Work_B_37 - Perform_Work_B_38 - Perform_Work_B_39 - Perform_Work_B_40 = -41
inv : CreatedJobs_30 + CreatedJobs_31 + CreatedJobs_32 + CreatedJobs_33 + CreatedJobs_34 + AvailableJobId_6 = 1
inv : block_0 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 = 3
inv : CreatedJobs_165 + CreatedJobs_166 + CreatedJobs_167 + CreatedJobs_168 + CreatedJobs_169 + AvailableJobId_33 = 1
inv : CreatedJobs_85 + CreatedJobs_86 + CreatedJobs_87 + CreatedJobs_88 + CreatedJobs_89 + AvailableJobId_17 = 1
inv : -f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f3_21 - f3_22 - f3_23 - f3_24 - f3_25 - f3_26 - f3_27 - f3_28 - f3_29 - f3_30 - f3_31 - f3_32 - f3_33 - f3_34 - f3_35 - f3_36 - f3_37 - f3_38 - f3_39 - f3_40 + mo3_0 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + mi2_0 + mi1_0 = 1
inv : CreatedJobs_145 + CreatedJobs_146 + CreatedJobs_147 + CreatedJobs_148 + CreatedJobs_149 + AvailableJobId_29 = 1
inv : FetchJobE_16 + QueueJobB_16 + f3_16 + f2_16 + f1_16 + NotifyEventJobQueuedB_16 + AvailableJobId_16 + Perform_Work_B_16 = 1
inv : CreatedJobs_170 + CreatedJobs_171 + CreatedJobs_172 + CreatedJobs_173 + CreatedJobs_174 + AvailableJobId_34 = 1
inv : CreatedJobs_150 + CreatedJobs_151 + CreatedJobs_152 + CreatedJobs_153 + CreatedJobs_154 + AvailableJobId_30 = 1
inv : FetchJobE_25 + QueueJobB_25 + f3_25 + f2_25 + f1_25 + NotifyEventJobQueuedB_25 + AvailableJobId_25 + Perform_Work_B_25 = 1
inv : FetchJobE_8 + QueueJobB_8 + f3_8 + f2_8 + f1_8 + NotifyEventJobQueuedB_8 + AvailableJobId_8 + Perform_Work_B_8 = 1
inv : ModifiedSrc_0 - CreatedJobs_1 - CreatedJobs_2 - CreatedJobs_3 - CreatedJobs_4 - CreatedJobs_6 - CreatedJobs_7 - CreatedJobs_8 - CreatedJobs_9 - CreatedJobs_11 - CreatedJobs_12 - CreatedJobs_13 - CreatedJobs_14 - CreatedJobs_16 - CreatedJobs_17 - CreatedJobs_18 - CreatedJobs_19 - CreatedJobs_21 - CreatedJobs_22 - CreatedJobs_23 - CreatedJobs_24 - CreatedJobs_26 - CreatedJobs_27 - CreatedJobs_28 - CreatedJobs_29 - CreatedJobs_31 - CreatedJobs_32 - CreatedJobs_33 - CreatedJobs_34 - CreatedJobs_36 - CreatedJobs_37 - CreatedJobs_38 - CreatedJobs_39 - CreatedJobs_41 - CreatedJobs_42 - CreatedJobs_43 - CreatedJobs_44 - CreatedJobs_46 - CreatedJobs_47 - CreatedJobs_48 - CreatedJobs_49 - CreatedJobs_51 - CreatedJobs_52 - CreatedJobs_53 - CreatedJobs_54 - CreatedJobs_56 - CreatedJobs_57 - CreatedJobs_58 - CreatedJobs_59 - CreatedJobs_61 - CreatedJobs_62 - CreatedJobs_63 - CreatedJobs_64 - CreatedJobs_66 - CreatedJobs_67 - CreatedJobs_68 - CreatedJobs_69 - CreatedJobs_71 - CreatedJobs_72 - CreatedJobs_73 - CreatedJobs_74 - CreatedJobs_76 - CreatedJobs_77 - CreatedJobs_78 - CreatedJobs_79 - CreatedJobs_81 - CreatedJobs_82 - CreatedJobs_83 - CreatedJobs_84 - CreatedJobs_86 - CreatedJobs_87 - CreatedJobs_88 - CreatedJobs_89 - CreatedJobs_91 - CreatedJobs_92 - CreatedJobs_93 - CreatedJobs_94 - CreatedJobs_96 - CreatedJobs_97 - CreatedJobs_98 - CreatedJobs_99 - CreatedJobs_101 - CreatedJobs_102 - CreatedJobs_103 - CreatedJobs_104 - CreatedJobs_106 - CreatedJobs_107 - CreatedJobs_108 - CreatedJobs_109 - CreatedJobs_111 - CreatedJobs_112 - CreatedJobs_113 - CreatedJobs_114 - CreatedJobs_116 - CreatedJobs_117 - CreatedJobs_118 - CreatedJobs_119 - CreatedJobs_121 - CreatedJobs_122 - CreatedJobs_123 - CreatedJobs_124 - CreatedJobs_126 - CreatedJobs_127 - CreatedJobs_128 - CreatedJobs_129 - CreatedJobs_131 - CreatedJobs_132 - CreatedJobs_133 - CreatedJobs_134 - CreatedJobs_136 - CreatedJobs_137 - CreatedJobs_138 - CreatedJobs_139 - CreatedJobs_141 - CreatedJobs_142 - CreatedJobs_143 - CreatedJobs_144 - CreatedJobs_146 - CreatedJobs_147 - CreatedJobs_148 - CreatedJobs_149 - CreatedJobs_151 - CreatedJobs_152 - CreatedJobs_153 - CreatedJobs_154 - CreatedJobs_156 - CreatedJobs_157 - CreatedJobs_158 - CreatedJobs_159 - CreatedJobs_161 - CreatedJobs_162 - CreatedJobs_163 - CreatedJobs_164 - CreatedJobs_166 - CreatedJobs_167 - CreatedJobs_168 - CreatedJobs_169 - CreatedJobs_171 - CreatedJobs_172 - CreatedJobs_173 - CreatedJobs_174 - CreatedJobs_176 - CreatedJobs_177 - CreatedJobs_178 - CreatedJobs_179 - CreatedJobs_181 - CreatedJobs_182 - CreatedJobs_183 - CreatedJobs_184 - CreatedJobs_186 - CreatedJobs_187 - CreatedJobs_188 - CreatedJobs_189 - CreatedJobs_191 - CreatedJobs_192 - CreatedJobs_193 - CreatedJobs_194 - CreatedJobs_196 - CreatedJobs_197 - CreatedJobs_198 - CreatedJobs_199 - CreatedJobs_201 - CreatedJobs_202 - CreatedJobs_203 - CreatedJobs_204 + place_482_0 - AvailableJobId_0 - AvailableJobId_1 - AvailableJobId_2 - AvailableJobId_3 - AvailableJobId_4 - AvailableJobId_5 - AvailableJobId_6 - AvailableJobId_7 - AvailableJobId_8 - AvailableJobId_9 - AvailableJobId_10 - AvailableJobId_11 - AvailableJobId_12 - AvailableJobId_13 - AvailableJobId_14 - AvailableJobId_15 - AvailableJobId_16 - AvailableJobId_17 - AvailableJobId_18 - AvailableJobId_19 - AvailableJobId_20 - AvailableJobId_21 - AvailableJobId_22 - AvailableJobId_23 - AvailableJobId_24 - AvailableJobId_25 - AvailableJobId_26 - AvailableJobId_27 - AvailableJobId_28 - AvailableJobId_29 - AvailableJobId_30 - AvailableJobId_31 - AvailableJobId_32 - AvailableJobId_33 - AvailableJobId_34 - AvailableJobId_35 - AvailableJobId_36 - AvailableJobId_37 - AvailableJobId_38 - AvailableJobId_39 - AvailableJobId_40 + TheSour_0 = -40
inv : CreatedJobs_105 + CreatedJobs_106 + CreatedJobs_107 + CreatedJobs_108 + CreatedJobs_109 + AvailableJobId_21 = 1
inv : CreatedJobs_5 + CreatedJobs_6 + CreatedJobs_7 + CreatedJobs_8 + CreatedJobs_9 + AvailableJobId_1 = 1
inv : 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 12*place_518_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 + 12*Check_Sources_E_0 + 12*CanInjectEvent_0 = 12
inv : mo2_0 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f2_21 - f2_22 - f2_23 - f2_24 - f2_25 - f2_26 - f2_27 - f2_28 - f2_29 - f2_30 - f2_31 - f2_32 - f2_33 - f2_34 - f2_35 - f2_36 - f2_37 - f2_38 - f2_39 - f2_40 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 - mi2_0 = 0
inv : FetchJobE_21 + QueueJobB_21 + f3_21 + f2_21 + f1_21 + NotifyEventJobQueuedB_21 + AvailableJobId_21 + Perform_Work_B_21 = 1
inv : FetchJobE_30 + QueueJobB_30 + f3_30 + f2_30 + f1_30 + NotifyEventJobQueuedB_30 + AvailableJobId_30 + Perform_Work_B_30 = 1
inv : FetchJobE_12 + QueueJobB_12 + f3_12 + f2_12 + f1_12 + NotifyEventJobQueuedB_12 + AvailableJobId_12 + Perform_Work_B_12 = 1
inv : ModifiedSrc_4 + CreatedJobs_4 + CreatedJobs_9 + CreatedJobs_14 + CreatedJobs_19 + CreatedJobs_24 + CreatedJobs_29 + CreatedJobs_34 + CreatedJobs_39 + CreatedJobs_44 + CreatedJobs_49 + CreatedJobs_54 + CreatedJobs_59 + CreatedJobs_64 + CreatedJobs_69 + CreatedJobs_74 + CreatedJobs_79 + CreatedJobs_84 + CreatedJobs_89 + CreatedJobs_94 + CreatedJobs_99 + CreatedJobs_104 + CreatedJobs_109 + CreatedJobs_114 + CreatedJobs_119 + CreatedJobs_124 + CreatedJobs_129 + CreatedJobs_134 + CreatedJobs_139 + CreatedJobs_144 + CreatedJobs_149 + CreatedJobs_154 + CreatedJobs_159 + CreatedJobs_164 + CreatedJobs_169 + CreatedJobs_174 + CreatedJobs_179 + CreatedJobs_184 + CreatedJobs_189 + CreatedJobs_194 + CreatedJobs_199 + CreatedJobs_204 + place_482_4 + TheSour_4 = 1
inv : FetchJobE_34 + QueueJobB_34 + f3_34 + f2_34 + f1_34 + NotifyEventJobQueuedB_34 + AvailableJobId_34 + Perform_Work_B_34 = 1
inv : CreatedJobs_55 + CreatedJobs_56 + CreatedJobs_57 + CreatedJobs_58 + CreatedJobs_59 + AvailableJobId_11 = 1
inv : CreatedJobs_195 + CreatedJobs_196 + CreatedJobs_197 + CreatedJobs_198 + CreatedJobs_199 + AvailableJobId_39 = 1
inv : FetchJobE_36 + QueueJobB_36 + f3_36 + f2_36 + f1_36 + NotifyEventJobQueuedB_36 + AvailableJobId_36 + Perform_Work_B_36 = 1
inv : FetchJobE_35 + QueueJobB_35 + f3_35 + f2_35 + f1_35 + NotifyEventJobQueuedB_35 + AvailableJobId_35 + Perform_Work_B_35 = 1
inv : CreatedJobs_45 + CreatedJobs_46 + CreatedJobs_47 + CreatedJobs_48 + CreatedJobs_49 + AvailableJobId_9 = 1
inv : FetchJobE_39 + QueueJobB_39 + f3_39 + f2_39 + f1_39 + NotifyEventJobQueuedB_39 + AvailableJobId_39 + Perform_Work_B_39 = 1
inv : FetchJobE_29 + QueueJobB_29 + f3_29 + f2_29 + f1_29 + NotifyEventJobQueuedB_29 + AvailableJobId_29 + Perform_Work_B_29 = 1
inv : FetchJobE_37 + QueueJobB_37 + f3_37 + f2_37 + f1_37 + NotifyEventJobQueuedB_37 + AvailableJobId_37 + Perform_Work_B_37 = 1
inv : CreatedJobs_65 + CreatedJobs_66 + CreatedJobs_67 + CreatedJobs_68 + CreatedJobs_69 + AvailableJobId_13 = 1
inv : CreatedJobs_130 + CreatedJobs_131 + CreatedJobs_132 + CreatedJobs_133 + CreatedJobs_134 + AvailableJobId_26 = 1
inv : FetchJobE_28 + QueueJobB_28 + f3_28 + f2_28 + f1_28 + NotifyEventJobQueuedB_28 + AvailableJobId_28 + Perform_Work_B_28 = 1
inv : ModifiedSrc_3 + CreatedJobs_3 + CreatedJobs_8 + CreatedJobs_13 + CreatedJobs_18 + CreatedJobs_23 + CreatedJobs_28 + CreatedJobs_33 + CreatedJobs_38 + CreatedJobs_43 + CreatedJobs_48 + CreatedJobs_53 + CreatedJobs_58 + CreatedJobs_63 + CreatedJobs_68 + CreatedJobs_73 + CreatedJobs_78 + CreatedJobs_83 + CreatedJobs_88 + CreatedJobs_93 + CreatedJobs_98 + CreatedJobs_103 + CreatedJobs_108 + CreatedJobs_113 + CreatedJobs_118 + CreatedJobs_123 + CreatedJobs_128 + CreatedJobs_133 + CreatedJobs_138 + CreatedJobs_143 + CreatedJobs_148 + CreatedJobs_153 + CreatedJobs_158 + CreatedJobs_163 + CreatedJobs_168 + CreatedJobs_173 + CreatedJobs_178 + CreatedJobs_183 + CreatedJobs_188 + CreatedJobs_193 + CreatedJobs_198 + CreatedJobs_203 + place_482_3 + TheSour_3 = 1
inv : CreatedJobs_110 + CreatedJobs_111 + CreatedJobs_112 + CreatedJobs_113 + CreatedJobs_114 + AvailableJobId_22 = 1
inv : CreatedJobs_120 + CreatedJobs_121 + CreatedJobs_122 + CreatedJobs_123 + CreatedJobs_124 + AvailableJobId_24 = 1
inv : CreatedJobs_140 + CreatedJobs_141 + CreatedJobs_142 + CreatedJobs_143 + CreatedJobs_144 + AvailableJobId_28 = 1
inv : CreatedJobs_185 + CreatedJobs_186 + CreatedJobs_187 + CreatedJobs_188 + CreatedJobs_189 + AvailableJobId_37 = 1
inv : FetchJobE_38 + QueueJobB_38 + f3_38 + f2_38 + f1_38 + NotifyEventJobQueuedB_38 + AvailableJobId_38 + Perform_Work_B_38 = 1
inv : FetchJobE_27 + QueueJobB_27 + f3_27 + f2_27 + f1_27 + NotifyEventJobQueuedB_27 + AvailableJobId_27 + Perform_Work_B_27 = 1
inv : FetchJobE_26 + QueueJobB_26 + f3_26 + f2_26 + f1_26 + NotifyEventJobQueuedB_26 + AvailableJobId_26 + Perform_Work_B_26 = 1
inv : JobCnt_0 + cJobCnt_0 = 10
inv : FetchJobE_40 + QueueJobB_40 + f3_40 + f2_40 + f1_40 + NotifyEventJobQueuedB_40 + AvailableJobId_40 + Perform_Work_B_40 = 1
inv : CreatedJobs_0 + CreatedJobs_1 + CreatedJobs_2 + CreatedJobs_3 + CreatedJobs_4 + AvailableJobId_0 = 1
inv : ModifiedSrc_2 + CreatedJobs_2 + CreatedJobs_7 + CreatedJobs_12 + CreatedJobs_17 + CreatedJobs_22 + CreatedJobs_27 + CreatedJobs_32 + CreatedJobs_37 + CreatedJobs_42 + CreatedJobs_47 + CreatedJobs_52 + CreatedJobs_57 + CreatedJobs_62 + CreatedJobs_67 + CreatedJobs_72 + CreatedJobs_77 + CreatedJobs_82 + CreatedJobs_87 + CreatedJobs_92 + CreatedJobs_97 + CreatedJobs_102 + CreatedJobs_107 + CreatedJobs_112 + CreatedJobs_117 + CreatedJobs_122 + CreatedJobs_127 + CreatedJobs_132 + CreatedJobs_137 + CreatedJobs_142 + CreatedJobs_147 + CreatedJobs_152 + CreatedJobs_157 + CreatedJobs_162 + CreatedJobs_167 + CreatedJobs_172 + CreatedJobs_177 + CreatedJobs_182 + CreatedJobs_187 + CreatedJobs_192 + CreatedJobs_197 + CreatedJobs_202 + place_482_2 + TheSour_2 = 1
inv : FetchJobE_24 + QueueJobB_24 + f3_24 + f2_24 + f1_24 + NotifyEventJobQueuedB_24 + AvailableJobId_24 + Perform_Work_B_24 = 1
inv : FetchJobE_22 + QueueJobB_22 + f3_22 + f2_22 + f1_22 + NotifyEventJobQueuedB_22 + AvailableJobId_22 + Perform_Work_B_22 = 1
inv : FetchJobE_31 + QueueJobB_31 + f3_31 + f2_31 + f1_31 + NotifyEventJobQueuedB_31 + AvailableJobId_31 + Perform_Work_B_31 = 1
inv : FetchJobE_20 + QueueJobB_20 + f3_20 + f2_20 + f1_20 + NotifyEventJobQueuedB_20 + AvailableJobId_20 + Perform_Work_B_20 = 1
inv : mi3_0 + mi2_0 + mi1_0 = 1
inv : FetchJobE_33 + QueueJobB_33 + f3_33 + f2_33 + f1_33 + NotifyEventJobQueuedB_33 + AvailableJobId_33 + Perform_Work_B_33 = 1
inv : CreatedJobs_20 + CreatedJobs_21 + CreatedJobs_22 + CreatedJobs_23 + CreatedJobs_24 + AvailableJobId_4 = 1
inv : CreatedJobs_15 + CreatedJobs_16 + CreatedJobs_17 + CreatedJobs_18 + CreatedJobs_19 + AvailableJobId_3 = 1
inv : FetchJobE_19 + QueueJobB_19 + f3_19 + f2_19 + f1_19 + NotifyEventJobQueuedB_19 + AvailableJobId_19 + Perform_Work_B_19 = 1
inv : FetchJobE_18 + QueueJobB_18 + f3_18 + f2_18 + f1_18 + NotifyEventJobQueuedB_18 + AvailableJobId_18 + Perform_Work_B_18 = 1
inv : CreatedJobs_100 + CreatedJobs_101 + CreatedJobs_102 + CreatedJobs_103 + CreatedJobs_104 + AvailableJobId_20 = 1
inv : FetchJobE_14 + QueueJobB_14 + f3_14 + f2_14 + f1_14 + NotifyEventJobQueuedB_14 + AvailableJobId_14 + Perform_Work_B_14 = 1
inv : CreatedJobs_80 + CreatedJobs_81 + CreatedJobs_82 + CreatedJobs_83 + CreatedJobs_84 + AvailableJobId_16 = 1
inv : CreatedJobs_95 + CreatedJobs_96 + CreatedJobs_97 + CreatedJobs_98 + CreatedJobs_99 + AvailableJobId_19 = 1
inv : FetchJobE_15 + QueueJobB_15 + f3_15 + f2_15 + f1_15 + NotifyEventJobQueuedB_15 + AvailableJobId_15 + Perform_Work_B_15 = 1
inv : CreatedJobs_155 + CreatedJobs_156 + CreatedJobs_157 + CreatedJobs_158 + CreatedJobs_159 + AvailableJobId_31 = 1
inv : CreatedJobs_175 + CreatedJobs_176 + CreatedJobs_177 + CreatedJobs_178 + CreatedJobs_179 + AvailableJobId_35 = 1
inv : CreatedJobs_160 + CreatedJobs_161 + CreatedJobs_162 + CreatedJobs_163 + CreatedJobs_164 + AvailableJobId_32 = 1
inv : CreatedJobs_35 + CreatedJobs_36 + CreatedJobs_37 + CreatedJobs_38 + CreatedJobs_39 + AvailableJobId_7 = 1
inv : CreatedJobs_75 + CreatedJobs_76 + CreatedJobs_77 + CreatedJobs_78 + CreatedJobs_79 + AvailableJobId_15 = 1
inv : FetchJobE_23 + QueueJobB_23 + f3_23 + f2_23 + f1_23 + NotifyEventJobQueuedB_23 + AvailableJobId_23 + Perform_Work_B_23 = 1
inv : FetchJobE_32 + QueueJobB_32 + f3_32 + f2_32 + f1_32 + NotifyEventJobQueuedB_32 + AvailableJobId_32 + Perform_Work_B_32 = 1
inv : FetchJobE_10 + QueueJobB_10 + f3_10 + f2_10 + f1_10 + NotifyEventJobQueuedB_10 + AvailableJobId_10 + Perform_Work_B_10 = 1
inv : ModifiedSrc_1 + CreatedJobs_1 + CreatedJobs_6 + CreatedJobs_11 + CreatedJobs_16 + CreatedJobs_21 + CreatedJobs_26 + CreatedJobs_31 + CreatedJobs_36 + CreatedJobs_41 + CreatedJobs_46 + CreatedJobs_51 + CreatedJobs_56 + CreatedJobs_61 + CreatedJobs_66 + CreatedJobs_71 + CreatedJobs_76 + CreatedJobs_81 + CreatedJobs_86 + CreatedJobs_91 + CreatedJobs_96 + CreatedJobs_101 + CreatedJobs_106 + CreatedJobs_111 + CreatedJobs_116 + CreatedJobs_121 + CreatedJobs_126 + CreatedJobs_131 + CreatedJobs_136 + CreatedJobs_141 + CreatedJobs_146 + CreatedJobs_151 + CreatedJobs_156 + CreatedJobs_161 + CreatedJobs_166 + CreatedJobs_171 + CreatedJobs_176 + CreatedJobs_181 + CreatedJobs_186 + CreatedJobs_191 + CreatedJobs_196 + CreatedJobs_201 + place_482_1 + TheSour_1 = 1
Total of 97 invariants.
[2022-06-13 01:46:55] [INFO ] Computed 97 place invariants in 40 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 9
[2022-06-13 01:46:56] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(UNSAT) depth K=2 took 587 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 38
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :38 after 294
[2022-06-13 01:46:56] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(UNSAT) depth K=2 took 289 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :294 after 396
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :396 after 555
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :555 after 918
[2022-06-13 01:46:57] [INFO ] Proved 574 variables to be positive in 1665 ms
[2022-06-13 01:46:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-12
[2022-06-13 01:46:57] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(SAT) depth K=0 took 147 ms
[2022-06-13 01:46:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-13
[2022-06-13 01:46:57] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(SAT) depth K=0 took 102 ms
[2022-06-13 01:46:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-12
[2022-06-13 01:46:58] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(SAT) depth K=1 took 441 ms
[2022-06-13 01:46:58] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(UNSAT) depth K=3 took 2140 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :918 after 1935
[2022-06-13 01:46:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-13
[2022-06-13 01:46:58] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(SAT) depth K=1 took 627 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1935 after 3559
Compilation finished in 7505 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin146120404326763508]
Link finished in 91 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, PolyORBNTCOLS05J40ReachabilityCardinality12==true], workingDir=/tmp/ltsmin146120404326763508]
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3559 after 6036
[2022-06-13 01:48:07] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(UNSAT) depth K=3 took 68798 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6036 after 30068
[2022-06-13 01:50:29] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(UNSAT) depth K=4 took 142058 ms
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :30068 after 131874
[2022-06-13 01:53:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-12
[2022-06-13 01:53:15] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(SAT) depth K=2 took 376637 ms
[2022-06-13 01:53:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-13
[2022-06-13 01:53:29] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(SAT) depth K=2 took 13871 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :131874 after 301966
[2022-06-13 01:58:47] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(UNSAT) depth K=4 took 498217 ms
Detected timeout of ITS tools.
[2022-06-13 02:08:13] [INFO ] Applying decomposition
[2022-06-13 02:08:14] [INFO ] Flatten gal took : 118 ms
[2022-06-13 02:08:14] [INFO ] Decomposing Gal with order
[2022-06-13 02:08:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 02:08:14] [INFO ] Removed a total of 2721 redundant transitions.
[2022-06-13 02:08:14] [INFO ] Flatten gal took : 275 ms
[2022-06-13 02:08:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-06-13 02:08:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1920290212813286006.gal : 42 ms
[2022-06-13 02:08:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8543984527707548774.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/ReachabilityCardinality1920290212813286006.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8543984527707548774.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/ReachabilityCardinality1920290212813286006.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8543984527707548774.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8543984527707548774.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 65
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :65 after 66
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :66 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 81
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :81 after 87
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :87 after 96
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :96 after 475
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :475 after 575
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :575 after 753
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :753 after 1103
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1103 after 19226
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :19226 after 27383
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :27383 after 46983
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :46983 after 1.01899e+06
[2022-06-13 02:14:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-12
[2022-06-13 02:14:39] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(SAT) depth K=3 took 1270022 ms
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.01899e+06 after 3.79832e+06
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, PolyORBNTCOLS05J40ReachabilityCardinality12==true], workingDir=/tmp/ltsmin146120404326763508]
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, PolyORBNTCOLS05J40ReachabilityCardinality13==true], workingDir=/tmp/ltsmin146120404326763508]
[2022-06-13 02:20:55] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-12(UNSAT) depth K=5 took 1328208 ms
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :3.79832e+06 after 1.16272e+07
[2022-06-13 02:28:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J40-ReachabilityCardinality-13
[2022-06-13 02:28:09] [INFO ] KInduction solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(SAT) depth K=3 took 810646 ms
Detected timeout of ITS tools.
[2022-06-13 02:29:33] [INFO ] Flatten gal took : 132 ms
[2022-06-13 02:29:33] [INFO ] Input system was already deterministic with 790 transitions.
[2022-06-13 02:29:33] [INFO ] Transformed 574 places.
[2022-06-13 02:29:33] [INFO ] Transformed 790 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
[2022-06-13 02:30:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5564857214415739731.gal : 5 ms
[2022-06-13 02:30:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15753837986432393176.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/ReachabilityCardinality5564857214415739731.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15753837986432393176.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/ReachabilityCardinality5564857214415739731.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15753837986432393176.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/ReachabilityCardinality15753837986432393176.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 72
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :72 after 157
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :157 after 253
[2022-06-13 02:32:05] [INFO ] BMC solution for property PolyORBNT-COL-S05J40-ReachabilityCardinality-13(UNSAT) depth K=5 took 669452 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :253 after 17512
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.049: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.061: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.061: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.062: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.062: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.077: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.077: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.107: Initializing POR dependencies: labels 792, guards 790
pins2lts-mc-linux64( 3/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 3.889: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 3.989: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.990: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 3.989: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 3.990: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 3.991: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.991: There are 792 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.991: State length is 574, there are 790 groups
pins2lts-mc-linux64( 0/ 8), 3.991: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.991: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.991: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 3.991: Visible groups: 87 / 790, labels: 1 / 792
pins2lts-mc-linux64( 0/ 8), 3.991: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 3.991: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 3.992: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 3.993: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 3.993: "PolyORBNTCOLS05J40ReachabilityCardinality13==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 4.212: ~8 levels ~960 states ~1312 transitions
pins2lts-mc-linux64( 5/ 8), 4.256: ~8 levels ~1920 states ~2296 transitions
pins2lts-mc-linux64( 5/ 8), 4.417: ~10 levels ~3840 states ~10368 transitions
pins2lts-mc-linux64( 5/ 8), 4.699: ~12 levels ~7680 states ~22760 transitions
pins2lts-mc-linux64( 5/ 8), 5.319: ~13 levels ~15360 states ~45000 transitions
pins2lts-mc-linux64( 7/ 8), 7.411: ~5 levels ~30720 states ~166984 transitions
pins2lts-mc-linux64( 7/ 8), 10.696: ~5 levels ~61440 states ~257752 transitions
pins2lts-mc-linux64( 7/ 8), 16.012: ~6 levels ~122880 states ~425832 transitions
pins2lts-mc-linux64( 7/ 8), 22.704: ~7 levels ~245760 states ~654816 transitions
pins2lts-mc-linux64( 7/ 8), 28.546: ~11 levels ~491520 states ~911456 transitions
pins2lts-mc-linux64( 7/ 8), 57.026: ~16 levels ~983040 states ~2142752 transitions
pins2lts-mc-linux64( 7/ 8), 124.255: ~18 levels ~1966080 states ~4361104 transitions
pins2lts-mc-linux64( 7/ 8), 838.491: ~31 levels ~3932160 states ~29562544 transitions
pins2lts-mc-linux64( 1/ 8), 1328.935: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1329.643:
pins2lts-mc-linux64( 0/ 8), 1329.643: mean standard work distribution: 45.7% (states) 14.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1329.643:
pins2lts-mc-linux64( 0/ 8), 1329.643: Explored 3815748 states 67447397 transitions, fanout: 17.676
pins2lts-mc-linux64( 0/ 8), 1329.643: Total exploration time 1325.650 sec (1324.950 sec minimum, 1325.118 sec on average)
pins2lts-mc-linux64( 0/ 8), 1329.643: States per second: 2878, Transitions per second: 50879
pins2lts-mc-linux64( 0/ 8), 1329.643: Ignoring proviso: 21320
pins2lts-mc-linux64( 0/ 8), 1329.643:
pins2lts-mc-linux64( 0/ 8), 1329.643: Queue width: 8B, total height: 19386442, memory: 147.91MB
pins2lts-mc-linux64( 0/ 8), 1329.643: Tree memory: 433.0MB, 19.6 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1329.643: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1329.644: Stored 797 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1329.644: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1329.644: Est. total memory use: 580.9MB (~1171.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, PolyORBNTCOLS05J40ReachabilityCardinality13==true], workingDir=/tmp/ltsmin146120404326763508]
255
java.lang.RuntimeException: Unexpected exception when executing 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, PolyORBNTCOLS05J40ReachabilityCardinality13==true], workingDir=/tmp/ltsmin146120404326763508]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)

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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PolyORBNT-COL-S05J40, 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 r179-tall-165277027100281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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