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.r323-tall-165472292500002.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 BugTracking-PT-q3m002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.6K Jun 7 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Jun 7 17:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q3m002-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654726497537

Running Version 0
[2022-06-08 22:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 22:15:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 22:15:01] [INFO ] Load time of PNML (sax parser for PT used): 748 ms
[2022-06-08 22:15:01] [INFO ] Transformed 754 places.
[2022-06-08 22:15:01] [INFO ] Transformed 27370 transitions.
[2022-06-08 22:15:01] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 894 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 140 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 213 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1382136 steps, run timeout after 30001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 1382136 steps, saw 819933 distinct states, run finished after 30012 ms. (steps per millisecond=46 ) properties seen :{}
Running SMT prover for 5 properties.
[2022-06-08 22:15:32] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 22:15:32] [INFO ] Computed 10 place invariants in 32 ms
[2022-06-08 22:15:32] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2022-06-08 22:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:33] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2022-06-08 22:15:33] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 22:15:33] [INFO ] [Real]Added 268 Read/Feed constraints in 119 ms returned sat
[2022-06-08 22:15:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:33] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2022-06-08 22:15:33] [INFO ] [Nat]Added 268 Read/Feed constraints in 127 ms returned sat
[2022-06-08 22:15:34] [INFO ] Deduced a trap composed of 19 places in 369 ms of which 7 ms to minimize.
[2022-06-08 22:15:34] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 1 ms to minimize.
[2022-06-08 22:15:35] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 1 ms to minimize.
[2022-06-08 22:15:35] [INFO ] Deduced a trap composed of 56 places in 493 ms of which 2 ms to minimize.
[2022-06-08 22:15:36] [INFO ] Deduced a trap composed of 56 places in 367 ms of which 1 ms to minimize.
[2022-06-08 22:15:36] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-06-08 22:15:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2612 ms
[2022-06-08 22:15:36] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 194 ms.
[2022-06-08 22:15:38] [INFO ] Added : 80 causal constraints over 16 iterations in 1897 ms. Result :unknown
[2022-06-08 22:15:38] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
[2022-06-08 22:15:38] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:38] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-06-08 22:15:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-08 22:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:39] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-06-08 22:15:39] [INFO ] [Nat]Added 268 Read/Feed constraints in 129 ms returned sat
[2022-06-08 22:15:39] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2022-06-08 22:15:39] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 1 ms to minimize.
[2022-06-08 22:15:40] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-06-08 22:15:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 824 ms
[2022-06-08 22:15:40] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 152 ms.
[2022-06-08 22:15:43] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 1 ms to minimize.
[2022-06-08 22:15:43] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2022-06-08 22:15:43] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 1 ms to minimize.
[2022-06-08 22:15:43] [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-08 22:15:43] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:44] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-06-08 22:15:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:44] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-06-08 22:15:44] [INFO ] [Nat]Added 268 Read/Feed constraints in 133 ms returned sat
[2022-06-08 22:15:45] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2022-06-08 22:15:45] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 1 ms to minimize.
[2022-06-08 22:15:45] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 0 ms to minimize.
[2022-06-08 22:15:45] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 2 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 1 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 1 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 0 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-06-08 22:15:47] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 0 ms to minimize.
[2022-06-08 22:15:47] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 0 ms to minimize.
[2022-06-08 22:15:47] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 1 ms to minimize.
[2022-06-08 22:15:47] [INFO ] Deduced a trap composed of 69 places in 195 ms of which 3 ms to minimize.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 0 ms to minimize.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 0 ms to minimize.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 0 ms to minimize.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 0 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 0 ms to minimize.
[2022-06-08 22:15:49] [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-08 22:15:49] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:49] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-06-08 22:15:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:50] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-06-08 22:15:50] [INFO ] [Nat]Added 268 Read/Feed constraints in 134 ms returned sat
[2022-06-08 22:15:50] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 0 ms to minimize.
[2022-06-08 22:15:50] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 0 ms to minimize.
[2022-06-08 22:15:51] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 0 ms to minimize.
[2022-06-08 22:15:51] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 1 ms to minimize.
[2022-06-08 22:15:51] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 5 ms to minimize.
[2022-06-08 22:15:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1630 ms
[2022-06-08 22:15:52] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 210 ms.
[2022-06-08 22:15:54] [INFO ] Deduced a trap composed of 54 places in 338 ms of which 0 ms to minimize.
[2022-06-08 22:15:54] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 1 ms to minimize.
[2022-06-08 22:15:55] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2022-06-08 22:15:55] [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
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 1453800 steps, including 77165 resets, run finished after 10806 ms. (steps per millisecond=134 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 17 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 237 transition count 2745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 13 place count 232 transition count 2745
Applied a total of 13 rules in 221 ms. Remains 232 /240 variables (removed 8) and now considering 2745/2769 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/240 places, 2745/2769 transitions.
[2022-06-08 22:16:06] [INFO ] Flatten gal took : 317 ms
[2022-06-08 22:16:06] [INFO ] Flatten gal took : 168 ms
[2022-06-08 22:16:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7478456257715071334.gal : 60 ms
[2022-06-08 22:16:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality378129326970867030.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/ReachabilityCardinality7478456257715071334.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality378129326970867030.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/ReachabilityCardinality7478456257715071334.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality378129326970867030.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality378129326970867030.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 134
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :134 after 464
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :464 after 1114
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1114 after 2404
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2404 after 4974
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4974 after 10104
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :10104 after 20354
Detected timeout of ITS tools.
[2022-06-08 22:16:22] [INFO ] Flatten gal took : 139 ms
[2022-06-08 22:16:22] [INFO ] Applying decomposition
[2022-06-08 22:16:22] [INFO ] Flatten gal took : 132 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/graph3066090730790115793.txt, -o, /tmp/graph3066090730790115793.bin, -w, /tmp/graph3066090730790115793.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/graph3066090730790115793.bin, -l, -1, -v, -w, /tmp/graph3066090730790115793.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 22:16:22] [INFO ] Decomposing Gal with order
[2022-06-08 22:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:16:23] [INFO ] Removed a total of 337 redundant transitions.
[2022-06-08 22:16:23] [INFO ] Flatten gal took : 348 ms
[2022-06-08 22:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 34 ms.
[2022-06-08 22:16:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6830456334941004147.gal : 39 ms
[2022-06-08 22:16:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16593921858271691788.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6830456334941004147.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16593921858271691788.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/ReachabilityCardinality6830456334941004147.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16593921858271691788.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16593921858271691788.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :18 after 66
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :66 after 85
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :85 after 88
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :88 after 93
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :93 after 102
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :102 after 294
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :294 after 328
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :328 after 473
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :473 after 1012
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1012 after 2222
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2222 after 6447
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6447 after 29025
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :29025 after 140750
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17741181906617249797
[2022-06-08 22:16:38] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17741181906617249797
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/ltsmin17741181906617249797]
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/ltsmin17741181906617249797] 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/ltsmin17741181906617249797] 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 24140 resets, run finished after 5429 ms. (steps per millisecond=184 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7447 resets, run finished after 1870 ms. (steps per millisecond=534 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6351 resets, run finished after 1981 ms. (steps per millisecond=504 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 150 resets, run finished after 1644 ms. (steps per millisecond=608 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6507 resets, run finished after 2027 ms. (steps per millisecond=493 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1724642 steps, run timeout after 30001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 1724642 steps, saw 942217 distinct states, run finished after 30001 ms. (steps per millisecond=57 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-08 22:17:22] [INFO ] Flow matrix only has 2621 transitions (discarded 124 similar events)
// Phase 1: matrix 2621 rows 232 cols
[2022-06-08 22:17:22] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-08 22:17:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-08 22:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:22] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-06-08 22:17:22] [INFO ] State equation strengthened by 252 read => feed constraints.
[2022-06-08 22:17:23] [INFO ] [Real]Added 252 Read/Feed constraints in 106 ms returned sat
[2022-06-08 22:17:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 22 ms returned sat
[2022-06-08 22:17:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:23] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-06-08 22:17:23] [INFO ] [Nat]Added 252 Read/Feed constraints in 120 ms returned sat
[2022-06-08 22:17:24] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 0 ms to minimize.
[2022-06-08 22:17:24] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 1 ms to minimize.
[2022-06-08 22:17:24] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 1 ms to minimize.
[2022-06-08 22:17:24] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-06-08 22:17:25] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2022-06-08 22:17:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1508 ms
[2022-06-08 22:17:25] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 178 ms.
[2022-06-08 22:17:27] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2022-06-08 22:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2022-06-08 22:17:27] [INFO ] Added : 84 causal constraints over 17 iterations in 2339 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-08 22:17:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:27] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-06-08 22:17:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:28] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-06-08 22:17:28] [INFO ] [Nat]Added 252 Read/Feed constraints in 111 ms returned sat
[2022-06-08 22:17:28] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 4 ms to minimize.
[2022-06-08 22:17:28] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2022-06-08 22:17:29] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2022-06-08 22:17:29] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2022-06-08 22:17:29] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2022-06-08 22:17:29] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
[2022-06-08 22:17:30] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2022-06-08 22:17:30] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 1 ms to minimize.
[2022-06-08 22:17:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1973 ms
[2022-06-08 22:17:30] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 141 ms.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 0 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2022-06-08 22:17:33] [INFO ] Added : 101 causal constraints over 21 iterations in 2859 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-08 22:17:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:33] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-06-08 22:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 22:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:34] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-06-08 22:17:34] [INFO ] [Nat]Added 252 Read/Feed constraints in 127 ms returned sat
[2022-06-08 22:17:34] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2022-06-08 22:17:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-06-08 22:17:34] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 150 ms.
[2022-06-08 22:17:36] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 76 places in 286 ms of which 0 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:17:38] [INFO ] Deduced a trap composed of 76 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:17:38] [INFO ] Deduced a trap composed of 76 places in 290 ms of which 1 ms to minimize.
[2022-06-08 22:17:39] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 0 ms to minimize.
[2022-06-08 22:17:39] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 4 ms to minimize.
[2022-06-08 22:17:39] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 0 ms to minimize.
[2022-06-08 22:17:40] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 1 ms to minimize.
[2022-06-08 22:17:40] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 0 ms to minimize.
[2022-06-08 22:17:40] [INFO ] Deduced a trap composed of 78 places in 264 ms of which 2 ms to minimize.
[2022-06-08 22:17:41] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 1 ms to minimize.
[2022-06-08 22:17:41] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 0 ms to minimize.
[2022-06-08 22:17:41] [INFO ] Deduced a trap composed of 47 places in 260 ms of which 0 ms to minimize.
[2022-06-08 22:17:42] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:17:42] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 0 ms to minimize.
[2022-06-08 22:17:42] [INFO ] Deduced a trap composed of 50 places in 277 ms of which 1 ms to minimize.
[2022-06-08 22:17:43] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:17:43] [INFO ] Deduced a trap composed of 51 places in 287 ms of which 1 ms to minimize.
[2022-06-08 22:17:44] [INFO ] Deduced a trap composed of 75 places in 292 ms of which 1 ms to minimize.
[2022-06-08 22:17:44] [INFO ] Deduced a trap composed of 75 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:17:44] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 1 ms to minimize.
[2022-06-08 22:17:45] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 1 ms to minimize.
[2022-06-08 22:17:45] [INFO ] Deduced a trap composed of 106 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:17:46] [INFO ] Deduced a trap composed of 105 places in 300 ms of which 0 ms to minimize.
[2022-06-08 22:17:46] [INFO ] Deduced a trap composed of 101 places in 300 ms of which 1 ms to minimize.
[2022-06-08 22:17:46] [INFO ] Deduced a trap composed of 110 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:17:47] [INFO ] Deduced a trap composed of 110 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:17:47] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 1 ms to minimize.
[2022-06-08 22:17:48] [INFO ] Deduced a trap composed of 75 places in 288 ms of which 0 ms to minimize.
[2022-06-08 22:17:48] [INFO ] Deduced a trap composed of 75 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:17:48] [INFO ] Deduced a trap composed of 75 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:17:49] [INFO ] Deduced a trap composed of 75 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:17:49] [INFO ] Deduced a trap composed of 75 places in 286 ms of which 0 ms to minimize.
[2022-06-08 22:17:49] [INFO ] Deduced a trap composed of 75 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:17:50] [INFO ] Deduced a trap composed of 75 places in 315 ms of which 0 ms to minimize.
[2022-06-08 22:17:50] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:17:51] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:17:51] [INFO ] Deduced a trap composed of 108 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:17:51] [INFO ] Deduced a trap composed of 77 places in 288 ms of which 1 ms to minimize.
[2022-06-08 22:17:52] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 1 ms to minimize.
[2022-06-08 22:17:52] [INFO ] Deduced a trap composed of 52 places in 282 ms of which 0 ms to minimize.
[2022-06-08 22:17:53] [INFO ] Deduced a trap composed of 115 places in 282 ms of which 1 ms to minimize.
[2022-06-08 22:17:53] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 0 ms to minimize.
[2022-06-08 22:17:53] [INFO ] Deduced a trap composed of 54 places in 291 ms of which 1 ms to minimize.
[2022-06-08 22:17:54] [INFO ] Deduced a trap composed of 112 places in 283 ms of which 0 ms to minimize.
[2022-06-08 22:17:54] [INFO ] Deduced a trap composed of 111 places in 285 ms of which 0 ms to minimize.
[2022-06-08 22:17:54] [INFO ] Deduced a trap composed of 111 places in 285 ms of which 0 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 73 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 76 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:17:56] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 0 ms to minimize.
[2022-06-08 22:17:56] [INFO ] Deduced a trap composed of 77 places in 284 ms of which 1 ms to minimize.
[2022-06-08 22:17:56] [INFO ] Deduced a trap composed of 105 places in 277 ms of which 1 ms to minimize.
[2022-06-08 22:17:57] [INFO ] Deduced a trap composed of 72 places in 281 ms of which 0 ms to minimize.
[2022-06-08 22:17:57] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 1 ms to minimize.
[2022-06-08 22:17:57] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 0 ms to minimize.
[2022-06-08 22:17:58] [INFO ] Deduced a trap composed of 72 places in 286 ms of which 1 ms to minimize.
[2022-06-08 22:17:58] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 1 ms to minimize.
[2022-06-08 22:17:59] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 0 ms to minimize.
[2022-06-08 22:17:59] [INFO ] Deduced a trap composed of 47 places in 288 ms of which 0 ms to minimize.
[2022-06-08 22:17:59] [INFO ] Deduced a trap composed of 47 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:18:00] [INFO ] Deduced a trap composed of 50 places in 294 ms of which 0 ms to minimize.
[2022-06-08 22:18:00] [INFO ] Deduced a trap composed of 48 places in 285 ms of which 1 ms to minimize.
[2022-06-08 22:18:01] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:18:01] [INFO ] Deduced a trap composed of 49 places in 286 ms of which 1 ms to minimize.
[2022-06-08 22:18:01] [INFO ] Deduced a trap composed of 51 places in 301 ms of which 0 ms to minimize.
[2022-06-08 22:18:02] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:18:02] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 1 ms to minimize.
[2022-06-08 22:18:03] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 1 ms to minimize.
[2022-06-08 22:18:03] [INFO ] Deduced a trap composed of 75 places in 283 ms of which 0 ms to minimize.
[2022-06-08 22:18:03] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:18:04] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 1 ms to minimize.
[2022-06-08 22:18:04] [INFO ] Deduced a trap composed of 50 places in 296 ms of which 17 ms to minimize.
[2022-06-08 22:18:04] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:18:05] [INFO ] Deduced a trap composed of 50 places in 285 ms of which 0 ms to minimize.
[2022-06-08 22:18:05] [INFO ] Deduced a trap composed of 95 places in 289 ms of which 0 ms to minimize.
[2022-06-08 22:18:06] [INFO ] Deduced a trap composed of 69 places in 293 ms of which 1 ms to minimize.
[2022-06-08 22:18:06] [INFO ] Deduced a trap composed of 50 places in 285 ms of which 0 ms to minimize.
[2022-06-08 22:18:06] [INFO ] Deduced a trap composed of 48 places in 286 ms of which 0 ms to minimize.
[2022-06-08 22:18:07] [INFO ] Deduced a trap composed of 48 places in 372 ms of which 1 ms to minimize.
[2022-06-08 22:18:07] [INFO ] Deduced a trap composed of 73 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:18:08] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:18:08] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:18:08] [INFO ] Deduced a trap composed of 70 places in 285 ms of which 1 ms to minimize.
[2022-06-08 22:18:09] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 1 ms to minimize.
[2022-06-08 22:18:09] [INFO ] Deduced a trap composed of 89 places in 293 ms of which 1 ms to minimize.
[2022-06-08 22:18:10] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:18:10] [INFO ] Deduced a trap composed of 78 places in 289 ms of which 0 ms to minimize.
[2022-06-08 22:18:10] [INFO ] Deduced a trap composed of 76 places in 282 ms of which 0 ms to minimize.
[2022-06-08 22:18:11] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 1 ms to minimize.
[2022-06-08 22:18:11] [INFO ] Deduced a trap composed of 51 places in 285 ms of which 0 ms to minimize.
[2022-06-08 22:18:11] [INFO ] Deduced a trap composed of 50 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:18:12] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:18:12] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 0 ms to minimize.
[2022-06-08 22:18:13] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:18:13] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 0 ms to minimize.
[2022-06-08 22:18:13] [INFO ] Deduced a trap composed of 71 places in 280 ms of which 0 ms to minimize.
[2022-06-08 22:18:14] [INFO ] Deduced a trap composed of 50 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:18:14] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 0 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 48 places in 283 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 69 places in 283 ms of which 1 ms to minimize.
[2022-06-08 22:18:17] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 0 ms to minimize.
[2022-06-08 22:18:17] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:18:17] [INFO ] Deduced a trap composed of 55 places in 293 ms of which 0 ms to minimize.
[2022-06-08 22:18:18] [INFO ] Deduced a trap composed of 49 places in 292 ms of which 0 ms to minimize.
[2022-06-08 22:18:18] [INFO ] Deduced a trap composed of 50 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:18:18] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 0 ms to minimize.
[2022-06-08 22:18:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-08 22:18:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:19] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2022-06-08 22:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:18:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:19] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-06-08 22:18:19] [INFO ] [Nat]Added 252 Read/Feed constraints in 122 ms returned sat
[2022-06-08 22:18:20] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 0 ms to minimize.
[2022-06-08 22:18:20] [INFO ] Deduced a trap composed of 61 places in 245 ms of which 0 ms to minimize.
[2022-06-08 22:18:20] [INFO ] Deduced a trap composed of 60 places in 239 ms of which 0 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 0 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2022-06-08 22:18:21] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2022-06-08 22:18:22] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-06-08 22:18:22] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-06-08 22:18:22] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2022-06-08 22:18:22] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2022-06-08 22:18:23] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2022-06-08 22:18:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3364 ms
[2022-06-08 22:18:23] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 143 ms.
[2022-06-08 22:18:24] [INFO ] Added : 61 causal constraints over 13 iterations in 1653 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 1351100 steps, including 72917 resets, run finished after 10069 ms. (steps per millisecond=134 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1149100 steps, including 62213 resets, run finished after 8233 ms. (steps per millisecond=139 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1062200 steps, including 57215 resets, run finished after 7602 ms. (steps per millisecond=139 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 17 out of 232 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 232/232 places, 2745/2745 transitions.
Applied a total of 0 rules in 39 ms. Remains 232 /232 variables (removed 0) and now considering 2745/2745 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 2745/2745 transitions.
Starting structural reductions, iteration 0 : 232/232 places, 2745/2745 transitions.
Applied a total of 0 rules in 49 ms. Remains 232 /232 variables (removed 0) and now considering 2745/2745 (removed 0) transitions.
[2022-06-08 22:18:50] [INFO ] Flow matrix only has 2621 transitions (discarded 124 similar events)
// Phase 1: matrix 2621 rows 232 cols
[2022-06-08 22:18:50] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-08 22:18:51] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-06-08 22:18:51] [INFO ] Flow matrix only has 2621 transitions (discarded 124 similar events)
// Phase 1: matrix 2621 rows 232 cols
[2022-06-08 22:18:51] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-08 22:18:51] [INFO ] State equation strengthened by 252 read => feed constraints.
[2022-06-08 22:18:55] [INFO ] Implicit Places using invariants and state equation in 4355 ms returned []
Implicit Place search using SMT with State Equation took 4664 ms to find 0 implicit places.
[2022-06-08 22:18:55] [INFO ] Redundant transitions in 183 ms returned []
[2022-06-08 22:18:55] [INFO ] Flow matrix only has 2621 transitions (discarded 124 similar events)
// Phase 1: matrix 2621 rows 232 cols
[2022-06-08 22:18:55] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 22:18:56] [INFO ] Dead Transitions using invariants and state equation in 687 ms returned []
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 2745/2745 transitions.
Incomplete random walk after 100000 steps, including 2344 resets, run finished after 638 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-08 22:18:57] [INFO ] Flow matrix only has 2621 transitions (discarded 124 similar events)
// Phase 1: matrix 2621 rows 232 cols
[2022-06-08 22:18:57] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:18:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:57] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2022-06-08 22:18:57] [INFO ] State equation strengthened by 252 read => feed constraints.
[2022-06-08 22:18:57] [INFO ] [Real]Added 252 Read/Feed constraints in 106 ms returned sat
[2022-06-08 22:18:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:18:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:58] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-06-08 22:18:58] [INFO ] [Nat]Added 252 Read/Feed constraints in 123 ms returned sat
[2022-06-08 22:18:58] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 0 ms to minimize.
[2022-06-08 22:18:58] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 0 ms to minimize.
[2022-06-08 22:18:59] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 0 ms to minimize.
[2022-06-08 22:18:59] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-06-08 22:18:59] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-06-08 22:18:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1554 ms
[2022-06-08 22:19:00] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 345 ms.
[2022-06-08 22:19:02] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2022-06-08 22:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2022-06-08 22:19:02] [INFO ] Added : 84 causal constraints over 17 iterations in 2530 ms. Result :sat
[2022-06-08 22:19:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:02] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-06-08 22:19:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:19:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:03] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-06-08 22:19:03] [INFO ] [Nat]Added 252 Read/Feed constraints in 113 ms returned sat
[2022-06-08 22:19:03] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2022-06-08 22:19:03] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2022-06-08 22:19:03] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 0 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 0 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 1 ms to minimize.
[2022-06-08 22:19:04] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-06-08 22:19:05] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 0 ms to minimize.
[2022-06-08 22:19:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2029 ms
[2022-06-08 22:19:05] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 146 ms.
[2022-06-08 22:19:07] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 1 ms to minimize.
[2022-06-08 22:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2022-06-08 22:19:08] [INFO ] Added : 101 causal constraints over 21 iterations in 2911 ms. Result :sat
[2022-06-08 22:19:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:08] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-06-08 22:19:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:19:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:08] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2022-06-08 22:19:09] [INFO ] [Nat]Added 252 Read/Feed constraints in 129 ms returned sat
[2022-06-08 22:19:09] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2022-06-08 22:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2022-06-08 22:19:09] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 141 ms.
[2022-06-08 22:19:11] [INFO ] Deduced a trap composed of 49 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:19:11] [INFO ] Deduced a trap composed of 76 places in 286 ms of which 0 ms to minimize.
[2022-06-08 22:19:12] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 0 ms to minimize.
[2022-06-08 22:19:12] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 1 ms to minimize.
[2022-06-08 22:19:13] [INFO ] Deduced a trap composed of 76 places in 288 ms of which 1 ms to minimize.
[2022-06-08 22:19:13] [INFO ] Deduced a trap composed of 76 places in 287 ms of which 1 ms to minimize.
[2022-06-08 22:19:13] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 0 ms to minimize.
[2022-06-08 22:19:14] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 0 ms to minimize.
[2022-06-08 22:19:14] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 0 ms to minimize.
[2022-06-08 22:19:14] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 0 ms to minimize.
[2022-06-08 22:19:15] [INFO ] Deduced a trap composed of 49 places in 262 ms of which 1 ms to minimize.
[2022-06-08 22:19:15] [INFO ] Deduced a trap composed of 78 places in 267 ms of which 0 ms to minimize.
[2022-06-08 22:19:15] [INFO ] Deduced a trap composed of 49 places in 262 ms of which 1 ms to minimize.
[2022-06-08 22:19:16] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 0 ms to minimize.
[2022-06-08 22:19:16] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 1 ms to minimize.
[2022-06-08 22:19:17] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:19:17] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:19:17] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 1 ms to minimize.
[2022-06-08 22:19:18] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 0 ms to minimize.
[2022-06-08 22:19:18] [INFO ] Deduced a trap composed of 51 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:19:18] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:19:19] [INFO ] Deduced a trap composed of 75 places in 296 ms of which 1 ms to minimize.
[2022-06-08 22:19:19] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 0 ms to minimize.
[2022-06-08 22:19:20] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 0 ms to minimize.
[2022-06-08 22:19:20] [INFO ] Deduced a trap composed of 106 places in 310 ms of which 0 ms to minimize.
[2022-06-08 22:19:20] [INFO ] Deduced a trap composed of 105 places in 297 ms of which 1 ms to minimize.
[2022-06-08 22:19:21] [INFO ] Deduced a trap composed of 101 places in 311 ms of which 1 ms to minimize.
[2022-06-08 22:19:21] [INFO ] Deduced a trap composed of 110 places in 302 ms of which 1 ms to minimize.
[2022-06-08 22:19:22] [INFO ] Deduced a trap composed of 110 places in 298 ms of which 0 ms to minimize.
[2022-06-08 22:19:22] [INFO ] Deduced a trap composed of 74 places in 299 ms of which 0 ms to minimize.
[2022-06-08 22:19:22] [INFO ] Deduced a trap composed of 75 places in 294 ms of which 0 ms to minimize.
[2022-06-08 22:19:23] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 1 ms to minimize.
[2022-06-08 22:19:23] [INFO ] Deduced a trap composed of 75 places in 308 ms of which 1 ms to minimize.
[2022-06-08 22:19:24] [INFO ] Deduced a trap composed of 75 places in 285 ms of which 0 ms to minimize.
[2022-06-08 22:19:24] [INFO ] Deduced a trap composed of 75 places in 280 ms of which 1 ms to minimize.
[2022-06-08 22:19:24] [INFO ] Deduced a trap composed of 75 places in 284 ms of which 0 ms to minimize.
[2022-06-08 22:19:25] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 0 ms to minimize.
[2022-06-08 22:19:25] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 0 ms to minimize.
[2022-06-08 22:19:26] [INFO ] Deduced a trap composed of 74 places in 286 ms of which 1 ms to minimize.
[2022-06-08 22:19:26] [INFO ] Deduced a trap composed of 108 places in 291 ms of which 0 ms to minimize.
[2022-06-08 22:19:26] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 0 ms to minimize.
[2022-06-08 22:19:27] [INFO ] Deduced a trap composed of 75 places in 289 ms of which 1 ms to minimize.
[2022-06-08 22:19:27] [INFO ] Deduced a trap composed of 52 places in 296 ms of which 0 ms to minimize.
[2022-06-08 22:19:27] [INFO ] Deduced a trap composed of 115 places in 276 ms of which 0 ms to minimize.
[2022-06-08 22:19:28] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 0 ms to minimize.
[2022-06-08 22:19:28] [INFO ] Deduced a trap composed of 54 places in 294 ms of which 1 ms to minimize.
[2022-06-08 22:19:28] [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-08 22:19:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:29] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-06-08 22:19:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:19:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:19:29] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-06-08 22:19:29] [INFO ] [Nat]Added 252 Read/Feed constraints in 123 ms returned sat
[2022-06-08 22:19:29] [INFO ] Deduced a trap composed of 7 places in 308 ms of which 0 ms to minimize.
[2022-06-08 22:19:30] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 0 ms to minimize.
[2022-06-08 22:19:30] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 3 ms to minimize.
[2022-06-08 22:19:30] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 1 ms to minimize.
[2022-06-08 22:19:31] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2022-06-08 22:19:31] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 4 ms to minimize.
[2022-06-08 22:19:31] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 2 ms to minimize.
[2022-06-08 22:19:31] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2022-06-08 22:19:32] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2022-06-08 22:19:32] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2022-06-08 22:19:32] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2022-06-08 22:19:32] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2022-06-08 22:19:32] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 8 ms to minimize.
[2022-06-08 22:19:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3374 ms
[2022-06-08 22:19:33] [INFO ] Computed and/alt/rep : 345/1347/345 causal constraints (skipped 2274 transitions) in 184 ms.
[2022-06-08 22:19:34] [INFO ] Added : 61 causal constraints over 13 iterations in 1659 ms. Result :sat
[2022-06-08 22:19:34] [INFO ] Flatten gal took : 121 ms
[2022-06-08 22:19:34] [INFO ] Flatten gal took : 120 ms
[2022-06-08 22:19:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15342695936188446175.gal : 15 ms
[2022-06-08 22:19:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14850524223608162095.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15342695936188446175.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14850524223608162095.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/ReachabilityCardinality15342695936188446175.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14850524223608162095.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14850524223608162095.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 134
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :134 after 464
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :464 after 1114
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1114 after 2404
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2404 after 4974
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4974 after 10104
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :10104 after 20354
Detected timeout of ITS tools.
[2022-06-08 22:19:50] [INFO ] Flatten gal took : 113 ms
[2022-06-08 22:19:50] [INFO ] Applying decomposition
[2022-06-08 22:19:50] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9683952434311467579.txt, -o, /tmp/graph9683952434311467579.bin, -w, /tmp/graph9683952434311467579.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/graph9683952434311467579.bin, -l, -1, -v, -w, /tmp/graph9683952434311467579.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 22:19:50] [INFO ] Decomposing Gal with order
[2022-06-08 22:19:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:19:50] [INFO ] Removed a total of 337 redundant transitions.
[2022-06-08 22:19:50] [INFO ] Flatten gal took : 187 ms
[2022-06-08 22:19:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 13 ms.
[2022-06-08 22:19:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17542490716723839037.gal : 12 ms
[2022-06-08 22:19:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4005729819043787650.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/ReachabilityCardinality17542490716723839037.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4005729819043787650.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/ReachabilityCardinality17542490716723839037.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4005729819043787650.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4005729819043787650.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :14 after 30
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :30 after 66
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :66 after 89
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :89 after 101
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :101 after 108
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :108 after 298
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :298 after 395
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :395 after 474
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :474 after 1079
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1079 after 2121
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2121 after 6465
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6465 after 25361
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :25361 after 124217
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6603266738002073688
[2022-06-08 22:20:05] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6603266738002073688
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/ltsmin6603266738002073688]
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/ltsmin6603266738002073688] 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/ltsmin6603266738002073688] 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)
Drop transitions removed 6 transitions
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 232 transition count 2620
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 232 transition count 2617
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 131 place count 229 transition count 2617
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 229 transition count 2616
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 158 place count 229 transition count 2616
Applied a total of 158 rules in 214 ms. Remains 229 /232 variables (removed 3) and now considering 2616/2745 (removed 129) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2616 rows 229 cols
[2022-06-08 22:20:07] [INFO ] Computed 9 place invariants in 11 ms
[2022-06-08 22:20:07] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:07] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-06-08 22:20:07] [INFO ] Computed and/alt/rep : 433/1493/433 causal constraints (skipped 2181 transitions) in 199 ms.
[2022-06-08 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:20:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:08] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-06-08 22:20:08] [INFO ] Computed and/alt/rep : 433/1493/433 causal constraints (skipped 2181 transitions) in 149 ms.
[2022-06-08 22:20:08] [INFO ] Added : 10 causal constraints over 4 iterations in 579 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-08 22:20:08] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:09] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-06-08 22:20:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:20:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:09] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2022-06-08 22:20:09] [INFO ] Computed and/alt/rep : 433/1493/433 causal constraints (skipped 2181 transitions) in 160 ms.
[2022-06-08 22:20:10] [INFO ] Added : 7 causal constraints over 2 iterations in 450 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-08 22:20:10] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:10] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-06-08 22:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:20:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:11] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2022-06-08 22:20:11] [INFO ] Computed and/alt/rep : 433/1493/433 causal constraints (skipped 2181 transitions) in 163 ms.
[2022-06-08 22:20:11] [INFO ] Added : 7 causal constraints over 2 iterations in 457 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-08 22:20:11] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:12] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2022-06-08 22:20:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:20:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 22:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:20:12] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-06-08 22:20:12] [INFO ] Computed and/alt/rep : 433/1493/433 causal constraints (skipped 2181 transitions) in 146 ms.
[2022-06-08 22:20:12] [INFO ] Added : 9 causal constraints over 2 iterations in 417 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-08 22:20:13] [INFO ] Flatten gal took : 117 ms
Using solver Z3 to compute partial order matrices.
[2022-06-08 22:20:13] [INFO ] Flatten gal took : 145 ms
Built C files in :
/tmp/ltsmin1170788879933100418
[2022-06-08 22:20:13] [INFO ] Too many transitions (2745) to apply POR reductions. Disabling POR matrices.
[2022-06-08 22:20:13] [INFO ] Input system was already deterministic with 2745 transitions.
[2022-06-08 22:20:13] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1170788879933100418
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/ltsmin1170788879933100418]
[2022-06-08 22:20:13] [INFO ] Applying decomposition
[2022-06-08 22:20:13] [INFO ] Flatten gal took : 198 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/graph6897032243556598754.txt, -o, /tmp/graph6897032243556598754.bin, -w, /tmp/graph6897032243556598754.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/graph6897032243556598754.bin, -l, -1, -v, -w, /tmp/graph6897032243556598754.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 22:20:14] [INFO ] Decomposing Gal with order
[2022-06-08 22:20:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:20:14] [INFO ] Ran tautology test, simplified 0 / 4 in 1084 ms.
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=0 took 17 ms
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=0 took 2 ms
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=0 took 2 ms
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
[2022-06-08 22:20:14] [INFO ] Removed a total of 337 redundant transitions.
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=1 took 14 ms
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=1 took 3 ms
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=1 took 2 ms
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=1 took 11 ms
[2022-06-08 22:20:14] [INFO ] Flatten gal took : 303 ms
[2022-06-08 22:20:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 10 ms.
[2022-06-08 22:20:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7237145969782251327.gal : 15 ms
[2022-06-08 22:20:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12344782467102834445.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7237145969782251327.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12344782467102834445.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/ReachabilityCardinality7237145969782251327.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12344782467102834445.prop --nowitness
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=2 took 244 ms
[2022-06-08 22:20:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=2 took 43 ms
[2022-06-08 22:20:15] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=2 took 81 ms
[2022-06-08 22:20:15] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=2 took 47 ms
Loading property file /tmp/ReachabilityCardinality12344782467102834445.prop.
[2022-06-08 22:20:15] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=3 took 253 ms
[2022-06-08 22:20:15] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=3 took 94 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 2621 out of 2745 initially.
// Phase 1: matrix 2621 rows 232 cols
[2022-06-08 22:20:15] [INFO ] Computed 8 place invariants in 19 ms
inv : l19 + l20 + l23 + l24 = 1
inv : x4_BUG_REPORT_q0 + x4_BUG_REPORT_q6 + x4_BUG_REPORT_q8 + x4_CLOSED_q0 + x4_CLOSED_q6 + x4_CLOSED_q8 + x4_FIXED_q6 + x4_FIXED_q8 + x4_FIX_AGAIN_q6 + x4_FIX_AGAIN_q8 + x4_MORE_INFO_q6 + x4_MORE_INFO_q8 + x4_MUST_FIX_q0 + x4_MUST_FIX_q6 + x4_MUST_FIX_q8 + x4_PENDING_q6 + x4_PENDING_q8 + x4_VERIFIED_q6 + x4_VERIFIED_q8 = 1
inv : l25 + l26 + l27 + l28 + l29 + l30 + l31 = 1
inv : x0_BUG_REPORT_q0 + x0_BUG_REPORT_q2 + x0_BUG_REPORT_q3 + x0_BUG_REPORT_q5 + x0_BUG_REPORT_q7 + x0_BUG_REPORT_q8 + x0_CLOSED_q7 + x0_CLOSED_q8 + x0_FIXED_q3 + x0_FIXED_q5 + x0_FIXED_q7 + x0_FIXED_q8 + x0_FIX_AGAIN_q5 + x0_FIX_AGAIN_q7 + x0_FIX_AGAIN_q8 + x0_MORE_INFO_q2 + x0_MORE_INFO_q3 + x0_MORE_INFO_q5 + x0_MORE_INFO_q7 + x0_MORE_INFO_q8 + x0_MUST_FIX_q7 + x0_MUST_FIX_q8 + x0_PENDING_q3 + x0_PENDING_q5 + x0_PENDING_q7 + x0_PENDING_q8 + x0_VERIFIED_q5 + x0_VERIFIED_q7 + x0_VERIFIED_q8 = 1
inv : x3_BUG_REPORT_q0 + x3_BUG_REPORT_q3 + x3_BUG_REPORT_q5 + x3_BUG_REPORT_q8 + x3_CLOSED_q8 + x3_FIXED_q3 + x3_FIXED_q5 + x3_FIXED_q8 + x3_FIX_AGAIN_q0 + x3_FIX_AGAIN_q3 + x3_FIX_AGAIN_q5 + x3_FIX_AGAIN_q8 + x3_MORE_INFO_q3 + x3_MORE_INFO_q5 + x3_MORE_INFO_q8 + x3_MUST_FIX_q8 + x3_PENDING_q3 + x3_PENDING_q5 + x3_PENDING_q8 + x3_VERIFIED_q0 + x3_VERIFIED_q3 + x3_VERIFIED_q5 + x3_VERIFIED_q8 = 1
inv : x1_BUG_REPORT_q0 + x1_BUG_REPORT_q1 + x1_BUG_REPORT_q8 + x1_CLOSED_q8 + x1_FIXED_q8 + x1_FIX_AGAIN_q8 + x1_MORE_INFO_q0 + x1_MORE_INFO_q1 + x1_MORE_INFO_q8 + x1_MUST_FIX_q8 + x1_PENDING_q8 + x1_VERIFIED_q8 = 1
inv : l5 + l6 + l9 = 1
inv : x2_BUG_REPORT_q0 + x2_BUG_REPORT_q2 + x2_BUG_REPORT_q6 + x2_BUG_REPORT_q7 + x2_BUG_REPORT_q8 + x2_CLOSED_q7 + x2_CLOSED_q8 + x2_FIXED_q0 + x2_FIXED_q2 + x2_FIXED_q6 + x2_FIXED_q7 + x2_FIXED_q8 + x2_FIX_AGAIN_q6 + x2_FIX_AGAIN_q7 + x2_FIX_AGAIN_q8 + x2_MORE_INFO_q2 + x2_MORE_INFO_q6 + x2_MORE_INFO_q7 + x2_MORE_INFO_q8 + x2_MUST_FIX_q7 + x2_MUST_FIX_q8 + x2_PENDING_q0 + x2_PENDING_q2 + x2_PENDING_q6 + x2_PENDING_q7 + x2_PENDING_q8 + x2_VERIFIED_q6 + x2_VERIFIED_q7 + x2_VERIFIED_q8 = 1
Total of 8 invariants.
[2022-06-08 22:20:15] [INFO ] Computed 8 place invariants in 23 ms
SDD proceeding with computation,4 properties remain. new max is 4
[2022-06-08 22:20:15] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=3 took 189 ms
SDD size :1 after 14
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :14 after 30
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :30 after 66
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :66 after 89
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :89 after 101
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :101 after 108
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :108 after 316
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :316 after 426
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :426 after 514
[2022-06-08 22:20:16] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=3 took 358 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :514 after 1068
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1068 after 2197
[2022-06-08 22:20:17] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=4 took 1819 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2197 after 6417
[2022-06-08 22:20:22] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=4 took 4526 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6417 after 25283
[2022-06-08 22:20:23] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=4 took 826 ms
[2022-06-08 22:20:24] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=4 took 792 ms
[2022-06-08 22:20:31] [INFO ] Proved 232 variables to be positive in 15875 ms
[2022-06-08 22:20:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-00
[2022-06-08 22:20:31] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(SAT) depth K=0 took 18 ms
[2022-06-08 22:20:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-03
[2022-06-08 22:20:31] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(SAT) depth K=0 took 32 ms
[2022-06-08 22:20:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-11
[2022-06-08 22:20:31] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(SAT) depth K=0 took 20 ms
[2022-06-08 22:20:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-15
[2022-06-08 22:20:31] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(SAT) depth K=0 took 24 ms
[2022-06-08 22:20:32] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=5 took 8863 ms
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :25283 after 129573
[2022-06-08 22:20:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-00
[2022-06-08 22:20:35] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(SAT) depth K=1 took 4254 ms
[2022-06-08 22:20:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-03
[2022-06-08 22:20:41] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(SAT) depth K=1 took 5696 ms
[2022-06-08 22:20:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-11
[2022-06-08 22:20:44] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(SAT) depth K=1 took 2593 ms
[2022-06-08 22:20:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-15
[2022-06-08 22:20:47] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(SAT) depth K=1 took 3458 ms
Compilation finished in 35023 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1170788879933100418]
Link finished in 155 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, BugTrackingPTq3m002ReachabilityCardinality00==true], workingDir=/tmp/ltsmin1170788879933100418]
[2022-06-08 22:21:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=5 took 41436 ms
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :129573 after 800343
[2022-06-08 22:21:33] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=5 took 18643 ms
[2022-06-08 22:22:35] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=5 took 62972 ms
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :800343 after 5.49448e+06
[2022-06-08 22:27:41] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=6 took 305141 ms
[2022-06-08 22:30:03] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=6 took 142164 ms
[2022-06-08 22:30:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-00
[2022-06-08 22:30:03] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(SAT) depth K=2 took 555665 ms
[2022-06-08 22:30:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-03
[2022-06-08 22:30:46] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(SAT) depth K=2 took 43177 ms
[2022-06-08 22:31:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-11
[2022-06-08 22:31:26] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(SAT) depth K=2 took 40014 ms
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :5.49448e+06 after 7.95565e+06
[2022-06-08 22:33:04] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=6 took 181124 ms
[2022-06-08 22:34:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-15
[2022-06-08 22:34:29] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(SAT) depth K=2 took 183314 ms
WARNING : LTSmin timed out (>900 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq3m002ReachabilityCardinality00==true], workingDir=/tmp/ltsmin1170788879933100418]
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, BugTrackingPTq3m002ReachabilityCardinality03==true], workingDir=/tmp/ltsmin1170788879933100418]
[2022-06-08 22:36:43] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=6 took 219386 ms
[2022-06-08 22:40:57] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(UNSAT) depth K=7 took 253420 ms
Detected timeout of ITS tools.
[2022-06-08 22:41:59] [INFO ] Applying decomposition
[2022-06-08 22:41:59] [INFO ] Flatten gal took : 361 ms
[2022-06-08 22:42:00] [INFO ] Decomposing Gal with order
[2022-06-08 22:42:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:42:00] [INFO ] Removed a total of 337 redundant transitions.
[2022-06-08 22:42:00] [INFO ] Flatten gal took : 514 ms
[2022-06-08 22:42:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 21 ms.
[2022-06-08 22:42:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2740481941910116727.gal : 45 ms
[2022-06-08 22:42:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15495154524623528347.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/ReachabilityCardinality2740481941910116727.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15495154524623528347.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/ReachabilityCardinality2740481941910116727.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15495154524623528347.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15495154524623528347.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :14 after 30
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :30 after 66
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :66 after 85
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :85 after 93
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :93 after 117
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :117 after 308
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :308 after 440
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :440 after 534
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :534 after 990
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :990 after 2101
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2101 after 5458
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5458 after 18402
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :18402 after 82434
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :82434 after 502149
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :502149 after 3.2188e+06
[2022-06-08 22:50:11] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-03(UNSAT) depth K=7 took 554435 ms
WARNING : LTSmin timed out (>900 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq3m002ReachabilityCardinality03==true], workingDir=/tmp/ltsmin1170788879933100418]
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, BugTrackingPTq3m002ReachabilityCardinality11==true], workingDir=/tmp/ltsmin1170788879933100418]
[2022-06-08 23:02:14] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-11(UNSAT) depth K=7 took 722814 ms
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :3.2188e+06 after 2.35563e+07
Detected timeout of ITS tools.
[2022-06-08 23:03:45] [INFO ] Flatten gal took : 309 ms
[2022-06-08 23:03:46] [INFO ] Input system was already deterministic with 2745 transitions.
[2022-06-08 23:03:46] [INFO ] Transformed 232 places.
[2022-06-08 23:03:46] [INFO ] Transformed 2745 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-08 23:03:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2520028968055292697.gal : 17 ms
[2022-06-08 23:03:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15422109570056259118.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2520028968055292697.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15422109570056259118.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/ReachabilityCardinality2520028968055292697.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15422109570056259118.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/ReachabilityCardinality15422109570056259118.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :11 after 15
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :15 after 73
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :73 after 440
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :440 after 2416
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2416 after 15055
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :15055 after 118561
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :118561 after 905526
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :905526 after 7.3062e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :7.3062e+06 after 5.75193e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5.75193e+07 after 4.59812e+08
WARNING : LTSmin timed out (>900 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, BugTrackingPTq3m002ReachabilityCardinality11==true], workingDir=/tmp/ltsmin1170788879933100418]
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, BugTrackingPTq3m002ReachabilityCardinality15==true], workingDir=/tmp/ltsmin1170788879933100418]
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4.59812e+08 after 3.67579e+09
[2022-06-08 23:09:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m002-ReachabilityCardinality-00
[2022-06-08 23:09:01] [INFO ] KInduction solution for property BugTracking-PT-q3m002-ReachabilityCardinality-00(SAT) depth K=3 took 2071066 ms
[2022-06-08 23:12:41] [INFO ] BMC solution for property BugTracking-PT-q3m002-ReachabilityCardinality-15(UNSAT) depth K=7 took 626995 ms

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q3m002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292500002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m002.tgz
mv BugTracking-PT-q3m002 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;