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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.2K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 09:21 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 3.5K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Apr 30 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 30 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 44K 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-COL-4-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068446829

Running Version 0
[2022-06-12 21:14:08] [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:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:14:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-06-12 21:14:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-12 21:14:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2022-06-12 21:14:09] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-06-12 21:14:09] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 5 ms.
[2022-06-12 21:14:09] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_8335312018474835194.dot
Reduce places removed 2 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2022-06-12 21:14:09] [INFO ] Flatten gal took : 27 ms
[2022-06-12 21:14:09] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:14:09] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 24 ms.
[2022-06-12 21:14:09] [INFO ] Unfolded HLPN properties in 2 ms.
Successfully produced net in file /tmp/petri1001_6813792889663230870.dot
[2022-06-12 21:14:09] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 40 transitions.
FORMULA Peterson-COL-4-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 13) seen :6
FORMULA Peterson-COL-4-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=14 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-06-12 21:14:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:14:11] [INFO ] Computed 19 place invariants in 25 ms
[2022-06-12 21:14:11] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:12] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2022-06-12 21:14:12] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:14:12] [INFO ] [Real]Added 132 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:14:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2022-06-12 21:14:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2022-06-12 21:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:13] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-06-12 21:14:13] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 4 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 2 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 1 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 2 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 1 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 1 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 122 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 109 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 2 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 21:14:17] [INFO ] [Real]Absence check using 14 positive place invariants in 86 ms returned sat
[2022-06-12 21:14:17] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 17 ms returned sat
[2022-06-12 21:14:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:18] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2022-06-12 21:14:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 52 ms returned sat
[2022-06-12 21:14:19] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2022-06-12 21:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:19] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2022-06-12 21:14:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 113 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 4 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 122 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:14:21] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 141 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 138 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:14:24] [INFO ] Deduced a trap composed of 2 places in 132 ms of which 0 ms to minimize.
[2022-06-12 21:14: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: Stream close... while checking expression at index 1
[2022-06-12 21:14:24] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2022-06-12 21:14:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 19 ms returned sat
[2022-06-12 21:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:24] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2022-06-12 21:14:24] [INFO ] [Real]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:14:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:25] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Nat]Added 132 Read/Feed constraints in 43 ms returned sat
[2022-06-12 21:14:25] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:14:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-06-12 21:14:25] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 47 ms.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 0 ms to minimize.
[2022-06-12 21:14:30] [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 2
[2022-06-12 21:14:30] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:30] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2022-06-12 21:14:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:30] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 5 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 7 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:35] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:14:35] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:14:35] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:14:35] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:14:35] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:14:35] [INFO ] Deduced a trap composed of 2 places in 132 ms of which 0 ms to minimize.
[2022-06-12 21:14:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 21:14:35] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-06-12 21:14:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-06-12 21:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:35] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-06-12 21:14:35] [INFO ] [Real]Added 132 Read/Feed constraints in 25 ms returned sat
[2022-06-12 21:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-06-12 21:14:35] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2022-06-12 21:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:36] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-06-12 21:14:36] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2022-06-12 21:14:36] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:14:36] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:14:36] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:14:36] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2022-06-12 21:14:36] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:14:36] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 130 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:14: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 4
[2022-06-12 21:14:40] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:14:40] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2022-06-12 21:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:41] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-06-12 21:14:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:14:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2022-06-12 21:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:41] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2022-06-12 21:14:41] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2022-06-12 21:14:41] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:14:41] [INFO ] Deduced a trap composed of 189 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:14:41] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:14:41] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 111 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:14:45] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:14:46] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:14:46] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 4647 ms
[2022-06-12 21:14:46] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 31 ms.
[2022-06-12 21:14:46] [INFO ] Added : 0 causal constraints over 0 iterations in 56 ms. Result :unknown
[2022-06-12 21:14:46] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned unsat
FORMULA Peterson-COL-4-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 216400 steps, including 1000 resets, run finished after 2000 ms. (steps per millisecond=108 ) properties (out of 6) seen :3 could not realise parikh vector
FORMULA Peterson-COL-4-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 30 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:14:48] [INFO ] Flatten gal took : 76 ms
[2022-06-12 21:14:48] [INFO ] Flatten gal took : 41 ms
[2022-06-12 21:14:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3151069933071833213.gal : 13 ms
[2022-06-12 21:14:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5029218689724229785.prop : 8 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/ReachabilityCardinality3151069933071833213.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5029218689724229785.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/ReachabilityCardinality3151069933071833213.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5029218689724229785.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5029218689724229785.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6 after 16
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :16 after 37
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :37 after 69
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :69 after 212
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :212 after 624
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :624 after 1768
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1768 after 4220
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :4220 after 25994
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :25994 after 68803
Detected timeout of ITS tools.
[2022-06-12 21:15:03] [INFO ] Flatten gal took : 48 ms
[2022-06-12 21:15:03] [INFO ] Applying decomposition
[2022-06-12 21:15:03] [INFO ] Flatten gal took : 37 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/graph8888916292726577975.txt, -o, /tmp/graph8888916292726577975.bin, -w, /tmp/graph8888916292726577975.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/graph8888916292726577975.bin, -l, -1, -v, -w, /tmp/graph8888916292726577975.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:15:04] [INFO ] Decomposing Gal with order
[2022-06-12 21:15:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:15:04] [INFO ] Removed a total of 500 redundant transitions.
[2022-06-12 21:15:04] [INFO ] Flatten gal took : 98 ms
[2022-06-12 21:15:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 12 ms.
[2022-06-12 21:15:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14028000699843776765.gal : 7 ms
[2022-06-12 21:15:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9240841491321829678.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/ReachabilityCardinality14028000699843776765.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9240841491321829678.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/ReachabilityCardinality14028000699843776765.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9240841491321829678.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9240841491321829678.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3 after 64
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :64 after 740
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :740 after 7892
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :7892 after 170468
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2133645993693509063
[2022-06-12 21:15:19] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2133645993693509063
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/ltsmin2133645993693509063]
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/ltsmin2133645993693509063] 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/ltsmin2133645993693509063] 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 7482 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 72186 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=14 ) properties seen :{}
Interrupted Best-First random walk after 197844 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=39 ) properties seen :{}
Interrupted Best-First random walk after 584419 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen :{}
Interrupted probabilistic random walk after 8156352 steps, run timeout after 30001 ms. (steps per millisecond=271 ) properties seen :{2=1}
Probabilistic random walk after 8156352 steps, saw 1376518 distinct states, run finished after 30001 ms. (steps per millisecond=271 ) properties seen :{2=1}
FORMULA Peterson-COL-4-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2022-06-12 21:16:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:16:12] [INFO ] Computed 19 place invariants in 18 ms
[2022-06-12 21:16:13] [INFO ] [Real]Absence check using 14 positive place invariants in 80 ms returned sat
[2022-06-12 21:16:13] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2022-06-12 21:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:14] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2022-06-12 21:16:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 53 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:15] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2022-06-12 21:16:15] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:16:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 122 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 141 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 5576 ms
[2022-06-12 21:16:20] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2022-06-12 21:16:27] [INFO ] Added : 585 causal constraints over 117 iterations in 6966 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-12 21:16:27] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2022-06-12 21:16:27] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2022-06-12 21:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:28] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2022-06-12 21:16:28] [INFO ] [Real]Added 132 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:16:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2022-06-12 21:16:28] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 17 ms returned sat
[2022-06-12 21:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:29] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2022-06-12 21:16:29] [INFO ] [Nat]Added 132 Read/Feed constraints in 40 ms returned sat
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-06-12 21:16:29] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 29 ms.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2331 ms
[2022-06-12 21:16:37] [INFO ] Added : 492 causal constraints over 99 iterations in 7802 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 209300 steps, including 1000 resets, run finished after 1367 ms. (steps per millisecond=153 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA Peterson-COL-4-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 181500 steps, including 1000 resets, run finished after 1146 ms. (steps per millisecond=158 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 475 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 12 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:16:39] [INFO ] Flatten gal took : 22 ms
[2022-06-12 21:16:39] [INFO ] Flatten gal took : 25 ms
[2022-06-12 21:16:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3135320114415004587.gal : 2 ms
[2022-06-12 21:16:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7433796674737987843.prop : 20 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/ReachabilityCardinality3135320114415004587.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7433796674737987843.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/ReachabilityCardinality3135320114415004587.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7433796674737987843.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7433796674737987843.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 37
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :37 after 69
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :69 after 212
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :212 after 624
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :624 after 1768
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1768 after 4220
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4220 after 25994
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :25994 after 68803
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :68803 after 139526
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :139526 after 660694
Detected timeout of ITS tools.
[2022-06-12 21:16:55] [INFO ] Flatten gal took : 21 ms
[2022-06-12 21:16:55] [INFO ] Applying decomposition
[2022-06-12 21:16:55] [INFO ] Flatten gal took : 21 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/graph16094051834802662326.txt, -o, /tmp/graph16094051834802662326.bin, -w, /tmp/graph16094051834802662326.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/graph16094051834802662326.bin, -l, -1, -v, -w, /tmp/graph16094051834802662326.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:16:55] [INFO ] Decomposing Gal with order
[2022-06-12 21:16:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:16:55] [INFO ] Removed a total of 487 redundant transitions.
[2022-06-12 21:16:55] [INFO ] Flatten gal took : 73 ms
[2022-06-12 21:16:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 8 ms.
[2022-06-12 21:16:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17602081581138421898.gal : 4 ms
[2022-06-12 21:16:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1605962505564614089.prop : 10 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/ReachabilityCardinality17602081581138421898.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1605962505564614089.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/ReachabilityCardinality17602081581138421898.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1605962505564614089.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1605962505564614089.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 60
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :60 after 60
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :60 after 1032
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1032 after 21303
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :21303 after 1.10649e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2662666034258268551
[2022-06-12 21:17:10] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2662666034258268551
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/ltsmin2662666034258268551]
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/ltsmin2662666034258268551] 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/ltsmin2662666034258268551] 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 5564 ms. (steps per millisecond=179 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 205188 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=41 ) properties seen :{}
Interrupted probabilistic random walk after 8380548 steps, run timeout after 30001 ms. (steps per millisecond=279 ) properties seen :{}
Probabilistic random walk after 8380548 steps, saw 1414044 distinct states, run finished after 30001 ms. (steps per millisecond=279 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:17:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:17:51] [INFO ] Computed 19 place invariants in 9 ms
[2022-06-12 21:17:52] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2022-06-12 21:17:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2022-06-12 21:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:52] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2022-06-12 21:17:52] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:17:52] [INFO ] [Real]Added 132 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:17:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2022-06-12 21:17:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2022-06-12 21:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:53] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2022-06-12 21:17:53] [INFO ] [Nat]Added 132 Read/Feed constraints in 41 ms returned sat
[2022-06-12 21:17:53] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-06-12 21:17:53] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 27 ms.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:17:59] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:18:01] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 3 ms to minimize.
[2022-06-12 21:18:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2322 ms
[2022-06-12 21:18:01] [INFO ] Added : 492 causal constraints over 99 iterations in 7627 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 181500 steps, including 1000 resets, run finished after 1123 ms. (steps per millisecond=161 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 475 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 11 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 12 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-06-12 21:18:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:18:02] [INFO ] Computed 19 place invariants in 9 ms
[2022-06-12 21:18:02] [INFO ] Implicit Places using invariants in 74 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 76 ms to find 5 implicit places.
[2022-06-12 21:18:02] [INFO ] Redundant transitions in 40 ms returned []
[2022-06-12 21:18:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:18:02] [INFO ] Computed 14 place invariants in 4 ms
[2022-06-12 21:18:02] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Starting structural reductions, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-06-12 21:18:02] [INFO ] Redundant transitions in 16 ms returned []
[2022-06-12 21:18:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:18:02] [INFO ] Computed 14 place invariants in 3 ms
[2022-06-12 21:18:03] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-06-12 21:18:03] [INFO ] Flatten gal took : 20 ms
[2022-06-12 21:18:03] [INFO ] Flatten gal took : 20 ms
[2022-06-12 21:18:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13984274334794243825.gal : 2 ms
[2022-06-12 21:18:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality860849149793918268.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/ReachabilityCardinality13984274334794243825.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality860849149793918268.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/ReachabilityCardinality13984274334794243825.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality860849149793918268.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality860849149793918268.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 36
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :69 after 206
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :206 after 564
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :564 after 1580
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1580 after 8340
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8340 after 29759
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29759 after 60543
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :60543 after 138656
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :138656 after 820651
Detected timeout of ITS tools.
[2022-06-12 21:18:18] [INFO ] Flatten gal took : 34 ms
[2022-06-12 21:18:18] [INFO ] Applying decomposition
[2022-06-12 21:18:18] [INFO ] Flatten gal took : 20 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/graph5847016312791974634.txt, -o, /tmp/graph5847016312791974634.bin, -w, /tmp/graph5847016312791974634.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/graph5847016312791974634.bin, -l, -1, -v, -w, /tmp/graph5847016312791974634.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:18:18] [INFO ] Decomposing Gal with order
[2022-06-12 21:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:18:18] [INFO ] Removed a total of 491 redundant transitions.
[2022-06-12 21:18:18] [INFO ] Flatten gal took : 40 ms
[2022-06-12 21:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 7 ms.
[2022-06-12 21:18:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17695326628447279685.gal : 4 ms
[2022-06-12 21:18:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4205959674216978751.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/ReachabilityCardinality17695326628447279685.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4205959674216978751.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/ReachabilityCardinality17695326628447279685.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4205959674216978751.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4205959674216978751.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 60
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :60 after 3184
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3184 after 66346
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2930892354079017563
[2022-06-12 21:18:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2930892354079017563
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/ltsmin2930892354079017563]
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/ltsmin2930892354079017563] 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/ltsmin2930892354079017563] 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 5859 ms. (steps per millisecond=170 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 202014 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=40 ) properties seen :{}
Interrupted probabilistic random walk after 8253000 steps, run timeout after 30001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 8253000 steps, saw 1393163 distinct states, run finished after 30002 ms. (steps per millisecond=275 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:19:15] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:19:15] [INFO ] Computed 14 place invariants in 2 ms
[2022-06-12 21:19:15] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2022-06-12 21:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:16] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2022-06-12 21:19:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:16] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2022-06-12 21:19:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:19:17] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:19:17] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:19:18] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:19:19] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:19:19] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:19:19] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:19:19] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:19:19] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:19:19] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:19:22] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 10043 ms
[2022-06-12 21:19:27] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 27 ms.
[2022-06-12 21:19:33] [INFO ] Added : 585 causal constraints over 117 iterations in 6933 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 222500 steps, including 1000 resets, run finished after 1294 ms. (steps per millisecond=171 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 475 out of 475 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 690/690 transitions.
Starting structural reductions, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-06-12 21:19:35] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:19:35] [INFO ] Computed 14 place invariants in 3 ms
[2022-06-12 21:19:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-06-12 21:19:35] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:19:35] [INFO ] Computed 14 place invariants in 2 ms
[2022-06-12 21:19:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:19:35] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2022-06-12 21:19:35] [INFO ] Redundant transitions in 9 ms returned []
[2022-06-12 21:19:35] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:19:35] [INFO ] Computed 14 place invariants in 3 ms
[2022-06-12 21:19:35] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 690/690 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:19:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:19:36] [INFO ] Computed 14 place invariants in 7 ms
[2022-06-12 21:19:36] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:37] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2022-06-12 21:19:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2022-06-12 21:19:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:38] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2022-06-12 21:19:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:19:38] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2022-06-12 21:19:38] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:19:38] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:19:38] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:19:38] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:19:38] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:19:38] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:19:38] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:19:39] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:19:40] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:19:40] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:19:40] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:19:40] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:19:40] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:19:40] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:19:41] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:19:42] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:19:43] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:19:43] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:44] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:19:44] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:19:44] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:19:44] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:19:44] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:45] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:19:45] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:19:45] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:19:45] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:19:45] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:19:45] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 10220 ms
[2022-06-12 21:19:48] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
[2022-06-12 21:19:55] [INFO ] Added : 585 causal constraints over 117 iterations in 6953 ms. Result :sat
[2022-06-12 21:19:55] [INFO ] Flatten gal took : 22 ms
[2022-06-12 21:19:55] [INFO ] Flatten gal took : 20 ms
[2022-06-12 21:19:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17664841281211445704.gal : 2 ms
[2022-06-12 21:19:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6991734068160635653.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17664841281211445704.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6991734068160635653.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/ReachabilityCardinality17664841281211445704.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6991734068160635653.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6991734068160635653.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 36
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :69 after 206
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :206 after 564
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :564 after 1580
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1580 after 8340
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8340 after 29759
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29759 after 60543
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :60543 after 138656
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :138656 after 820651
Detected timeout of ITS tools.
[2022-06-12 21:20:15] [INFO ] Flatten gal took : 21 ms
[2022-06-12 21:20:15] [INFO ] Applying decomposition
[2022-06-12 21:20:15] [INFO ] Flatten gal took : 19 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/graph1368684973219940381.txt, -o, /tmp/graph1368684973219940381.bin, -w, /tmp/graph1368684973219940381.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/graph1368684973219940381.bin, -l, -1, -v, -w, /tmp/graph1368684973219940381.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:20:15] [INFO ] Decomposing Gal with order
[2022-06-12 21:20:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:20:15] [INFO ] Removed a total of 491 redundant transitions.
[2022-06-12 21:20:15] [INFO ] Flatten gal took : 38 ms
[2022-06-12 21:20:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2022-06-12 21:20:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5675385056081634434.gal : 4 ms
[2022-06-12 21:20:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16969037721453211969.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/ReachabilityCardinality5675385056081634434.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16969037721453211969.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/ReachabilityCardinality5675385056081634434.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16969037721453211969.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16969037721453211969.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 737
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :737 after 49717
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :49717 after 1.89538e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14144638587749100725
[2022-06-12 21:20:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14144638587749100725
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/ltsmin14144638587749100725]
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/ltsmin14144638587749100725] killed by timeout after 2 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/ltsmin14144638587749100725] killed by timeout after 2 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 475 transition count 630
Applied a total of 60 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 630/690 (removed 60) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:20:37] [INFO ] Computed 14 place invariants in 2 ms
[2022-06-12 21:20:37] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2022-06-12 21:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:38] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2022-06-12 21:20:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-12 21:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:39] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2022-06-12 21:20:39] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 26 ms.
[2022-06-12 21:20:46] [INFO ] Added : 620 causal constraints over 124 iterations in 6848 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-12 21:20:46] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13690159884581173482
[2022-06-12 21:20:46] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2022-06-12 21:20:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:20:46] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2022-06-12 21:20:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:20:46] [INFO ] Applying decomposition
[2022-06-12 21:20:46] [INFO ] Flatten gal took : 48 ms
[2022-06-12 21:20:46] [INFO ] Flatten gal took : 42 ms
[2022-06-12 21:20:46] [INFO ] Input system was already deterministic with 690 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17283904934964097363.txt, -o, /tmp/graph17283904934964097363.bin, -w, /tmp/graph17283904934964097363.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/graph17283904934964097363.bin, -l, -1, -v, -w, /tmp/graph17283904934964097363.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:20:46] [INFO ] Decomposing Gal with order
[2022-06-12 21:20:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:20:46] [INFO ] Removed a total of 491 redundant transitions.
[2022-06-12 21:20:46] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2022-06-12 21:20:46] [INFO ] Flatten gal took : 37 ms
[2022-06-12 21:20:46] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:20:46] [INFO ] Built C files in 206ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13690159884581173482
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/ltsmin13690159884581173482]
[2022-06-12 21:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2022-06-12 21:20:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18088100402340087110.gal : 5 ms
[2022-06-12 21:20:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4505423015721333967.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability18088100402340087110.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability4505423015721333967.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/ReachabilityFireability18088100402340087110.gal -t CGAL -reachable-file /tmp/ReachabilityFireability4505423015721333967.prop --nowitness
[2022-06-12 21:20:46] [INFO ] Ran tautology test, simplified 0 / 1 in 353 ms.
Loading property file /tmp/ReachabilityFireability4505423015721333967.prop.
[2022-06-12 21:20:46] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-04(UNSAT) depth K=0 took 20 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 475 cols
[2022-06-12 21:20:46] [INFO ] Computed 14 place invariants in 4 ms
inv : Turn_0 + Turn_1 + Turn_2 + Turn_3 + Turn_4 = 1
inv : WantSection_4 + WantSection_5 = 1
inv : WantSection_2 + AskForSection_4 + AskForSection_5 + AskForSection_6 + AskForSection_7 + TestTurn_4 + TestTurn_5 + TestTurn_6 + TestTurn_7 + BeginLoop_20 + BeginLoop_21 + BeginLoop_22 + BeginLoop_23 + BeginLoop_24 + BeginLoop_25 + BeginLoop_26 + BeginLoop_27 + BeginLoop_28 + BeginLoop_29 + BeginLoop_30 + BeginLoop_31 + BeginLoop_32 + BeginLoop_33 + BeginLoop_34 + BeginLoop_35 + BeginLoop_36 + BeginLoop_37 + BeginLoop_38 + BeginLoop_39 + EndTurn_4 + EndTurn_5 + EndTurn_6 + EndTurn_7 + CS_1 + TestIdentity_20 + TestIdentity_21 + TestIdentity_22 + TestIdentity_23 + TestIdentity_24 + TestIdentity_25 + TestIdentity_26 + TestIdentity_27 + TestIdentity_28 + TestIdentity_29 + TestIdentity_30 + TestIdentity_31 + TestIdentity_32 + TestIdentity_33 + TestIdentity_34 + TestIdentity_35 + TestIdentity_36 + TestIdentity_37 + TestIdentity_38 + TestIdentity_39 + TestAlone_20 + TestAlone_22 + TestAlone_23 + TestAlone_24 + TestAlone_25 + TestAlone_27 + TestAlone_28 + TestAlone_29 + TestAlone_30 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_35 + TestAlone_37 + TestAlone_38 + TestAlone_39 + IsEndLoop_20 + IsEndLoop_21 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_28 + IsEndLoop_29 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_35 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 = 1
inv : WantSection_8 + WantSection_9 = 1
inv : WantSection_4 + AskForSection_8 + AskForSection_9 + AskForSection_10 + AskForSection_11 + TestTurn_8 + TestTurn_9 + TestTurn_10 + TestTurn_11 + BeginLoop_40 + BeginLoop_41 + BeginLoop_42 + BeginLoop_43 + BeginLoop_44 + BeginLoop_45 + BeginLoop_46 + BeginLoop_47 + BeginLoop_48 + BeginLoop_49 + BeginLoop_50 + BeginLoop_51 + BeginLoop_52 + BeginLoop_53 + BeginLoop_54 + BeginLoop_55 + BeginLoop_56 + BeginLoop_57 + BeginLoop_58 + BeginLoop_59 + EndTurn_8 + EndTurn_9 + EndTurn_10 + EndTurn_11 + CS_2 + TestIdentity_40 + TestIdentity_41 + TestIdentity_42 + TestIdentity_43 + TestIdentity_44 + TestIdentity_45 + TestIdentity_46 + TestIdentity_47 + TestIdentity_48 + TestIdentity_49 + TestIdentity_50 + TestIdentity_51 + TestIdentity_52 + TestIdentity_53 + TestIdentity_54 + TestIdentity_55 + TestIdentity_56 + TestIdentity_57 + TestIdentity_58 + TestIdentity_59 + TestAlone_40 + TestAlone_41 + TestAlone_43 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_48 + TestAlone_49 + TestAlone_50 + TestAlone_51 + TestAlone_53 + TestAlone_54 + TestAlone_55 + TestAlone_56 + TestAlone_58 + TestAlone_59 + IsEndLoop_40 + IsEndLoop_41 + IsEndLoop_42 + IsEndLoop_43 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_50 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_57 + IsEndLoop_58 + IsEndLoop_59 = 1
inv : WantSection_0 + WantSection_1 = 1
inv : WantSection_6 + AskForSection_12 + AskForSection_13 + AskForSection_14 + AskForSection_15 + TestTurn_12 + TestTurn_13 + TestTurn_14 + TestTurn_15 + BeginLoop_60 + BeginLoop_61 + BeginLoop_62 + BeginLoop_63 + BeginLoop_64 + BeginLoop_65 + BeginLoop_66 + BeginLoop_67 + BeginLoop_68 + BeginLoop_69 + BeginLoop_70 + BeginLoop_71 + BeginLoop_72 + BeginLoop_73 + BeginLoop_74 + BeginLoop_75 + BeginLoop_76 + BeginLoop_77 + BeginLoop_78 + BeginLoop_79 + EndTurn_12 + EndTurn_13 + EndTurn_14 + EndTurn_15 + CS_3 + TestIdentity_60 + TestIdentity_61 + TestIdentity_62 + TestIdentity_63 + TestIdentity_64 + TestIdentity_65 + TestIdentity_66 + TestIdentity_67 + TestIdentity_68 + TestIdentity_69 + TestIdentity_70 + TestIdentity_71 + TestIdentity_72 + TestIdentity_73 + TestIdentity_74 + TestIdentity_75 + TestIdentity_76 + TestIdentity_77 + TestIdentity_78 + TestIdentity_79 + TestAlone_60 + TestAlone_61 + TestAlone_62 + TestAlone_64 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_69 + TestAlone_70 + TestAlone_71 + TestAlone_72 + TestAlone_74 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_79 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_64 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_71 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_78 + IsEndLoop_79 = 1
inv : Turn_5 + Turn_6 + Turn_7 + Turn_8 + Turn_9 = 1
inv : Turn_15 + Turn_16 + Turn_17 + Turn_18 + Turn_19 = 1
inv : WantSection_0 + AskForSection_0 + AskForSection_1 + AskForSection_2 + AskForSection_3 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + BeginLoop_0 + BeginLoop_1 + BeginLoop_2 + BeginLoop_3 + BeginLoop_4 + BeginLoop_5 + BeginLoop_6 + BeginLoop_7 + BeginLoop_8 + BeginLoop_9 + BeginLoop_10 + BeginLoop_11 + BeginLoop_12 + BeginLoop_13 + BeginLoop_14 + BeginLoop_15 + BeginLoop_16 + BeginLoop_17 + BeginLoop_18 + BeginLoop_19 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + CS_0 + TestIdentity_0 + TestIdentity_1 + TestIdentity_2 + TestIdentity_3 + TestIdentity_4 + TestIdentity_5 + TestIdentity_6 + TestIdentity_7 + TestIdentity_8 + TestIdentity_9 + TestIdentity_10 + TestIdentity_11 + TestIdentity_12 + TestIdentity_13 + TestIdentity_14 + TestIdentity_15 + TestIdentity_16 + TestIdentity_17 + TestIdentity_18 + TestIdentity_19 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_6 + TestAlone_7 + TestAlone_8 + TestAlone_9 + TestAlone_11 + TestAlone_12 + TestAlone_13 + TestAlone_14 + TestAlone_16 + TestAlone_17 + TestAlone_18 + TestAlone_19 + IsEndLoop_0 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_7 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_14 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 = 1
inv : WantSection_6 + WantSection_7 = 1
inv : Turn_10 + Turn_11 + Turn_12 + Turn_13 + Turn_14 = 1
inv : WantSection_2 + WantSection_3 = 1
inv : WantSection_8 + AskForSection_16 + AskForSection_17 + AskForSection_18 + AskForSection_19 + TestTurn_16 + TestTurn_17 + TestTurn_18 + TestTurn_19 + BeginLoop_80 + BeginLoop_81 + BeginLoop_82 + BeginLoop_83 + BeginLoop_84 + BeginLoop_85 + BeginLoop_86 + BeginLoop_87 + BeginLoop_88 + BeginLoop_89 + BeginLoop_90 + BeginLoop_91 + BeginLoop_92 + BeginLoop_93 + BeginLoop_94 + BeginLoop_95 + BeginLoop_96 + BeginLoop_97 + BeginLoop_98 + BeginLoop_99 + EndTurn_16 + EndTurn_17 + EndTurn_18 + EndTurn_19 + CS_4 + TestIdentity_80 + TestIdentity_81 + TestIdentity_82 + TestIdentity_83 + TestIdentity_84 + TestIdentity_85 + TestIdentity_86 + TestIdentity_87 + TestIdentity_88 + TestIdentity_89 + TestIdentity_90 + TestIdentity_91 + TestIdentity_92 + TestIdentity_93 + TestIdentity_94 + TestIdentity_95 + TestIdentity_96 + TestIdentity_97 + TestIdentity_98 + TestIdentity_99 + TestAlone_80 + TestAlone_81 + TestAlone_82 + TestAlone_83 + TestAlone_85 + TestAlone_86 + TestAlone_87 + TestAlone_88 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_93 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_86 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_93 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 = 1
Total of 14 invariants.
[2022-06-12 21:20:46] [INFO ] Computed 14 place invariants in 13 ms
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 27
[2022-06-12 21:20:47] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-04(UNSAT) depth K=1 took 354 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :27 after 1326
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1326 after 1968
[2022-06-12 21:20:47] [INFO ] Proved 475 variables to be positive in 1016 ms
[2022-06-12 21:20:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-04
[2022-06-12 21:20:48] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-04(SAT) depth K=0 took 72 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1968 after 74479
[2022-06-12 21:20:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-04
[2022-06-12 21:20:48] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-04(SAT) depth K=1 took 513 ms
Compilation finished in 4963 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13690159884581173482]
Link finished in 65 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, PetersonCOL4ReachabilityFireability04==true], workingDir=/tmp/ltsmin13690159884581173482]
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :74479 after 837591
[2022-06-12 21:20:54] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-04(UNSAT) depth K=2 took 7312 ms
[2022-06-12 21:21:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-04
[2022-06-12 21:21:02] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-04(SAT) depth K=2 took 13610 ms
[2022-06-12 21:21:41] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-04(UNSAT) depth K=3 took 47078 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :837591 after 1.14472e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.14472e+07 after 1.95549e+07
[2022-06-12 21:28:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-04
[2022-06-12 21:28:33] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-04(SAT) depth K=3 took 451793 ms
[2022-06-12 21:35:23] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-04(UNSAT) depth K=4 took 821554 ms
Detected timeout of ITS tools.
[2022-06-12 21:42:58] [INFO ] Applying decomposition
[2022-06-12 21:42:58] [INFO ] Flatten gal took : 51 ms
[2022-06-12 21:42:58] [INFO ] Decomposing Gal with order
[2022-06-12 21:42:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:42:58] [INFO ] Removed a total of 570 redundant transitions.
[2022-06-12 21:42:59] [INFO ] Flatten gal took : 99 ms
[2022-06-12 21:42:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-06-12 21:42:59] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6582496616251885529.gal : 13 ms
[2022-06-12 21:42:59] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9282758643379977512.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability6582496616251885529.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability9282758643379977512.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/ReachabilityFireability6582496616251885529.gal -t CGAL -reachable-file /tmp/ReachabilityFireability9282758643379977512.prop --nowitness
Loading property file /tmp/ReachabilityFireability9282758643379977512.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 169
Detected timeout of ITS tools.
[2022-06-12 22:05:11] [INFO ] Flatten gal took : 45 ms
[2022-06-12 22:05:11] [INFO ] Input system was already deterministic with 690 transitions.
[2022-06-12 22:05:11] [INFO ] Transformed 475 places.
[2022-06-12 22:05:11] [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:05:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13693663363684911109.gal : 13 ms
[2022-06-12 22:05:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability460315703681586959.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability13693663363684911109.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability460315703681586959.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/ReachabilityFireability13693663363684911109.gal -t CGAL -reachable-file /tmp/ReachabilityFireability460315703681586959.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/ReachabilityFireability460315703681586959.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 90
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :90 after 140
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :140 after 248
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :248 after 963
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :963 after 3904
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3904 after 10384
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10384 after 94947
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :94947 after 495588
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :495588 after 579161
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :579161 after 1.85412e+06
LTSmin run took 2777858 ms.
Found Violation
FORMULA Peterson-COL-4-ReachabilityFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2022-06-12 22:07:09] [WARNING] Interrupting SMT solver.
[2022-06-12 22:07:09] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2022-06-12 22:07:09] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 22:07:09] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-COL-4-ReachabilityFireability-04 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2022-06-12 22:07:09] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-COL-4-ReachabilityFireability-04 K-induction depth 4
Exception in thread "Thread-27" [2022-06-12 22:07:09] [INFO ] During BMC, SMT solver timed out at depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2022-06-12 22:07:09] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2022-06-12 22:07:09] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1655071630320

--------------------
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-COL-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-COL-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-165277026600009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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