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-165277026700027.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 Peterson-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 47K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 30 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 388K Apr 30 09:22 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 26K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 193K Apr 30 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 836K Apr 30 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 103K Apr 30 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 480K Apr 30 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068664027

Running Version 0
[2022-06-12 21:17:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-12 21:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:17:45] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-06-12 21:17:45] [INFO ] Transformed 480 places.
[2022-06-12 21:17:45] [INFO ] Transformed 690 transitions.
[2022-06-12 21:17:45] [INFO ] Found NUPN structural information;
[2022-06-12 21:17:45] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2022-06-12 21:17:45] [INFO ] Parsed PT model containing 480 places and 690 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 114 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 16) seen :6
FORMULA Peterson-PT-4-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-12 21:17:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:17:47] [INFO ] Computed 19 place invariants in 19 ms
[2022-06-12 21:17:47] [INFO ] [Real]Absence check using 14 positive place invariants in 44 ms returned sat
[2022-06-12 21:17:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2022-06-12 21:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:48] [INFO ] [Real]Absence check using state equation in 1305 ms returned sat
[2022-06-12 21:17:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2022-06-12 21:17:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2022-06-12 21:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:49] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2022-06-12 21:17:49] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:17:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2022-06-12 21:17:50] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
[2022-06-12 21:17:50] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 1 ms to minimize.
[2022-06-12 21:17:50] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:17:50] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 16 ms to minimize.
[2022-06-12 21:17:50] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 14 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2022-06-12 21:17:51] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 3 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:17:52] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2022-06-12 21:17:53] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:17:53] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:17:53] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:17:53] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2022-06-12 21:17:53] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:17:53] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 0 ms to minimize.
[2022-06-12 21:17:54] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:17:54] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2022-06-12 21:17:54] [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-12 21:17:54] [INFO ] [Real]Absence check using 14 positive place invariants in 61 ms returned sat
[2022-06-12 21:17:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 22 ms returned sat
[2022-06-12 21:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:56] [INFO ] [Real]Absence check using state equation in 2301 ms returned sat
[2022-06-12 21:17:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 43 ms returned sat
[2022-06-12 21:17:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 24 ms returned sat
[2022-06-12 21:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:58] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2022-06-12 21:17:58] [INFO ] [Nat]Added 132 Read/Feed constraints in 37 ms returned sat
[2022-06-12 21:17:58] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:17:58] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:17:58] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2022-06-12 21:17:58] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2661 ms
[2022-06-12 21:18:00] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
[2022-06-12 21:18:01] [INFO ] Added : 60 causal constraints over 12 iterations in 858 ms. Result :unknown
[2022-06-12 21:18:01] [INFO ] [Real]Absence check using 14 positive place invariants in 42 ms returned sat
[2022-06-12 21:18:01] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2022-06-12 21:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:02] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2022-06-12 21:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2022-06-12 21:18:03] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2022-06-12 21:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:04] [INFO ] [Nat]Absence check using state equation in 978 ms returned sat
[2022-06-12 21:18:04] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1944 ms
[2022-06-12 21:18:06] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
[2022-06-12 21:18:07] [INFO ] Added : 190 causal constraints over 38 iterations in 1936 ms. Result :unknown
[2022-06-12 21:18:08] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2022-06-12 21:18:08] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:08] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-06-12 21:18:08] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2022-06-12 21:18:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:18:08] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-12 21:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:08] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2022-06-12 21:18:08] [INFO ] [Nat]Added 132 Read/Feed constraints in 28 ms returned sat
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 0 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 5 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4178 ms
[2022-06-12 21:18:12] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2022-06-12 21:18:13] [INFO ] Added : 65 causal constraints over 13 iterations in 519 ms. Result :unknown
[2022-06-12 21:18:13] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:18:13] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:13] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-06-12 21:18:13] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2022-06-12 21:18:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:18:13] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:18:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:13] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-06-12 21:18:14] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 1 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 0 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 0 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 1 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 1 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 0 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 0 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4409 ms
[2022-06-12 21:18:18] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 41 ms.
[2022-06-12 21:18:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
[2022-06-12 21:18:18] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:18:18] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:19] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2022-06-12 21:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:19] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:18:19] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:18:19] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1084 ms
[2022-06-12 21:18:20] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 37 ms.
[2022-06-12 21:18:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
[2022-06-12 21:18:24] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:18:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:24] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-06-12 21:18:24] [INFO ] [Real]Added 132 Read/Feed constraints in 30 ms returned sat
[2022-06-12 21:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:18:24] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-06-12 21:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:24] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-06-12 21:18:24] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 1 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:18:28] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:18:28] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:18:28] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3319 ms
[2022-06-12 21:18:28] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 37 ms.
[2022-06-12 21:18:29] [INFO ] Added : 165 causal constraints over 33 iterations in 1382 ms. Result :unknown
[2022-06-12 21:18:29] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:18:29] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-12 21:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:29] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2022-06-12 21:18:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned unsat
[2022-06-12 21:18:30] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-06-12 21:18:30] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-06-12 21:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:30] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-06-12 21:18:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:18:30] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:30] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2022-06-12 21:18:30] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:18:30] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:18:30] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1242 ms
[2022-06-12 21:18:32] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 37 ms.
[2022-06-12 21:18:35] [INFO ] Added : 385 causal constraints over 77 iterations in 3457 ms. Result :unknown
[2022-06-12 21:18:35] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:35] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2022-06-12 21:18:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:35] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2830 ms
[2022-06-12 21:18:38] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 26 ms.
[2022-06-12 21:18:40] [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 9
FORMULA Peterson-PT-4-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 198100 steps, including 1000 resets, run finished after 1486 ms. (steps per millisecond=133 ) properties (out of 9) seen :3 could not realise parikh vector
FORMULA Peterson-PT-4-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 231600 steps, including 1000 resets, run finished after 1713 ms. (steps per millisecond=135 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA Peterson-PT-4-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 196200 steps, including 1000 resets, run finished after 1425 ms. (steps per millisecond=137 ) properties (out of 5) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 139700 steps, including 1000 resets, run finished after 949 ms. (steps per millisecond=147 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 26 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
[2022-06-12 21:18:46] [INFO ] Flatten gal took : 74 ms
[2022-06-12 21:18:46] [INFO ] Flatten gal took : 40 ms
[2022-06-12 21:18:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15127438299449818999.gal : 17 ms
[2022-06-12 21:18:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11531279090987142859.prop : 11 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/ReachabilityCardinality15127438299449818999.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11531279090987142859.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/ReachabilityCardinality15127438299449818999.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11531279090987142859.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11531279090987142859.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :11 after 33
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :33 after 51
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :51 after 156
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :156 after 247
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :247 after 1253
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1253 after 4497
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :4497 after 8990
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :8990 after 50849
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :50849 after 185355
Detected timeout of ITS tools.
[2022-06-12 21:19:01] [INFO ] Flatten gal took : 44 ms
[2022-06-12 21:19:01] [INFO ] Applying decomposition
[2022-06-12 21:19:01] [INFO ] Flatten gal took : 44 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/graph17301202812906016295.txt, -o, /tmp/graph17301202812906016295.bin, -w, /tmp/graph17301202812906016295.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/graph17301202812906016295.bin, -l, -1, -v, -w, /tmp/graph17301202812906016295.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:19:02] [INFO ] Decomposing Gal with order
[2022-06-12 21:19:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:19:02] [INFO ] Removed a total of 487 redundant transitions.
[2022-06-12 21:19:02] [INFO ] Flatten gal took : 127 ms
[2022-06-12 21:19:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 20 ms.
[2022-06-12 21:19:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1576486117943481073.gal : 9 ms
[2022-06-12 21:19:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18002608027872973262.prop : 14 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/ReachabilityCardinality1576486117943481073.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18002608027872973262.prop, --nowitness], 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/ReachabilityCardinality1576486117943481073.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18002608027872973262.prop --nowitness
Loading property file /tmp/ReachabilityCardinality18002608027872973262.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :8 after 26
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :26 after 32
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :32 after 64
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :64 after 1753
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3506811051703764497
[2022-06-12 21:19:17] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3506811051703764497
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/ltsmin3506811051703764497]
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/ltsmin3506811051703764497] 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/ltsmin3506811051703764497] 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 2 resets, run finished after 7602 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 72300 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=14 ) properties seen :{}
Interrupted Best-First random walk after 188214 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=37 ) properties seen :{}
Interrupted Best-First random walk after 608191 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1437 ms. (steps per millisecond=695 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 6989556 steps, run timeout after 30001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 6989556 steps, saw 1200595 distinct states, run finished after 30001 ms. (steps per millisecond=232 ) properties seen :{}
Running SMT prover for 5 properties.
[2022-06-12 21:20:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:20:14] [INFO ] Computed 19 place invariants in 18 ms
[2022-06-12 21:20:14] [INFO ] [Real]Absence check using 14 positive place invariants in 57 ms returned sat
[2022-06-12 21:20:14] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 21 ms returned sat
[2022-06-12 21:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:17] [INFO ] [Real]Absence check using state equation in 2244 ms returned sat
[2022-06-12 21:20:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 47 ms returned sat
[2022-06-12 21:20:17] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 23 ms returned sat
[2022-06-12 21:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:18] [INFO ] [Nat]Absence check using state equation in 1230 ms returned sat
[2022-06-12 21:20:18] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:20:18] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2022-06-12 21:20:18] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2022-06-12 21:20:18] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:20:19] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:20:19] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:20:19] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:20:19] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:20:19] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:20:19] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:20:19] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 3 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:20:20] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2443 ms
[2022-06-12 21:20:20] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 30 ms.
[2022-06-12 21:20:29] [INFO ] Added : 588 causal constraints over 118 iterations in 8933 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-12 21:20:30] [INFO ] [Real]Absence check using 14 positive place invariants in 41 ms returned sat
[2022-06-12 21:20:30] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 18 ms returned sat
[2022-06-12 21:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:31] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2022-06-12 21:20:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2022-06-12 21:20:31] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2022-06-12 21:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:32] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2022-06-12 21:20:32] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2022-06-12 21:20:32] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:20:32] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:20:32] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:20:32] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:20:32] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:20:33] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 4 ms to minimize.
[2022-06-12 21:20:33] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:20:33] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:20:33] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:20:33] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:20:33] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:20:33] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:20:34] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:20:34] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:20:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1941 ms
[2022-06-12 21:20:34] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 25 ms.
[2022-06-12 21:20:40] [INFO ] Added : 583 causal constraints over 117 iterations in 6390 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-12 21:20:40] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-06-12 21:20:40] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:41] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-06-12 21:20:41] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2022-06-12 21:20:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-06-12 21:20:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:41] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2022-06-12 21:20:41] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2022-06-12 21:20:41] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:20:41] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:20:41] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:20:41] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:20:42] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:20:42] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:20:42] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:20:42] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:20:42] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:20:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 994 ms
[2022-06-12 21:20:42] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 30 ms.
[2022-06-12 21:20:46] [INFO ] Added : 495 causal constraints over 100 iterations in 4307 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 21:20:46] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:20:46] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:47] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-06-12 21:20:47] [INFO ] [Real]Added 132 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:20:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:20:47] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:47] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-06-12 21:20:47] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3013 ms
[2022-06-12 21:20:50] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2022-06-12 21:20:54] [INFO ] Added : 466 causal constraints over 94 iterations in 4121 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 21:20:54] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:20:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:54] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-12 21:20:54] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2022-06-12 21:20:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:20:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:55] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-06-12 21:20:55] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 0 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 4 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:20:58] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2863 ms
[2022-06-12 21:20:58] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 30 ms.
[2022-06-12 21:21:02] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:21:02] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:21:05] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:21:05] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:21:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3284 ms
[2022-06-12 21:21:06] [INFO ] Added : 537 causal constraints over 109 iterations in 8089 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 249000 steps, including 1000 resets, run finished after 2121 ms. (steps per millisecond=117 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 266400 steps, including 1000 resets, run finished after 2198 ms. (steps per millisecond=121 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 157900 steps, including 1000 resets, run finished after 1304 ms. (steps per millisecond=121 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 111100 steps, including 1000 resets, run finished after 866 ms. (steps per millisecond=128 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 161100 steps, including 1000 resets, run finished after 1393 ms. (steps per millisecond=115 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 15 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 16 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-06-12 21:21:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:21:14] [INFO ] Computed 19 place invariants in 3 ms
[2022-06-12 21:21:14] [INFO ] Implicit Places using invariants in 79 ms returned []
[2022-06-12 21:21:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:21:14] [INFO ] Computed 19 place invariants in 3 ms
[2022-06-12 21:21:14] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:21:14] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2022-06-12 21:21:14] [INFO ] Redundant transitions in 43 ms returned []
[2022-06-12 21:21:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:21:14] [INFO ] Computed 19 place invariants in 14 ms
[2022-06-12 21:21:14] [INFO ] Dead Transitions using invariants and state equation in 285 ms returned []
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-12 21:21:15] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:21:15] [INFO ] Computed 19 place invariants in 9 ms
[2022-06-12 21:21:15] [INFO ] [Real]Absence check using 14 positive place invariants in 61 ms returned sat
[2022-06-12 21:21:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 22 ms returned sat
[2022-06-12 21:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:18] [INFO ] [Real]Absence check using state equation in 2312 ms returned sat
[2022-06-12 21:21:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 43 ms returned sat
[2022-06-12 21:21:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 17 ms returned sat
[2022-06-12 21:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:19] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2022-06-12 21:21:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:21:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2022-06-12 21:21:19] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2022-06-12 21:21:19] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:21:20] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2022-06-12 21:21:20] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:21:20] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:21:20] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2022-06-12 21:21:20] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:21:20] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:21:21] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:21:21] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:21:21] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:21:21] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:21:21] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:21:21] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:21:21] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:21:22] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:21:22] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2492 ms
[2022-06-12 21:21:22] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
[2022-06-12 21:21:31] [INFO ] Added : 588 causal constraints over 118 iterations in 9068 ms. Result :sat
[2022-06-12 21:21:31] [INFO ] [Real]Absence check using 14 positive place invariants in 41 ms returned sat
[2022-06-12 21:21:31] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 21 ms returned sat
[2022-06-12 21:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:32] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2022-06-12 21:21:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2022-06-12 21:21:32] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 14 ms returned sat
[2022-06-12 21:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:33] [INFO ] [Nat]Absence check using state equation in 986 ms returned sat
[2022-06-12 21:21:33] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2022-06-12 21:21:33] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:21:33] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:21:33] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1984 ms
[2022-06-12 21:21:35] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2022-06-12 21:21:42] [INFO ] Added : 583 causal constraints over 117 iterations in 6590 ms. Result :sat
[2022-06-12 21:21:42] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:42] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2022-06-12 21:21:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:42] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:21:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1030 ms
[2022-06-12 21:21:43] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 29 ms.
[2022-06-12 21:21:48] [INFO ] Added : 495 causal constraints over 100 iterations in 4432 ms. Result :sat
[2022-06-12 21:21:48] [INFO ] [Real]Absence check using 14 positive place invariants in 51 ms returned sat
[2022-06-12 21:21:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-06-12 21:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:48] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-06-12 21:21:48] [INFO ] [Real]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:21:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:49] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-06-12 21:21:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:21:50] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:21:50] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:21:50] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:21:50] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:21:50] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:21:50] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:21:50] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 4 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:21:52] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:21:52] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3084 ms
[2022-06-12 21:21:52] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 27 ms.
[2022-06-12 21:21:56] [INFO ] Added : 466 causal constraints over 94 iterations in 4219 ms. Result :sat
[2022-06-12 21:21:56] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:21:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:56] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-06-12 21:21:56] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2022-06-12 21:21:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:21:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:56] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-12 21:21:56] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 1 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:21:59] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2895 ms
[2022-06-12 21:21:59] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 30 ms.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 107 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:07] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:22:07] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:22:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3293 ms
[2022-06-12 21:22:07] [INFO ] Added : 537 causal constraints over 109 iterations in 8163 ms. Result :sat
[2022-06-12 21:22:07] [INFO ] Flatten gal took : 34 ms
[2022-06-12 21:22:08] [INFO ] Flatten gal took : 25 ms
[2022-06-12 21:22:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1653866476035083641.gal : 3 ms
[2022-06-12 21:22:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4364589307758186222.prop : 5 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/ReachabilityCardinality1653866476035083641.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4364589307758186222.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/ReachabilityCardinality1653866476035083641.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4364589307758186222.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4364589307758186222.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :11 after 33
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :33 after 51
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :51 after 156
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :156 after 247
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :247 after 1253
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1253 after 4497
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :4497 after 8990
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :8990 after 50849
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :50849 after 185355
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :185355 after 447551
Detected timeout of ITS tools.
[2022-06-12 21:22:23] [INFO ] Flatten gal took : 24 ms
[2022-06-12 21:22:23] [INFO ] Applying decomposition
[2022-06-12 21:22:23] [INFO ] Flatten gal took : 24 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/graph7683702367276252611.txt, -o, /tmp/graph7683702367276252611.bin, -w, /tmp/graph7683702367276252611.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/graph7683702367276252611.bin, -l, -1, -v, -w, /tmp/graph7683702367276252611.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:22:23] [INFO ] Decomposing Gal with order
[2022-06-12 21:22:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:22:23] [INFO ] Removed a total of 513 redundant transitions.
[2022-06-12 21:22:23] [INFO ] Flatten gal took : 50 ms
[2022-06-12 21:22:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2022-06-12 21:22:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18006087181656590267.gal : 13 ms
[2022-06-12 21:22:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3757937475116666381.prop : 6 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/ReachabilityCardinality18006087181656590267.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3757937475116666381.prop, --nowitness], 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/ReachabilityCardinality18006087181656590267.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3757937475116666381.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3757937475116666381.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 684
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :684 after 2610
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :2610 after 31362
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7135617661497259193
[2022-06-12 21:22:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7135617661497259193
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/ltsmin7135617661497259193]
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/ltsmin7135617661497259193] 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/ltsmin7135617661497259193] 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 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 480 transition count 630
Applied a total of 60 rules in 21 ms. Remains 480 /480 variables (removed 0) and now considering 630/690 (removed 60) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:22:39] [INFO ] Computed 19 place invariants in 3 ms
[2022-06-12 21:22:39] [INFO ] [Real]Absence check using 14 positive place invariants in 81 ms returned sat
[2022-06-12 21:22:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 23 ms returned sat
[2022-06-12 21:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:42] [INFO ] [Real]Absence check using state equation in 2384 ms returned sat
[2022-06-12 21:22:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 43 ms returned sat
[2022-06-12 21:22:42] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 17 ms returned sat
[2022-06-12 21:22:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:43] [INFO ] [Nat]Absence check using state equation in 1324 ms returned sat
[2022-06-12 21:22:43] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 29 ms.
[2022-06-12 21:22:50] [INFO ] Added : 624 causal constraints over 125 iterations in 6876 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-12 21:22:50] [INFO ] [Real]Absence check using 14 positive place invariants in 41 ms returned sat
[2022-06-12 21:22:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2022-06-12 21:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:51] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2022-06-12 21:22:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2022-06-12 21:22:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2022-06-12 21:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:53] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2022-06-12 21:22:53] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 27 ms.
[2022-06-12 21:22:59] [INFO ] Added : 617 causal constraints over 124 iterations in 6307 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-12 21:22:59] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-06-12 21:22:59] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:59] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2022-06-12 21:22:59] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 29 ms.
[2022-06-12 21:23:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-06-12 21:23:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:00] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-06-12 21:23:00] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 33 ms.
[2022-06-12 21:23:05] [INFO ] Added : 608 causal constraints over 122 iterations in 5458 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-12 21:23:06] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:23:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:06] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-06-12 21:23:06] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 31 ms.
[2022-06-12 21:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-06-12 21:23:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:06] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2022-06-12 21:23:06] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 30 ms.
[2022-06-12 21:23:11] [INFO ] Added : 611 causal constraints over 123 iterations in 5243 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-12 21:23:12] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:23:12] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:12] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-12 21:23:12] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 30 ms.
[2022-06-12 21:23:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:23:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:12] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-12 21:23:12] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 28 ms.
[2022-06-12 21:23:17] [INFO ] Added : 616 causal constraints over 124 iterations in 5278 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-12 21:23:18] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2663565350682919758
[2022-06-12 21:23:18] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2022-06-12 21:23:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:23:18] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2022-06-12 21:23:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:23:18] [INFO ] Applying decomposition
[2022-06-12 21:23:18] [INFO ] Flatten gal took : 39 ms
[2022-06-12 21:23:18] [INFO ] Flatten gal took : 100 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/graph4626839566845939419.txt, -o, /tmp/graph4626839566845939419.bin, -w, /tmp/graph4626839566845939419.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/graph4626839566845939419.bin, -l, -1, -v, -w, /tmp/graph4626839566845939419.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:23:18] [INFO ] Decomposing Gal with order
[2022-06-12 21:23:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:23:18] [INFO ] Input system was already deterministic with 690 transitions.
[2022-06-12 21:23:18] [INFO ] Removed a total of 500 redundant transitions.
[2022-06-12 21:23:18] [INFO ] Flatten gal took : 90 ms
[2022-06-12 21:23:18] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2022-06-12 21:23:18] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:23:18] [INFO ] Built C files in 616ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2663565350682919758
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/ltsmin2663565350682919758]
[2022-06-12 21:23:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2022-06-12 21:23:18] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12810644058795630187.gal : 4 ms
[2022-06-12 21:23:18] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12212994392683713141.prop : 6 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/ReachabilityFireability12810644058795630187.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability12212994392683713141.prop, --nowitness], 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/ReachabilityFireability12810644058795630187.gal -t CGAL -reachable-file /tmp/ReachabilityFireability12212994392683713141.prop --nowitness
Loading property file /tmp/ReachabilityFireability12212994392683713141.prop.
[2022-06-12 21:23:19] [INFO ] Ran tautology test, simplified 0 / 5 in 942 ms.
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-03(UNSAT) depth K=0 took 118 ms
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-04(UNSAT) depth K=0 took 9 ms
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-07(UNSAT) depth K=0 took 3 ms
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-08(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-15(UNSAT) depth K=0 took 1 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 13
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-03(UNSAT) depth K=1 took 133 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:23:19] [INFO ] Computed 19 place invariants in 3 ms
inv : Turn_2_2 + Turn_2_3 + Turn_2_0 + Turn_2_1 + Turn_2_4 = 1
inv : WantSection_1_F - Idle_1 = 0
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_2_2 + IsEndLoop_3_3_2 + IsEndLoop_3_1_3 + IsEndLoop_3_0_3 + IsEndLoop_3_2_3 + IsEndLoop_3_0_4 + IsEndLoop_3_3_3 + IsEndLoop_3_1_4 + IsEndLoop_3_3_4 + IsEndLoop_3_2_4 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_3_2 + BeginLoop_3_0_0 + EndTurn_3_3 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_1_0 + BeginLoop_3_2_1 + BeginLoop_3_0_1 + BeginLoop_3_1_1 + BeginLoop_3_1_2 + BeginLoop_3_3_1 + BeginLoop_3_0_2 + BeginLoop_3_0_3 + BeginLoop_3_1_3 + BeginLoop_3_2_2 + BeginLoop_3_3_2 + BeginLoop_3_0_4 + BeginLoop_3_3_3 + BeginLoop_3_2_3 + BeginLoop_3_3_4 + BeginLoop_3_2_4 + BeginLoop_3_1_4 + TestAlone_3_1_0 + TestAlone_3_0_0 + TestAlone_3_1_1 + TestAlone_3_0_1 + TestAlone_3_3_0 + TestAlone_3_2_0 + TestAlone_3_2_2 + TestAlone_3_3_2 + TestAlone_3_2_1 + TestAlone_3_3_1 + TestAlone_3_0_2 + TestAlone_3_1_2 + TestAlone_3_1_4 + TestAlone_3_2_4 + TestAlone_3_3_4 + TestTurn_3_0 + TestAlone_3_0_4 + TestIdentity_3_1_0 + TestIdentity_3_0_0 + TestIdentity_3_3_0 + TestIdentity_3_2_0 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_3 + TestIdentity_3_3_1 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_0_1 + TestIdentity_3_2_1 + TestIdentity_3_1_1 + TestIdentity_3_3_3 + TestIdentity_3_1_3 + TestIdentity_3_2_3 + TestIdentity_3_0_3 + TestIdentity_3_2_2 + TestIdentity_3_3_2 + TestIdentity_3_2_4 + TestIdentity_3_3_4 + TestIdentity_3_0_4 + TestIdentity_3_1_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + Idle_3 + CS_3 = 1
inv : WantSection_4_T + Idle_4 = 1
inv : WantSection_0_T + Idle_0 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_2_2 + IsEndLoop_2_3_2 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_3_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_3_4 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_2_2 + BeginLoop_2_0_0 + EndTurn_2_3 + BeginLoop_2_3_0 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_0_1 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_2_2 + BeginLoop_2_3_1 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_1_3 + BeginLoop_2_3_2 + BeginLoop_2_0_4 + BeginLoop_2_3_3 + BeginLoop_2_2_3 + BeginLoop_2_3_4 + BeginLoop_2_2_4 + BeginLoop_2_1_4 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_1_1 + TestAlone_2_0_1 + TestAlone_2_3_0 + TestAlone_2_2_0 + TestAlone_2_0_3 + TestAlone_2_1_3 + TestAlone_2_2_1 + TestAlone_2_3_1 + TestAlone_2_2_4 + TestAlone_2_3_4 + TestTurn_2_0 + TestAlone_2_2_3 + TestAlone_2_3_3 + TestAlone_2_0_4 + TestAlone_2_1_4 + TestIdentity_2_1_0 + TestIdentity_2_3_0 + TestIdentity_2_2_0 + TestTurn_2_2 + TestTurn_2_1 + TestIdentity_2_0_0 + TestTurn_2_3 + TestIdentity_2_0_2 + TestIdentity_2_3_1 + TestIdentity_2_1_2 + TestIdentity_2_0_1 + TestIdentity_2_2_1 + TestIdentity_2_1_1 + TestIdentity_2_3_3 + TestIdentity_2_0_4 + TestIdentity_2_1_3 + TestIdentity_2_2_3 + TestIdentity_2_0_3 + TestIdentity_2_2_2 + TestIdentity_2_3_2 + TestIdentity_2_2_4 + TestIdentity_2_3_4 + TestIdentity_2_1_4 + AskForSection_2_3 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + Idle_2 + CS_2 = 1
inv : WantSection_3_F - Idle_3 = 0
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_3_2 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_0_4 + IsEndLoop_4_3_3 + IsEndLoop_4_1_4 + IsEndLoop_4_3_4 + IsEndLoop_4_2_4 + EndTurn_4_0 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_0_0 + EndTurn_4_3 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_1_0 + BeginLoop_4_1_1 + BeginLoop_4_2_1 + BeginLoop_4_0_1 + BeginLoop_4_1_2 + BeginLoop_4_3_1 + BeginLoop_4_0_2 + BeginLoop_4_0_3 + BeginLoop_4_2_2 + BeginLoop_4_3_2 + BeginLoop_4_0_4 + BeginLoop_4_3_3 + BeginLoop_4_2_3 + BeginLoop_4_1_3 + BeginLoop_4_3_4 + BeginLoop_4_2_4 + BeginLoop_4_1_4 + TestAlone_4_0_0 + TestAlone_4_0_1 + TestAlone_4_3_0 + TestAlone_4_2_0 + TestAlone_4_1_0 + TestAlone_4_1_2 + TestAlone_4_2_2 + TestAlone_4_3_2 + TestAlone_4_0_3 + TestAlone_4_1_1 + TestAlone_4_2_1 + TestAlone_4_3_1 + TestAlone_4_0_2 + TestTurn_4_0 + TestAlone_4_1_3 + TestAlone_4_2_3 + TestAlone_4_3_3 + TestIdentity_4_1_0 + TestIdentity_4_0_0 + TestIdentity_4_2_0 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_3 + TestIdentity_4_3_1 + TestIdentity_4_1_2 + TestIdentity_4_0_2 + TestIdentity_4_0_1 + TestIdentity_4_3_0 + TestIdentity_4_2_1 + TestIdentity_4_1_1 + TestIdentity_4_3_3 + TestIdentity_4_1_3 + TestIdentity_4_2_3 + TestIdentity_4_3_2 + TestIdentity_4_0_3 + TestIdentity_4_2_2 + TestIdentity_4_3_4 + TestIdentity_4_2_4 + TestIdentity_4_0_4 + TestIdentity_4_1_4 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_1 + AskForSection_4_0 + Idle_4 + CS_4 = 1
inv : Turn_1_2 + Turn_1_3 + Turn_1_0 + Turn_1_1 + Turn_1_4 = 1
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_3_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_4 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + EndTurn_0_0 + IsEndLoop_0_3_4 + EndTurn_0_1 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_0_0 + BeginLoop_0_3_0 + BeginLoop_0_0_1 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_2_1 + BeginLoop_0_3_1 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_0_2_2 + BeginLoop_0_0_2 + BeginLoop_0_1_3 + BeginLoop_0_3_2 + BeginLoop_0_0_3 + BeginLoop_0_0_4 + BeginLoop_0_3_3 + BeginLoop_0_2_3 + BeginLoop_0_3_4 + BeginLoop_0_2_4 + BeginLoop_0_1_4 + TestAlone_0_1_1 + TestAlone_0_0_1 + TestAlone_0_2_2 + TestAlone_0_3_2 + TestAlone_0_0_3 + TestAlone_0_1_3 + TestAlone_0_2_1 + TestAlone_0_3_1 + TestAlone_0_0_2 + TestAlone_0_1_2 + TestAlone_0_2_4 + TestAlone_0_3_4 + TestTurn_0_0 + TestTurn_0_1 + TestAlone_0_2_3 + TestAlone_0_3_3 + TestAlone_0_0_4 + TestAlone_0_1_4 + TestIdentity_0_2_0 + TestIdentity_0_1_0 + TestIdentity_0_3_0 + TestTurn_0_2 + TestIdentity_0_0_0 + TestTurn_0_3 + TestIdentity_0_0_2 + TestIdentity_0_3_1 + TestIdentity_0_2_2 + TestIdentity_0_1_2 + TestIdentity_0_1_1 + TestIdentity_0_0_1 + TestIdentity_0_2_1 + TestIdentity_0_3_3 + TestIdentity_0_0_4 + TestIdentity_0_2_3 + TestIdentity_0_0_3 + TestIdentity_0_1_3 + TestIdentity_0_3_2 + TestIdentity_0_3_4 + TestIdentity_0_1_4 + TestIdentity_0_2_4 + CS_0 + AskForSection_0_3 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + Idle_0 = 1
inv : WantSection_2_T + Idle_2 = 1
inv : WantSection_1_T + Idle_1 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_3_3 + IsEndLoop_1_2_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_3_4 + EndTurn_1_1 + EndTurn_1_0 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_0_0 + BeginLoop_1_3_0 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_0_2 + BeginLoop_1_0_3 + BeginLoop_1_1_3 + BeginLoop_1_3_2 + BeginLoop_1_0_4 + BeginLoop_1_3_3 + BeginLoop_1_2_3 + BeginLoop_1_3_4 + BeginLoop_1_2_4 + BeginLoop_1_1_4 + TestAlone_1_1_0 + TestAlone_1_0_0 + TestAlone_1_3_0 + TestAlone_1_2_0 + TestAlone_1_2_2 + TestAlone_1_3_2 + TestAlone_1_0_3 + TestAlone_1_1_3 + TestAlone_1_0_2 + TestAlone_1_1_2 + TestAlone_1_2_4 + TestAlone_1_3_4 + TestTurn_1_0 + TestTurn_1_1 + TestAlone_1_2_3 + TestAlone_1_3_3 + TestAlone_1_0_4 + TestAlone_1_1_4 + TestIdentity_1_1_0 + TestIdentity_1_3_0 + TestIdentity_1_2_0 + TestTurn_1_2 + TestIdentity_1_0_0 + TestTurn_1_3 + TestIdentity_1_0_2 + TestIdentity_1_3_1 + TestIdentity_1_1_2 + TestIdentity_1_1_1 + TestIdentity_1_0_1 + TestIdentity_1_2_1 + TestIdentity_1_3_3 + TestIdentity_1_0_4 + TestIdentity_1_2_3 + TestIdentity_1_0_3 + TestIdentity_1_1_3 + TestIdentity_1_2_2 + TestIdentity_1_3_2 + TestIdentity_1_2_4 + TestIdentity_1_3_4 + TestIdentity_1_1_4 + CS_1 + AskForSection_1_3 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + Idle_1 = 1
inv : Turn_0_2 + Turn_0_3 + Turn_0_0 + Turn_0_1 + Turn_0_4 = 1
inv : WantSection_4_F - Idle_4 = 0
inv : WantSection_3_T + Idle_3 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : Turn_3_1 + Turn_3_2 + Turn_3_0 + Turn_3_4 + Turn_3_3 = 1
Total of 19 invariants.
[2022-06-12 21:23:19] [INFO ] Computed 19 place invariants in 6 ms
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 224
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-04(UNSAT) depth K=1 took 165 ms
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-07(UNSAT) depth K=1 took 22 ms
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-08(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:23:19] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-15(UNSAT) depth K=1 took 2 ms
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :224 after 718
[2022-06-12 21:23:20] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-03(UNSAT) depth K=2 took 964 ms
[2022-06-12 21:23:21] [INFO ] Proved 480 variables to be positive in 1465 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-03
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-03(SAT) depth K=0 took 104 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-04
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-04(SAT) depth K=0 took 81 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-07
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-07(SAT) depth K=0 took 64 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-08
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-08(SAT) depth K=0 took 97 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-15
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-15(SAT) depth K=0 took 60 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-03
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-03(SAT) depth K=1 took 123 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-04
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-04(SAT) depth K=1 took 86 ms
[2022-06-12 21:23:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-07
[2022-06-12 21:23:21] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-07(SAT) depth K=1 took 285 ms
[2022-06-12 21:23:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-08
[2022-06-12 21:23:22] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-08(SAT) depth K=1 took 121 ms
[2022-06-12 21:23:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-15
[2022-06-12 21:23:22] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-15(SAT) depth K=1 took 121 ms
Compilation finished in 10136 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2663565350682919758]
Link finished in 100 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, PetersonPT4ReachabilityFireability03==true], workingDir=/tmp/ltsmin2663565350682919758]
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :718 after 786802
[2022-06-12 21:23:35] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-04(UNSAT) depth K=2 took 14542 ms
[2022-06-12 21:23:39] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-07(UNSAT) depth K=2 took 3948 ms
[2022-06-12 21:23:40] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-08(UNSAT) depth K=2 took 1033 ms
[2022-06-12 21:23:41] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-15(UNSAT) depth K=2 took 936 ms
[2022-06-12 21:25:02] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-03(UNSAT) depth K=3 took 80855 ms
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :786802 after 2.37449e+06
[2022-06-12 21:27:15] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-04(UNSAT) depth K=3 took 133964 ms
[2022-06-12 21:27:40] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-07(UNSAT) depth K=3 took 24796 ms
[2022-06-12 21:27:54] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-08(UNSAT) depth K=3 took 13378 ms
[2022-06-12 21:28:00] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-15(UNSAT) depth K=3 took 6679 ms
[2022-06-12 21:28:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-03
[2022-06-12 21:28:36] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-03(SAT) depth K=2 took 314113 ms
[2022-06-12 21:31:58] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-03(UNSAT) depth K=4 took 237731 ms
[2022-06-12 21:34:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-04
[2022-06-12 21:34:43] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-04(SAT) depth K=2 took 367111 ms
[2022-06-12 21:35:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-07
[2022-06-12 21:35:08] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-07(SAT) depth K=2 took 24871 ms
WARNING : LTSmin timed out (>720 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, PetersonPT4ReachabilityFireability03==true], workingDir=/tmp/ltsmin2663565350682919758]
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, PetersonPT4ReachabilityFireability04==true], workingDir=/tmp/ltsmin2663565350682919758]
[2022-06-12 21:35:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-08
[2022-06-12 21:35:32] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-08(SAT) depth K=2 took 24558 ms
[2022-06-12 21:35:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-15
[2022-06-12 21:35:47] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-15(SAT) depth K=2 took 14735 ms
[2022-06-12 21:40:54] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-04(UNSAT) depth K=4 took 536158 ms
Detected timeout of ITS tools.
[2022-06-12 21:45:09] [INFO ] Applying decomposition
[2022-06-12 21:45:09] [INFO ] Flatten gal took : 119 ms
[2022-06-12 21:45:09] [INFO ] Decomposing Gal with order
[2022-06-12 21:45:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:45:09] [INFO ] Removed a total of 513 redundant transitions.
[2022-06-12 21:45:09] [INFO ] Flatten gal took : 170 ms
[2022-06-12 21:45:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 18 ms.
[2022-06-12 21:45:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10851180672550999684.gal : 13 ms
[2022-06-12 21:45:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability114427376418858460.prop : 5 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/ReachabilityFireability10851180672550999684.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability114427376418858460.prop, --nowitness], 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/ReachabilityFireability10851180672550999684.gal -t CGAL -reachable-file /tmp/ReachabilityFireability114427376418858460.prop --nowitness
Loading property file /tmp/ReachabilityFireability114427376418858460.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 751
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :751 after 3134
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3134 after 30679
WARNING : LTSmin timed out (>720 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, PetersonPT4ReachabilityFireability04==true], workingDir=/tmp/ltsmin2663565350682919758]
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, PetersonPT4ReachabilityFireability07==true], workingDir=/tmp/ltsmin2663565350682919758]
[2022-06-12 21:47:59] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-07(UNSAT) depth K=4 took 424970 ms
[2022-06-12 21:49:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-03
[2022-06-12 21:49:10] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-03(SAT) depth K=3 took 802807 ms
[2022-06-12 21:51:24] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-08(UNSAT) depth K=4 took 205238 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :30679 after 8.96398e+06
[2022-06-12 21:54:05] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-15(UNSAT) depth K=4 took 160887 ms
Reachability property Peterson-PT-4-ReachabilityFireability-07 is true.
FORMULA Peterson-PT-4-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>720 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, PetersonPT4ReachabilityFireability07==true], workingDir=/tmp/ltsmin2663565350682919758]
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, PetersonPT4ReachabilityFireability08==true], workingDir=/tmp/ltsmin2663565350682919758]
Detected timeout of ITS tools.
[2022-06-12 22:07:01] [INFO ] Flatten gal took : 139 ms
[2022-06-12 22:07:01] [INFO ] Input system was already deterministic with 690 transitions.
[2022-06-12 22:07:01] [INFO ] Transformed 480 places.
[2022-06-12 22:07:01] [INFO ] Transformed 690 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-12 22:07:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16148144051821063791.gal : 2 ms
[2022-06-12 22:07:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4700570869492813079.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/ReachabilityFireability16148144051821063791.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability4700570869492813079.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/ReachabilityFireability16148144051821063791.gal -t CGAL -reachable-file /tmp/ReachabilityFireability4700570869492813079.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/ReachabilityFireability4700570869492813079.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 16
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :16 after 18
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :18 after 20
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :20 after 24
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :24 after 50
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :50 after 226
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :226 after 272
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :272 after 1314
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1314 after 5880
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5880 after 12077
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :12077 after 51298
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :51298 after 242202
WARNING : LTSmin timed out (>720 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, PetersonPT4ReachabilityFireability08==true], workingDir=/tmp/ltsmin2663565350682919758]
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, PetersonPT4ReachabilityFireability15==true], workingDir=/tmp/ltsmin2663565350682919758]
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :242202 after 361588
[2022-06-12 22:13:50] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-03(UNSAT) depth K=5 took 1185122 ms

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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="Peterson-PT-4"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-PT-4, examination is ReachabilityFireability"
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-165277026700027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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