About the Execution of 2021-gold for BugTracking-PT-q3m032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9428.936 | 3600000.00 | 13596788.00 | 1090.80 | TFTF??F?TFT?FFFT | normal |
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-165472292500014.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-q3m032, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500014
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 16:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 16:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 19K Jun 7 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Jun 7 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q3m032-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654730179164
Running Version 0
[2022-06-08 23:16:20] [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 23:16:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:16:21] [INFO ] Load time of PNML (sax parser for PT used): 841 ms
[2022-06-08 23:16:21] [INFO ] Transformed 754 places.
[2022-06-08 23:16:21] [INFO ] Transformed 27370 transitions.
[2022-06-08 23:16:21] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 982 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 97 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 29 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2013277 steps, run timeout after 30001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 2013277 steps, saw 1064226 distinct states, run finished after 30009 ms. (steps per millisecond=67 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-08 23:16:52] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 23:16:52] [INFO ] Computed 10 place invariants in 34 ms
[2022-06-08 23:16:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-08 23:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:52] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2022-06-08 23:16:52] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 23:16:53] [INFO ] [Real]Added 268 Read/Feed constraints in 116 ms returned sat
[2022-06-08 23:16:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 23:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:53] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-06-08 23:16:53] [INFO ] [Nat]Added 268 Read/Feed constraints in 123 ms returned sat
[2022-06-08 23:16:54] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 5 ms to minimize.
[2022-06-08 23:16:54] [INFO ] Deduced a trap composed of 121 places in 342 ms of which 2 ms to minimize.
[2022-06-08 23:16:54] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 1 ms to minimize.
[2022-06-08 23:16:55] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:16:55] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2022-06-08 23:16:55] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 0 ms to minimize.
[2022-06-08 23:16:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1996 ms
[2022-06-08 23:16:55] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 198 ms.
[2022-06-08 23:16:58] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 0 ms to minimize.
[2022-06-08 23:16:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-08 23:16:58] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 23:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:58] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-08 23:16:58] [INFO ] [Real]Added 268 Read/Feed constraints in 117 ms returned sat
[2022-06-08 23:16:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:59] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-06-08 23:16:59] [INFO ] [Nat]Added 268 Read/Feed constraints in 123 ms returned sat
[2022-06-08 23:16:59] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 1 ms to minimize.
[2022-06-08 23:16:59] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:16:59] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2022-06-08 23:17:00] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:17:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1054 ms
[2022-06-08 23:17:00] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 198 ms.
[2022-06-08 23:17:02] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 1 ms to minimize.
[2022-06-08 23:17:03] [INFO ] Deduced a trap composed of 73 places in 303 ms of which 0 ms to minimize.
[2022-06-08 23:17:03] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 1 ms to minimize.
[2022-06-08 23:17:03] [INFO ] Deduced a trap composed of 108 places in 348 ms of which 1 ms to minimize.
[2022-06-08 23:17:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-08 23:17:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 23:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:04] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-06-08 23:17:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:04] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-06-08 23:17:04] [INFO ] [Nat]Added 268 Read/Feed constraints in 128 ms returned sat
[2022-06-08 23:17:05] [INFO ] Deduced a trap composed of 106 places in 275 ms of which 0 ms to minimize.
[2022-06-08 23:17:05] [INFO ] Deduced a trap composed of 113 places in 288 ms of which 0 ms to minimize.
[2022-06-08 23:17:05] [INFO ] Deduced a trap composed of 114 places in 275 ms of which 0 ms to minimize.
[2022-06-08 23:17:06] [INFO ] Deduced a trap composed of 106 places in 274 ms of which 0 ms to minimize.
[2022-06-08 23:17:06] [INFO ] Deduced a trap composed of 111 places in 303 ms of which 1 ms to minimize.
[2022-06-08 23:17:06] [INFO ] Deduced a trap composed of 87 places in 288 ms of which 0 ms to minimize.
[2022-06-08 23:17:07] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2022-06-08 23:17:07] [INFO ] Deduced a trap composed of 105 places in 283 ms of which 0 ms to minimize.
[2022-06-08 23:17:07] [INFO ] Deduced a trap composed of 105 places in 277 ms of which 0 ms to minimize.
[2022-06-08 23:17:08] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 1 ms to minimize.
[2022-06-08 23:17:08] [INFO ] Deduced a trap composed of 69 places in 307 ms of which 1 ms to minimize.
[2022-06-08 23:17:09] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 1 ms to minimize.
[2022-06-08 23:17:09] [INFO ] Deduced a trap composed of 113 places in 276 ms of which 1 ms to minimize.
[2022-06-08 23:17:09] [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 23:17:09] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:09] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2022-06-08 23:17:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:10] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2022-06-08 23:17:10] [INFO ] [Nat]Added 268 Read/Feed constraints in 144 ms returned sat
[2022-06-08 23:17:10] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2022-06-08 23:17:10] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2022-06-08 23:17:10] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2022-06-08 23:17:11] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2022-06-08 23:17:11] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2022-06-08 23:17:11] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2022-06-08 23:17:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1284 ms
[2022-06-08 23:17:11] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 142 ms.
[2022-06-08 23:17:13] [INFO ] Deduced a trap composed of 60 places in 285 ms of which 0 ms to minimize.
[2022-06-08 23:17:14] [INFO ] Deduced a trap composed of 46 places in 284 ms of which 0 ms to minimize.
[2022-06-08 23:17:14] [INFO ] Deduced a trap composed of 75 places in 285 ms of which 0 ms to minimize.
[2022-06-08 23:17:14] [INFO ] Deduced a trap composed of 75 places in 288 ms of which 1 ms to minimize.
[2022-06-08 23:17:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Fused 4 Parikh solutions to 1 different solutions.
Support contains 12 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.8 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
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 235 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/240 places, 2747/2769 transitions.
[2022-06-08 23:17:15] [INFO ] Flatten gal took : 284 ms
[2022-06-08 23:17:15] [INFO ] Flatten gal took : 166 ms
[2022-06-08 23:17:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8162174822154919729.gal : 52 ms
[2022-06-08 23:17:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15341306108399660138.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/ReachabilityCardinality8162174822154919729.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15341306108399660138.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/ReachabilityCardinality8162174822154919729.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15341306108399660138.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15341306108399660138.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 527
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :527 after 2672
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2672 after 6929
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6929 after 15410
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15410 after 32339
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :32339 after 66164
Detected timeout of ITS tools.
[2022-06-08 23:17:31] [INFO ] Flatten gal took : 152 ms
[2022-06-08 23:17:31] [INFO ] Applying decomposition
[2022-06-08 23:17:31] [INFO ] Flatten gal took : 127 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/graph1178756392167918221.txt, -o, /tmp/graph1178756392167918221.bin, -w, /tmp/graph1178756392167918221.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/graph1178756392167918221.bin, -l, -1, -v, -w, /tmp/graph1178756392167918221.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:17:31] [INFO ] Decomposing Gal with order
[2022-06-08 23:17:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:17:31] [INFO ] Removed a total of 293 redundant transitions.
[2022-06-08 23:17:32] [INFO ] Flatten gal took : 330 ms
[2022-06-08 23:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 25 ms.
[2022-06-08 23:17:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4957857874794239488.gal : 20 ms
[2022-06-08 23:17:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11697028580446006281.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/ReachabilityCardinality4957857874794239488.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11697028580446006281.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/ReachabilityCardinality4957857874794239488.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11697028580446006281.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11697028580446006281.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 131
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :131 after 2276
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2276 after 6533
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6533 after 15014
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15014 after 31943
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31943 after 65768
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :65768 after 133385
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16706414837217028276
[2022-06-08 23:17:47] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16706414837217028276
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/ltsmin16706414837217028276]
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/ltsmin16706414837217028276] 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/ltsmin16706414837217028276] 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 1000002 steps, including 2 resets, run finished after 2325 ms. (steps per millisecond=430 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2153 ms. (steps per millisecond=464 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2319 ms. (steps per millisecond=431 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2268 ms. (steps per millisecond=440 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1948881 steps, run timeout after 30001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 1948881 steps, saw 956610 distinct states, run finished after 30001 ms. (steps per millisecond=64 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-08 23:18:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:29] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:18:29] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:29] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2022-06-08 23:18:29] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:18:29] [INFO ] [Real]Added 254 Read/Feed constraints in 118 ms returned sat
[2022-06-08 23:18:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:30] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-06-08 23:18:30] [INFO ] [Nat]Added 254 Read/Feed constraints in 126 ms returned sat
[2022-06-08 23:18:30] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:18:31] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 1 ms to minimize.
[2022-06-08 23:18:31] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:18:31] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:18:31] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2022-06-08 23:18:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1334 ms
[2022-06-08 23:18:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2022-06-08 23:18:34] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:18:34] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-06-08 23:18:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 576 ms
[2022-06-08 23:18:35] [INFO ] Added : 98 causal constraints over 21 iterations in 3132 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-08 23:18:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:35] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2022-06-08 23:18:35] [INFO ] [Real]Added 254 Read/Feed constraints in 111 ms returned sat
[2022-06-08 23:18:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:36] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2022-06-08 23:18:36] [INFO ] [Nat]Added 254 Read/Feed constraints in 119 ms returned sat
[2022-06-08 23:18:36] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:18:36] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:18:36] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:18:37] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:18:37] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2022-06-08 23:18:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1325 ms
[2022-06-08 23:18:37] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 139 ms.
[2022-06-08 23:18:40] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2022-06-08 23:18:40] [INFO ] Added : 97 causal constraints over 20 iterations in 2697 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-08 23:18:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:40] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2022-06-08 23:18:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-08 23:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:41] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-06-08 23:18:41] [INFO ] [Nat]Added 254 Read/Feed constraints in 125 ms returned sat
[2022-06-08 23:18:41] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:18:41] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:18:41] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 1 ms to minimize.
[2022-06-08 23:18:42] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:18:42] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 0 ms to minimize.
[2022-06-08 23:18:42] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 1 ms to minimize.
[2022-06-08 23:18:42] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2022-06-08 23:18:43] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 1 ms to minimize.
[2022-06-08 23:18:43] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 1 ms to minimize.
[2022-06-08 23:18:43] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 0 ms to minimize.
[2022-06-08 23:18:43] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2022-06-08 23:18:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2765 ms
[2022-06-08 23:18:44] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 138 ms.
[2022-06-08 23:18:46] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 10 ms to minimize.
[2022-06-08 23:18:46] [INFO ] Deduced a trap composed of 50 places in 318 ms of which 1 ms to minimize.
[2022-06-08 23:18:46] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 0 ms to minimize.
[2022-06-08 23:18:47] [INFO ] Deduced a trap composed of 99 places in 288 ms of which 1 ms to minimize.
[2022-06-08 23:18:47] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 0 ms to minimize.
[2022-06-08 23:18:47] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 1 ms to minimize.
[2022-06-08 23:18:48] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:18:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2729 ms
[2022-06-08 23:18:48] [INFO ] Added : 75 causal constraints over 15 iterations in 4606 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-08 23:18:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:48] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-06-08 23:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:49] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2022-06-08 23:18:49] [INFO ] [Nat]Added 254 Read/Feed constraints in 126 ms returned sat
[2022-06-08 23:18:49] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:18:49] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:18:50] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:18:50] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:18:50] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:18:50] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 1 ms to minimize.
[2022-06-08 23:18:51] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:18:51] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:18:51] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 1 ms to minimize.
[2022-06-08 23:18:52] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:18:52] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:18:52] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:18:52] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:18:53] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 7 ms to minimize.
[2022-06-08 23:18:53] [INFO ] Deduced a trap composed of 68 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:18:53] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:18:53] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:18:54] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:18:54] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:18:54] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:18:54] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:18:55] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:18:55] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:18:55] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:18:56] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 1 ms to minimize.
[2022-06-08 23:18:56] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:18:56] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:18:56] [INFO ] Deduced a trap composed of 72 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:18:57] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:18:57] [INFO ] Deduced a trap composed of 68 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:18:57] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:18:57] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:18:58] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 1 ms to minimize.
[2022-06-08 23:18:58] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:18:58] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:18:58] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:18:59] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 1 ms to minimize.
[2022-06-08 23:18:59] [INFO ] Deduced a trap composed of 70 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:18:59] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 1 ms to minimize.
[2022-06-08 23:18:59] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:19:00] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:00] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:00] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 1 ms to minimize.
[2022-06-08 23:19:00] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:19:01] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:19:01] [INFO ] Deduced a trap composed of 73 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:19:01] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 1 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:19:03] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:03] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:03] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:19:03] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:19:04] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:19:04] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:04] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 15006 ms
[2022-06-08 23:19:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 135 ms.
[2022-06-08 23:19:06] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 0 ms to minimize.
[2022-06-08 23:19:06] [INFO ] Deduced a trap composed of 70 places in 237 ms of which 0 ms to minimize.
[2022-06-08 23:19:07] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 1 ms to minimize.
[2022-06-08 23:19:07] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-06-08 23:19:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1289 ms
[2022-06-08 23:19:07] [INFO ] Added : 65 causal constraints over 17 iterations in 3477 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Incomplete Parikh walk after 1198100 steps, including 1000 resets, run finished after 12237 ms. (steps per millisecond=97 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1191000 steps, including 1000 resets, run finished after 11773 ms. (steps per millisecond=101 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 880500 steps, including 1000 resets, run finished after 8807 ms. (steps per millisecond=99 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 930400 steps, including 1000 resets, run finished after 9156 ms. (steps per millisecond=101 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 12 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 44 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:19:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:50] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:19:50] [INFO ] Implicit Places using invariants in 317 ms returned []
[2022-06-08 23:19:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:50] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:19:50] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:19:55] [INFO ] Implicit Places using invariants and state equation in 4718 ms returned []
Implicit Place search using SMT with State Equation took 5037 ms to find 0 implicit places.
[2022-06-08 23:19:55] [INFO ] Redundant transitions in 228 ms returned []
[2022-06-08 23:19:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:55] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 23:19:56] [INFO ] Dead Transitions using invariants and state equation in 736 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=411 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-08 23:19:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:56] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 23:19:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:56] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-06-08 23:19:56] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:19:56] [INFO ] [Real]Added 254 Read/Feed constraints in 109 ms returned sat
[2022-06-08 23:19:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:19:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:57] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-08 23:19:57] [INFO ] [Nat]Added 254 Read/Feed constraints in 129 ms returned sat
[2022-06-08 23:19:57] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:19:58] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:19:58] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:19:58] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:19:58] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2022-06-08 23:19:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1379 ms
[2022-06-08 23:19:59] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 283 ms.
[2022-06-08 23:20:01] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:20:01] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-06-08 23:20:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 598 ms
[2022-06-08 23:20:02] [INFO ] Added : 98 causal constraints over 21 iterations in 3428 ms. Result :sat
[2022-06-08 23:20:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:02] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-06-08 23:20:02] [INFO ] [Real]Added 254 Read/Feed constraints in 118 ms returned sat
[2022-06-08 23:20:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:03] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2022-06-08 23:20:03] [INFO ] [Nat]Added 254 Read/Feed constraints in 127 ms returned sat
[2022-06-08 23:20:03] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:20:03] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1357 ms
[2022-06-08 23:20:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 163 ms.
[2022-06-08 23:20:07] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 1 ms to minimize.
[2022-06-08 23:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2022-06-08 23:20:07] [INFO ] Added : 97 causal constraints over 20 iterations in 2864 ms. Result :sat
[2022-06-08 23:20:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:07] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-06-08 23:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:08] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2022-06-08 23:20:08] [INFO ] [Nat]Added 254 Read/Feed constraints in 137 ms returned sat
[2022-06-08 23:20:08] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:20:09] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:09] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:09] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:20:09] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:20:10] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:20:10] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:20:10] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:10] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:11] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:11] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:20:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2909 ms
[2022-06-08 23:20:11] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2022-06-08 23:20:13] [INFO ] Deduced a trap composed of 49 places in 313 ms of which 0 ms to minimize.
[2022-06-08 23:20:13] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 0 ms to minimize.
[2022-06-08 23:20:14] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 1 ms to minimize.
[2022-06-08 23:20:14] [INFO ] Deduced a trap composed of 99 places in 300 ms of which 0 ms to minimize.
[2022-06-08 23:20:15] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 0 ms to minimize.
[2022-06-08 23:20:15] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 0 ms to minimize.
[2022-06-08 23:20:15] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:20:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2735 ms
[2022-06-08 23:20:16] [INFO ] Added : 75 causal constraints over 15 iterations in 4663 ms. Result :sat
[2022-06-08 23:20:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:16] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-06-08 23:20:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:16] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-06-08 23:20:16] [INFO ] [Nat]Added 254 Read/Feed constraints in 136 ms returned sat
[2022-06-08 23:20:17] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:20:17] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:20:17] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:18] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:20:18] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:20:18] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:20:18] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:20:19] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:20:19] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:19] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 1 ms to minimize.
[2022-06-08 23:20:19] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:20:20] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:20] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:20:20] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:20:20] [INFO ] Deduced a trap composed of 68 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:20:21] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 1 ms to minimize.
[2022-06-08 23:20:21] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:21] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:20:22] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:20:22] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:22] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:20:22] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:20:23] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:20:23] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:23] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:20:23] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 1 ms to minimize.
[2022-06-08 23:20:24] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:20:24] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 1 ms to minimize.
[2022-06-08 23:20:24] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 1 ms to minimize.
[2022-06-08 23:20:24] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:25] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:20:25] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:20:25] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:26] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:26] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:26] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:20:26] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:20:27] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:20:27] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:20:27] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:20:27] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 1 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:29] [INFO ] Deduced a trap composed of 73 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:20:29] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:20:29] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:20:30] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:20:30] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:20:30] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:20:30] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:20:31] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:20:31] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:20:31] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:31] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:32] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:32] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 15304 ms
[2022-06-08 23:20:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2022-06-08 23:20:34] [INFO ] Deduced a trap composed of 14 places in 268 ms of which 0 ms to minimize.
[2022-06-08 23:20:34] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 1 ms to minimize.
[2022-06-08 23:20:34] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 1 ms to minimize.
[2022-06-08 23:20:35] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2022-06-08 23:20:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1306 ms
[2022-06-08 23:20:35] [INFO ] Added : 65 causal constraints over 17 iterations in 3482 ms. Result :sat
[2022-06-08 23:20:35] [INFO ] Flatten gal took : 122 ms
[2022-06-08 23:20:36] [INFO ] Flatten gal took : 125 ms
[2022-06-08 23:20:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16330512933754066888.gal : 17 ms
[2022-06-08 23:20:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11364429251538663423.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/ReachabilityCardinality16330512933754066888.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11364429251538663423.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/ReachabilityCardinality16330512933754066888.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11364429251538663423.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11364429251538663423.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 527
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :527 after 2672
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2672 after 6929
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6929 after 15410
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15410 after 32339
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :32339 after 66164
Detected timeout of ITS tools.
[2022-06-08 23:20:51] [INFO ] Flatten gal took : 114 ms
[2022-06-08 23:20:51] [INFO ] Applying decomposition
[2022-06-08 23:20:51] [INFO ] Flatten gal took : 119 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/graph13007732848922901789.txt, -o, /tmp/graph13007732848922901789.bin, -w, /tmp/graph13007732848922901789.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/graph13007732848922901789.bin, -l, -1, -v, -w, /tmp/graph13007732848922901789.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:20:51] [INFO ] Decomposing Gal with order
[2022-06-08 23:20:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:20:51] [INFO ] Removed a total of 293 redundant transitions.
[2022-06-08 23:20:51] [INFO ] Flatten gal took : 193 ms
[2022-06-08 23:20:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 16 ms.
[2022-06-08 23:20:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7628789364950734496.gal : 12 ms
[2022-06-08 23:20:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13522702969962036571.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/ReachabilityCardinality7628789364950734496.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13522702969962036571.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/ReachabilityCardinality7628789364950734496.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13522702969962036571.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13522702969962036571.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 98
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :98 after 2243
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2243 after 6500
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6500 after 14981
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14981 after 31910
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31910 after 65735
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17844053915254829757
[2022-06-08 23:21:06] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17844053915254829757
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/ltsmin17844053915254829757]
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/ltsmin17844053915254829757] 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/ltsmin17844053915254829757] 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 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 285 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2610 rows 223 cols
[2022-06-08 23:21:08] [INFO ] Computed 9 place invariants in 10 ms
[2022-06-08 23:21:08] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:08] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-06-08 23:21:08] [INFO ] Computed and/alt/rep : 422/1412/422 causal constraints (skipped 2187 transitions) in 145 ms.
[2022-06-08 23:21:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:09] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-06-08 23:21:09] [INFO ] Computed and/alt/rep : 422/1412/422 causal constraints (skipped 2187 transitions) in 149 ms.
[2022-06-08 23:21:09] [INFO ] Added : 5 causal constraints over 2 iterations in 430 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-08 23:21:10] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:10] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-06-08 23:21:10] [INFO ] Computed and/alt/rep : 422/1412/422 causal constraints (skipped 2187 transitions) in 147 ms.
[2022-06-08 23:21:10] [INFO ] Added : 2 causal constraints over 1 iterations in 358 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-08 23:21:10] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:11] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-06-08 23:21:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:11] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2022-06-08 23:21:11] [INFO ] Computed and/alt/rep : 422/1412/422 causal constraints (skipped 2187 transitions) in 147 ms.
[2022-06-08 23:21:12] [INFO ] Added : 5 causal constraints over 1 iterations in 388 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-08 23:21:12] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:12] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-08 23:21:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:12] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-06-08 23:21:13] [INFO ] Computed and/alt/rep : 422/1412/422 causal constraints (skipped 2187 transitions) in 146 ms.
[2022-06-08 23:21:13] [INFO ] Added : 5 causal constraints over 2 iterations in 424 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-08 23:21:13] [INFO ] Flatten gal took : 110 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6640809228781505495
[2022-06-08 23:21:13] [INFO ] Too many transitions (2747) to apply POR reductions. Disabling POR matrices.
[2022-06-08 23:21:13] [INFO ] Applying decomposition
[2022-06-08 23:21:13] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6640809228781505495
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/ltsmin6640809228781505495]
[2022-06-08 23:21:13] [INFO ] Flatten gal took : 135 ms
[2022-06-08 23:21:13] [INFO ] Flatten gal took : 114 ms
[2022-06-08 23:21:13] [INFO ] Input system was already deterministic with 2747 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6761189097492583791.txt, -o, /tmp/graph6761189097492583791.bin, -w, /tmp/graph6761189097492583791.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/graph6761189097492583791.bin, -l, -1, -v, -w, /tmp/graph6761189097492583791.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:21:14] [INFO ] Decomposing Gal with order
[2022-06-08 23:21:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:21:14] [INFO ] Removed a total of 293 redundant transitions.
[2022-06-08 23:21:14] [INFO ] Flatten gal took : 291 ms
[2022-06-08 23:21:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 31 ms.
[2022-06-08 23:21:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18187870213744235592.gal : 13 ms
[2022-06-08 23:21:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7965905698676118453.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/ReachabilityCardinality18187870213744235592.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7965905698676118453.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/ReachabilityCardinality18187870213744235592.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7965905698676118453.prop --nowitness --gen-order FOLLOW
[2022-06-08 23:21:14] [INFO ] Ran tautology test, simplified 0 / 4 in 1200 ms.
[2022-06-08 23:21:14] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=0 took 22 ms
[2022-06-08 23:21:14] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=0 took 9 ms
[2022-06-08 23:21:14] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=0 took 3 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=0 took 2 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=1 took 12 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=1 took 7 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=1 took 2 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=1 took 12 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=2 took 234 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=2 took 3 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=2 took 4 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=2 took 8 ms
Loading property file /tmp/ReachabilityCardinality7965905698676118453.prop.
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=3 took 181 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=3 took 33 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=3 took 58 ms
[2022-06-08 23:21:15] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=3 took 32 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:15] [INFO ] Computed 8 place invariants in 20 ms
inv : l25 + l26 + l28 + l29 + l30 + l31 = 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 : l5 + l6 + l9 = 1
inv : l19 + l20 + l23 + l24 = 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 : 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 : 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 : 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 23:21:15] [INFO ] Computed 8 place invariants in 22 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 98
[2022-06-08 23:21:16] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=4 took 525 ms
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :98 after 2243
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2243 after 6500
[2022-06-08 23:21:16] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=4 took 287 ms
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6500 after 14981
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14981 after 31910
[2022-06-08 23:21:17] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=4 took 922 ms
[2022-06-08 23:21:18] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=4 took 1154 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31910 after 65735
[2022-06-08 23:21:26] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=5 took 8226 ms
[2022-06-08 23:21:30] [INFO ] Proved 229 variables to be positive in 14795 ms
[2022-06-08 23:21:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-04
[2022-06-08 23:21:30] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(SAT) depth K=0 took 23 ms
[2022-06-08 23:21:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-05
[2022-06-08 23:21:30] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(SAT) depth K=0 took 7 ms
[2022-06-08 23:21:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-07
[2022-06-08 23:21:30] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(SAT) depth K=0 took 25 ms
[2022-06-08 23:21:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-11
[2022-06-08 23:21:30] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(SAT) depth K=0 took 24 ms
[2022-06-08 23:21:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-04
[2022-06-08 23:21:35] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(SAT) depth K=1 took 4985 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :65735 after 133352
[2022-06-08 23:21:41] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=5 took 14550 ms
[2022-06-08 23:21:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-05
[2022-06-08 23:21:41] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(SAT) depth K=1 took 5993 ms
[2022-06-08 23:21:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-07
[2022-06-08 23:21:46] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(SAT) depth K=1 took 4535 ms
Compilation finished in 33758 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6640809228781505495]
Link finished in 58 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, BugTrackingPTq3m032ReachabilityCardinality04==true], workingDir=/tmp/ltsmin6640809228781505495]
[2022-06-08 23:21:48] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=5 took 6665 ms
[2022-06-08 23:21:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-11
[2022-06-08 23:21:59] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(SAT) depth K=1 took 12622 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :133352 after 268553
[2022-06-08 23:25:48] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=5 took 240284 ms
[2022-06-08 23:26:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-04
[2022-06-08 23:26:33] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(SAT) depth K=2 took 274150 ms
[2022-06-08 23:27:45] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=6 took 116998 ms
[2022-06-08 23:27:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-05
[2022-06-08 23:27:56] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(SAT) depth K=2 took 83017 ms
[2022-06-08 23:29:16] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=6 took 91209 ms
[2022-06-08 23:32:01] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=6 took 165021 ms
[2022-06-08 23:33:37] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=6 took 96228 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, BugTrackingPTq3m032ReachabilityCardinality04==true], workingDir=/tmp/ltsmin6640809228781505495]
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, BugTrackingPTq3m032ReachabilityCardinality05==true], workingDir=/tmp/ltsmin6640809228781505495]
[2022-06-08 23:40:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-07
[2022-06-08 23:40:25] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(SAT) depth K=2 took 749732 ms
Detected timeout of ITS tools.
[2022-06-08 23:42:52] [INFO ] Applying decomposition
[2022-06-08 23:42:52] [INFO ] Flatten gal took : 370 ms
[2022-06-08 23:42:52] [INFO ] Decomposing Gal with order
[2022-06-08 23:42:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:42:53] [INFO ] Removed a total of 293 redundant transitions.
[2022-06-08 23:42:53] [INFO ] Flatten gal took : 666 ms
[2022-06-08 23:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 31 ms.
[2022-06-08 23:42:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5817321516091576524.gal : 57 ms
[2022-06-08 23:42:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9021791745304528157.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/ReachabilityCardinality5817321516091576524.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9021791745304528157.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/ReachabilityCardinality5817321516091576524.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9021791745304528157.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9021791745304528157.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 98
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :98 after 2243
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2243 after 6500
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6500 after 14981
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14981 after 31910
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31910 after 65735
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :65735 after 133352
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :133352 after 268553
[2022-06-08 23:48:14] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-04(UNSAT) depth K=7 took 876310 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, BugTrackingPTq3m032ReachabilityCardinality05==true], workingDir=/tmp/ltsmin6640809228781505495]
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, BugTrackingPTq3m032ReachabilityCardinality07==true], workingDir=/tmp/ltsmin6640809228781505495]
[2022-06-09 00:00:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBugTracking-PT-q3m032-ReachabilityCardinality-11
[2022-06-09 00:00:19] [INFO ] KInduction solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(SAT) depth K=2 took 1193422 ms
[2022-06-09 00:01:59] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-05(UNSAT) depth K=7 took 825071 ms
Detected timeout of ITS tools.
[2022-06-09 00:04:32] [INFO ] Flatten gal took : 335 ms
[2022-06-09 00:04:32] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-09 00:04:32] [INFO ] Transformed 229 places.
[2022-06-09 00:04:32] [INFO ] Transformed 2747 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-09 00:04:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11334054150553609933.gal : 38 ms
[2022-06-09 00:04:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16257031258584526340.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/ReachabilityCardinality11334054150553609933.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16257031258584526340.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/ReachabilityCardinality11334054150553609933.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16257031258584526340.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/ReachabilityCardinality16257031258584526340.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 30
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :30 after 100
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :100 after 338
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :338 after 883
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :883 after 1955
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1955 after 4084
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4084 after 8324
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :8324 after 16789
[2022-06-09 00:05:45] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-07(UNSAT) depth K=7 took 226372 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, BugTrackingPTq3m032ReachabilityCardinality07==true], workingDir=/tmp/ltsmin6640809228781505495]
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, BugTrackingPTq3m032ReachabilityCardinality11==true], workingDir=/tmp/ltsmin6640809228781505495]
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :16789 after 33701
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :33701 after 67510
[2022-06-09 00:11:16] [INFO ] BMC solution for property BugTracking-PT-q3m032-ReachabilityCardinality-11(UNSAT) depth K=7 took 331064 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :67510 after 135110
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-q3m032"
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-q3m032, 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-165472292500014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m032.tgz
mv BugTracking-PT-q3m032 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 '
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 ;