Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r307-tall-167873961400427.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S10J30, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tall-167873961400427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678867549883

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J30
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202303021504
[2023-03-15 08:05:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 08:05:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:05:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 08:05:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 08:05:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 717 ms
[2023-03-15 08:05:52] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 18 ms.
[2023-03-15 08:05:52] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 188 ms.
[2023-03-15 08:05:52] [INFO ] Unfolded 38 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 08:05:52] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 08:05:52] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 08:05:52] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 30 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2023-03-15 08:05:53] [INFO ] Flatten gal took : 582 ms
[2023-03-15 08:05:53] [INFO ] Flatten gal took : 306 ms
[2023-03-15 08:05:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16401838304701994715.gal : 64 ms
[2023-03-15 08:05:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1361724612021752139.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16401838304701994715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1361724612021752139.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1268 ms. (steps per millisecond=7 ) properties (out of 36) seen :6

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Loading property file /tmp/ReachabilityCardinality1361724612021752139.prop.
Running SMT prover for 10 properties.
[2023-03-15 08:05:54] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-15 08:05:54] [INFO ] Computed 92 place invariants in 129 ms
Reachability property qltransition_31 is true.
[2023-03-15 08:05:55] [INFO ] [Real]Absence check using 85 positive place invariants in 26 ms returned sat
[2023-03-15 08:05:56] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 21 ms returned sat
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_35 is true.
Reachability property qltransition_32 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,32 properties remain. new max is 2
SDD size :2 after 5
SDD proceeding with computation,32 properties remain. new max is 4
SDD size :5 after 6
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,29 properties remain. new max is 4
SDD size :6 after 14
Reachability property qltransition_21 is true.
SDD proceeding with computation,28 properties remain. new max is 4
SDD size :14 after 15
Reachability property qltransition_6 is true.
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :15 after 16
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,23 properties remain. new max is 4
SDD size :16 after 20
Reachability property qltransition_9 is true.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :20 after 21
Reachability property qltransition_36 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :21 after 24
SDD proceeding with computation,19 properties remain. new max is 8
SDD size :24 after 25
Reachability property qltransition_30 is true.
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :25 after 26
Reachability property qltransition_34 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :26 after 29
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :29 after 35
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :35 after 38
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :38 after 40
[2023-03-15 08:05:57] [INFO ] After 912ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2023-03-15 08:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :40 after 43
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :43 after 57
[2023-03-15 08:05:57] [INFO ] After 173ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:8
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :57 after 82
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :82 after 123
[2023-03-15 08:05:57] [INFO ] After 469ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:8
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-15 08:05:57] [INFO ] After 2115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:8
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :123 after 185
[2023-03-15 08:05:57] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-15 08:05:57] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 22 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :185 after 260
Reachability property qltransition_24 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :260 after 792
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :792 after 1458
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1458 after 3013
[2023-03-15 08:06:03] [INFO ] After 5624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :3013 after 6015
[2023-03-15 08:06:05] [INFO ] After 1824ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :6015 after 12291
[2023-03-15 08:06:14] [INFO ] Deduced a trap composed of 337 places in 7398 ms of which 2 ms to minimize.
[2023-03-15 08:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7544 ms
[2023-03-15 08:06:22] [INFO ] After 18967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 08:06:22] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 1487 ms.
Support contains 83 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 80 place count 619 transition count 1872
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 146 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 583 transition count 1869
Applied a total of 152 rules in 268 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
[2023-03-15 08:06:24] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2023-03-15 08:06:24] [INFO ] Computed 82 place invariants in 55 ms
[2023-03-15 08:06:25] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 583/664 places, 1254/1940 transitions.
Applied a total of 0 rules in 40 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1102 ms. Remains : 583/664 places, 1254/1940 transitions.
Incomplete random walk after 1000000 steps, including 65394 resets, run finished after 7319 ms. (steps per millisecond=136 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8718 resets, run finished after 1521 ms. (steps per millisecond=657 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:06:34] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-15 08:06:34] [INFO ] Computed 82 place invariants in 31 ms
[2023-03-15 08:06:34] [INFO ] [Real]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-15 08:06:34] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:06:34] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:06:34] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-15 08:06:34] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 08:06:34] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:06:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:06:34] [INFO ] After 206ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:06:35] [INFO ] Deduced a trap composed of 238 places in 303 ms of which 2 ms to minimize.
Reachability property qltransition_23 is true.
[2023-03-15 08:06:35] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 2 ms to minimize.
[2023-03-15 08:06:35] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 1 ms to minimize.
Reachability property qltransition_18 is true.
[2023-03-15 08:06:36] [INFO ] Deduced a trap composed of 240 places in 275 ms of which 1 ms to minimize.
Reachability property qltransition_12 is true.
[2023-03-15 08:06:36] [INFO ] Deduced a trap composed of 234 places in 287 ms of which 0 ms to minimize.
[2023-03-15 08:06:37] [INFO ] Deduced a trap composed of 236 places in 907 ms of which 1 ms to minimize.
[2023-03-15 08:06:37] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 0 ms to minimize.
Reachability property qltransition_0 is true.
SDD proceeding with computation,6 properties remain. new max is 32768
[2023-03-15 08:06:38] [INFO ] Deduced a trap composed of 234 places in 287 ms of which 1 ms to minimize.
SDD size :12291 after 50070
[2023-03-15 08:06:38] [INFO ] Deduced a trap composed of 238 places in 277 ms of which 1 ms to minimize.
[2023-03-15 08:06:38] [INFO ] Deduced a trap composed of 244 places in 286 ms of which 0 ms to minimize.
[2023-03-15 08:06:39] [INFO ] Deduced a trap composed of 240 places in 285 ms of which 1 ms to minimize.
[2023-03-15 08:06:39] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 1 ms to minimize.
[2023-03-15 08:06:40] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 0 ms to minimize.
[2023-03-15 08:06:40] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 0 ms to minimize.
[2023-03-15 08:06:40] [INFO ] Deduced a trap composed of 242 places in 280 ms of which 1 ms to minimize.
[2023-03-15 08:06:41] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 1 ms to minimize.
[2023-03-15 08:06:41] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 1 ms to minimize.
[2023-03-15 08:06:42] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 1 ms to minimize.
[2023-03-15 08:06:42] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 1 ms to minimize.
[2023-03-15 08:06:42] [INFO ] Deduced a trap composed of 240 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:06:43] [INFO ] Deduced a trap composed of 236 places in 291 ms of which 0 ms to minimize.
[2023-03-15 08:06:43] [INFO ] Deduced a trap composed of 238 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:06:44] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 0 ms to minimize.
[2023-03-15 08:06:45] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 08:06:45] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2023-03-15 08:06:45] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 1 ms to minimize.
[2023-03-15 08:06:46] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 08:06:46] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-15 08:06:47] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 0 ms to minimize.
[2023-03-15 08:06:47] [INFO ] Deduced a trap composed of 236 places in 418 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :50070 after 161419
[2023-03-15 08:06:47] [INFO ] Deduced a trap composed of 240 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:06:48] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 1 ms to minimize.
[2023-03-15 08:06:48] [INFO ] Deduced a trap composed of 238 places in 294 ms of which 4 ms to minimize.
[2023-03-15 08:06:49] [INFO ] Deduced a trap composed of 230 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:06:49] [INFO ] Deduced a trap composed of 234 places in 288 ms of which 0 ms to minimize.
[2023-03-15 08:06:49] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 0 ms to minimize.
[2023-03-15 08:06:50] [INFO ] Deduced a trap composed of 232 places in 466 ms of which 2 ms to minimize.
[2023-03-15 08:06:51] [INFO ] Deduced a trap composed of 232 places in 461 ms of which 2 ms to minimize.
[2023-03-15 08:06:51] [INFO ] Deduced a trap composed of 232 places in 462 ms of which 2 ms to minimize.
[2023-03-15 08:06:52] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 1 ms to minimize.
[2023-03-15 08:06:52] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-15 08:06:53] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 1 ms to minimize.
[2023-03-15 08:06:53] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 0 ms to minimize.
[2023-03-15 08:06:53] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 1 ms to minimize.
[2023-03-15 08:06:54] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-15 08:06:54] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 0 ms to minimize.
[2023-03-15 08:06:54] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-15 08:06:55] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 1 ms to minimize.
[2023-03-15 08:06:55] [INFO ] Deduced a trap composed of 224 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:06:55] [INFO ] Deduced a trap composed of 226 places in 352 ms of which 0 ms to minimize.
[2023-03-15 08:06:56] [INFO ] Deduced a trap composed of 228 places in 550 ms of which 1 ms to minimize.
[2023-03-15 08:06:57] [INFO ] Deduced a trap composed of 228 places in 479 ms of which 1 ms to minimize.
[2023-03-15 08:06:57] [INFO ] Deduced a trap composed of 226 places in 451 ms of which 1 ms to minimize.
[2023-03-15 08:06:57] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 9 ms to minimize.
[2023-03-15 08:06:58] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-15 08:07:00] [INFO ] Deduced a trap composed of 236 places in 475 ms of which 1 ms to minimize.
[2023-03-15 08:07:00] [INFO ] Deduced a trap composed of 226 places in 443 ms of which 1 ms to minimize.
[2023-03-15 08:07:01] [INFO ] Deduced a trap composed of 234 places in 454 ms of which 1 ms to minimize.
[2023-03-15 08:07:02] [INFO ] Deduced a trap composed of 234 places in 471 ms of which 1 ms to minimize.
[2023-03-15 08:07:02] [INFO ] Deduced a trap composed of 232 places in 483 ms of which 1 ms to minimize.
[2023-03-15 08:07:11] [INFO ] Deduced a trap composed of 238 places in 275 ms of which 0 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :161419 after 413650
[2023-03-15 08:07:12] [INFO ] Deduced a trap composed of 242 places in 297 ms of which 2 ms to minimize.
[2023-03-15 08:07:13] [INFO ] Deduced a trap composed of 252 places in 294 ms of which 0 ms to minimize.
[2023-03-15 08:07:14] [INFO ] Deduced a trap composed of 242 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:07:15] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 3 ms to minimize.
[2023-03-15 08:07:15] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 8 ms to minimize.
[2023-03-15 08:07:16] [INFO ] Deduced a trap composed of 236 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:07:16] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-15 08:07:17] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-15 08:07:17] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-15 08:07:17] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-15 08:07:18] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2023-03-15 08:07:18] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2023-03-15 08:07:18] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 0 ms to minimize.
[2023-03-15 08:07:19] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2023-03-15 08:07:19] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-15 08:07:20] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2023-03-15 08:07:20] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-15 08:07:20] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 0 ms to minimize.
[2023-03-15 08:07:21] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:07:21] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 1 ms to minimize.
[2023-03-15 08:07:22] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-15 08:07:22] [INFO ] Deduced a trap composed of 240 places in 250 ms of which 0 ms to minimize.
[2023-03-15 08:07:23] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 1 ms to minimize.
[2023-03-15 08:07:23] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-15 08:07:24] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-15 08:07:24] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-15 08:07:24] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 0 ms to minimize.
[2023-03-15 08:07:25] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 1 ms to minimize.
[2023-03-15 08:07:25] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2023-03-15 08:07:25] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 1 ms to minimize.
[2023-03-15 08:07:26] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:07:26] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 1 ms to minimize.
[2023-03-15 08:07:27] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2023-03-15 08:07:27] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 1 ms to minimize.
[2023-03-15 08:07:27] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:07:28] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2023-03-15 08:07:28] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-15 08:07:28] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:07:29] [INFO ] Deduced a trap composed of 240 places in 268 ms of which 1 ms to minimize.
[2023-03-15 08:07:29] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 1 ms to minimize.
[2023-03-15 08:07:29] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 0 ms to minimize.
[2023-03-15 08:07:30] [INFO ] Deduced a trap composed of 244 places in 260 ms of which 0 ms to minimize.
[2023-03-15 08:07:30] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2023-03-15 08:07:31] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 0 ms to minimize.
[2023-03-15 08:07:31] [INFO ] Deduced a trap composed of 238 places in 246 ms of which 1 ms to minimize.
[2023-03-15 08:07:31] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-15 08:07:33] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-15 08:07:33] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 0 ms to minimize.
[2023-03-15 08:07:33] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 1 ms to minimize.
[2023-03-15 08:07:34] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2023-03-15 08:07:34] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 1 ms to minimize.
[2023-03-15 08:07:34] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 0 ms to minimize.
[2023-03-15 08:07:35] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-15 08:07:35] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-15 08:07:37] [INFO ] Deduced a trap composed of 244 places in 283 ms of which 2 ms to minimize.
[2023-03-15 08:07:46] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 71328 ms
[2023-03-15 08:07:46] [INFO ] After 71648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:07:46] [INFO ] After 72087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 1253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 1253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 582 transition count 1251
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 580 transition count 1251
Applied a total of 6 rules in 57 ms. Remains 580 /583 variables (removed 3) and now considering 1251/1254 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 580/583 places, 1251/1254 transitions.
SDD proceeding with computation,6 properties remain. new max is 262144
Incomplete random walk after 1000000 steps, including 72451 resets, run finished after 9623 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
SDD size :413650 after 939448
Incomplete Best-First random walk after 1000001 steps, including 8941 resets, run finished after 1734 ms. (steps per millisecond=576 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5196056 steps, run timeout after 33001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 5196056 steps, saw 894533 distinct states, run finished after 33003 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:08:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-15 08:08:30] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-15 08:08:30] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 08:08:30] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 08:08:30] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:08:31] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 08:08:31] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 08:08:31] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:08:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:08:31] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:08:32] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 1 ms to minimize.
[2023-03-15 08:08:32] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 0 ms to minimize.
[2023-03-15 08:08:32] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 0 ms to minimize.
[2023-03-15 08:08:33] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:08:33] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 1 ms to minimize.
[2023-03-15 08:08:33] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2023-03-15 08:08:33] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:08:34] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2023-03-15 08:08:34] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 0 ms to minimize.
[2023-03-15 08:08:34] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-15 08:08:35] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2023-03-15 08:08:35] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 0 ms to minimize.
[2023-03-15 08:08:35] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2023-03-15 08:08:36] [INFO ] Deduced a trap composed of 238 places in 246 ms of which 0 ms to minimize.
[2023-03-15 08:08:36] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-15 08:08:37] [INFO ] Deduced a trap composed of 218 places in 248 ms of which 0 ms to minimize.
[2023-03-15 08:08:37] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:08:37] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-15 08:08:38] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 1 ms to minimize.
[2023-03-15 08:08:38] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 1 ms to minimize.
[2023-03-15 08:08:38] [INFO ] Deduced a trap composed of 240 places in 246 ms of which 0 ms to minimize.
[2023-03-15 08:08:38] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 1 ms to minimize.
[2023-03-15 08:08:39] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:08:39] [INFO ] Deduced a trap composed of 243 places in 243 ms of which 0 ms to minimize.
[2023-03-15 08:08:39] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 1 ms to minimize.
[2023-03-15 08:08:40] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:08:40] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 0 ms to minimize.
[2023-03-15 08:08:40] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 1 ms to minimize.
[2023-03-15 08:08:41] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2023-03-15 08:08:41] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:08:42] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2023-03-15 08:08:42] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2023-03-15 08:08:42] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 1 ms to minimize.
[2023-03-15 08:08:42] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-15 08:08:43] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 0 ms to minimize.
[2023-03-15 08:08:43] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-15 08:08:44] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 0 ms to minimize.
[2023-03-15 08:08:44] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:08:44] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 0 ms to minimize.
[2023-03-15 08:08:45] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 1 ms to minimize.
[2023-03-15 08:08:45] [INFO ] Deduced a trap composed of 240 places in 244 ms of which 1 ms to minimize.
[2023-03-15 08:08:46] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-15 08:08:46] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:08:47] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-15 08:08:47] [INFO ] Deduced a trap composed of 236 places in 278 ms of which 1 ms to minimize.
[2023-03-15 08:08:48] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-15 08:08:56] [INFO ] Deduced a trap composed of 234 places in 485 ms of which 1 ms to minimize.
[2023-03-15 08:09:05] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 33378 ms
[2023-03-15 08:09:05] [INFO ] After 33480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:09:05] [INFO ] After 34374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 28 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 08:09:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:09:05] [INFO ] Invariant cache hit.
[2023-03-15 08:09:05] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-15 08:09:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:09:05] [INFO ] Invariant cache hit.
[2023-03-15 08:09:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:09:08] [INFO ] Implicit Places using invariants and state equation in 3111 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
[2023-03-15 08:09:09] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-15 08:09:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:09:09] [INFO ] Invariant cache hit.
[2023-03-15 08:09:09] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4214 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7262 resets, run finished after 1012 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:09:10] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:09:10] [INFO ] Invariant cache hit.
[2023-03-15 08:09:10] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 08:09:10] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:09:11] [INFO ] After 311ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:09:11] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:09:11] [INFO ] After 84ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:09:11] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:09:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-15 08:09:11] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 08:09:11] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:09:11] [INFO ] After 73ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:09:11] [INFO ] Deduced a trap composed of 230 places in 307 ms of which 1 ms to minimize.
[2023-03-15 08:09:12] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 0 ms to minimize.
[2023-03-15 08:09:12] [INFO ] Deduced a trap composed of 232 places in 301 ms of which 0 ms to minimize.
[2023-03-15 08:09:12] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 0 ms to minimize.
[2023-03-15 08:09:13] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 08:09:13] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 08:09:13] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 0 ms to minimize.
[2023-03-15 08:09:14] [INFO ] Deduced a trap composed of 241 places in 246 ms of which 1 ms to minimize.
[2023-03-15 08:09:14] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 1 ms to minimize.
[2023-03-15 08:09:14] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-15 08:09:15] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-15 08:09:15] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 2 ms to minimize.
[2023-03-15 08:09:15] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 1 ms to minimize.
[2023-03-15 08:09:16] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-15 08:09:16] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-15 08:09:16] [INFO ] Deduced a trap composed of 239 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:09:16] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2023-03-15 08:09:17] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-15 08:09:17] [INFO ] Deduced a trap composed of 239 places in 259 ms of which 0 ms to minimize.
[2023-03-15 08:09:18] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 1 ms to minimize.
[2023-03-15 08:09:18] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-15 08:09:18] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:09:19] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2023-03-15 08:09:19] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 1 ms to minimize.
[2023-03-15 08:09:19] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-15 08:09:20] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 1 ms to minimize.
[2023-03-15 08:09:20] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:09:20] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2023-03-15 08:09:21] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 0 ms to minimize.
[2023-03-15 08:09:21] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 0 ms to minimize.
[2023-03-15 08:09:21] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 0 ms to minimize.
[2023-03-15 08:09:22] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 0 ms to minimize.
[2023-03-15 08:09:22] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 1 ms to minimize.
[2023-03-15 08:09:22] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:09:23] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-15 08:09:23] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-15 08:09:23] [INFO ] Deduced a trap composed of 224 places in 274 ms of which 1 ms to minimize.
[2023-03-15 08:09:24] [INFO ] Deduced a trap composed of 224 places in 271 ms of which 0 ms to minimize.
[2023-03-15 08:09:24] [INFO ] Deduced a trap composed of 224 places in 270 ms of which 1 ms to minimize.
[2023-03-15 08:09:25] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 0 ms to minimize.
[2023-03-15 08:09:25] [INFO ] Deduced a trap composed of 220 places in 271 ms of which 0 ms to minimize.
[2023-03-15 08:09:26] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:09:26] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 0 ms to minimize.
[2023-03-15 08:09:26] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 0 ms to minimize.
[2023-03-15 08:09:35] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 24291 ms
[2023-03-15 08:09:36] [INFO ] After 24511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:09:36] [INFO ] After 24948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72801 resets, run finished after 9881 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8877 resets, run finished after 1811 ms. (steps per millisecond=552 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5159041 steps, run timeout after 33001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 5159041 steps, saw 887985 distinct states, run finished after 33001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:10:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:10:20] [INFO ] Invariant cache hit.
[2023-03-15 08:10:20] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-15 08:10:20] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:10:20] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:10:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 08:10:21] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 08:10:21] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:10:21] [INFO ] After 107ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:10:21] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 1 ms to minimize.
[2023-03-15 08:10:22] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2023-03-15 08:10:22] [INFO ] Deduced a trap composed of 232 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:10:22] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 1 ms to minimize.
[2023-03-15 08:10:23] [INFO ] Deduced a trap composed of 232 places in 325 ms of which 1 ms to minimize.
[2023-03-15 08:10:23] [INFO ] Deduced a trap composed of 232 places in 325 ms of which 1 ms to minimize.
[2023-03-15 08:10:23] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2023-03-15 08:10:24] [INFO ] Deduced a trap composed of 241 places in 268 ms of which 1 ms to minimize.
[2023-03-15 08:10:24] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 1 ms to minimize.
[2023-03-15 08:10:24] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-15 08:10:25] [INFO ] Deduced a trap composed of 228 places in 297 ms of which 0 ms to minimize.
[2023-03-15 08:10:25] [INFO ] Deduced a trap composed of 230 places in 314 ms of which 0 ms to minimize.
[2023-03-15 08:10:26] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 1 ms to minimize.
[2023-03-15 08:10:26] [INFO ] Deduced a trap composed of 232 places in 345 ms of which 1 ms to minimize.
[2023-03-15 08:10:26] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-15 08:10:27] [INFO ] Deduced a trap composed of 239 places in 343 ms of which 1 ms to minimize.
[2023-03-15 08:10:27] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 0 ms to minimize.
[2023-03-15 08:10:27] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-15 08:10:28] [INFO ] Deduced a trap composed of 239 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:10:28] [INFO ] Deduced a trap composed of 226 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:10:29] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 1 ms to minimize.
[2023-03-15 08:10:29] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-15 08:10:29] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-15 08:10:30] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 1 ms to minimize.
[2023-03-15 08:10:30] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 0 ms to minimize.
[2023-03-15 08:10:30] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 1 ms to minimize.
[2023-03-15 08:10:31] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-15 08:10:31] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 0 ms to minimize.
[2023-03-15 08:10:31] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 0 ms to minimize.
[2023-03-15 08:10:32] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 0 ms to minimize.
[2023-03-15 08:10:32] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 1 ms to minimize.
[2023-03-15 08:10:32] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-15 08:10:33] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 0 ms to minimize.
[2023-03-15 08:10:33] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-15 08:10:33] [INFO ] Deduced a trap composed of 228 places in 305 ms of which 0 ms to minimize.
[2023-03-15 08:10:34] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 0 ms to minimize.
[2023-03-15 08:10:34] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 0 ms to minimize.
[2023-03-15 08:10:35] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 1 ms to minimize.
[2023-03-15 08:10:35] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 1 ms to minimize.
[2023-03-15 08:10:36] [INFO ] Deduced a trap composed of 228 places in 518 ms of which 2 ms to minimize.
[2023-03-15 08:10:37] [INFO ] Deduced a trap composed of 220 places in 492 ms of which 1 ms to minimize.
[2023-03-15 08:10:37] [INFO ] Deduced a trap composed of 230 places in 569 ms of which 1 ms to minimize.
[2023-03-15 08:10:38] [INFO ] Deduced a trap composed of 236 places in 520 ms of which 2 ms to minimize.
[2023-03-15 08:10:39] [INFO ] Deduced a trap composed of 234 places in 499 ms of which 1 ms to minimize.
[2023-03-15 08:10:48] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 26480 ms
[2023-03-15 08:10:48] [INFO ] After 26694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:10:48] [INFO ] After 27222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 08:10:48] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:10:48] [INFO ] Invariant cache hit.
[2023-03-15 08:10:49] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2023-03-15 08:10:49] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:10:49] [INFO ] Invariant cache hit.
[2023-03-15 08:10:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:10:52] [INFO ] Implicit Places using invariants and state equation in 3509 ms returned []
Implicit Place search using SMT with State Equation took 4630 ms to find 0 implicit places.
[2023-03-15 08:10:52] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 08:10:52] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:10:52] [INFO ] Invariant cache hit.
[2023-03-15 08:10:53] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5288 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7233 resets, run finished after 1036 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:10:54] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:10:54] [INFO ] Invariant cache hit.
[2023-03-15 08:10:54] [INFO ] [Real]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-15 08:10:54] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 08:10:55] [INFO ] After 553ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:10:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:10:55] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:10:55] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:10:55] [INFO ] After 962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:10:55] [INFO ] [Nat]Absence check using 75 positive place invariants in 23 ms returned sat
[2023-03-15 08:10:55] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 08:10:56] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:10:56] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:10:57] [INFO ] Deduced a trap composed of 230 places in 615 ms of which 1 ms to minimize.
[2023-03-15 08:10:57] [INFO ] Deduced a trap composed of 236 places in 509 ms of which 3 ms to minimize.
[2023-03-15 08:10:58] [INFO ] Deduced a trap composed of 232 places in 502 ms of which 1 ms to minimize.
[2023-03-15 08:10:58] [INFO ] Deduced a trap composed of 226 places in 587 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :939448 after 1.8482e+06
[2023-03-15 08:11:09] [INFO ] Deduced a trap composed of 232 places in 10253 ms of which 3 ms to minimize.
[2023-03-15 08:11:23] [INFO ] Deduced a trap composed of 232 places in 14405 ms of which 32 ms to minimize.
[2023-03-15 08:11:24] [INFO ] Deduced a trap composed of 230 places in 529 ms of which 1 ms to minimize.
[2023-03-15 08:11:24] [INFO ] Deduced a trap composed of 241 places in 489 ms of which 0 ms to minimize.
[2023-03-15 08:11:25] [INFO ] Deduced a trap composed of 242 places in 506 ms of which 1 ms to minimize.
[2023-03-15 08:11:25] [INFO ] Deduced a trap composed of 230 places in 544 ms of which 0 ms to minimize.
[2023-03-15 08:11:26] [INFO ] Deduced a trap composed of 228 places in 560 ms of which 1 ms to minimize.
[2023-03-15 08:11:41] [INFO ] Deduced a trap composed of 230 places in 14797 ms of which 27 ms to minimize.
[2023-03-15 08:11:42] [INFO ] Deduced a trap composed of 232 places in 502 ms of which 0 ms to minimize.
[2023-03-15 08:11:42] [INFO ] Deduced a trap composed of 232 places in 542 ms of which 1 ms to minimize.
[2023-03-15 08:11:45] [INFO ] Deduced a trap composed of 230 places in 3004 ms of which 1 ms to minimize.
[2023-03-15 08:11:46] [INFO ] Deduced a trap composed of 239 places in 280 ms of which 0 ms to minimize.
[2023-03-15 08:11:46] [INFO ] Deduced a trap composed of 238 places in 292 ms of which 1 ms to minimize.
[2023-03-15 08:11:46] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 0 ms to minimize.
[2023-03-15 08:11:47] [INFO ] Deduced a trap composed of 239 places in 348 ms of which 0 ms to minimize.
[2023-03-15 08:11:47] [INFO ] Deduced a trap composed of 226 places in 288 ms of which 0 ms to minimize.
[2023-03-15 08:11:48] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 0 ms to minimize.
[2023-03-15 08:11:48] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:11:48] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2023-03-15 08:11:49] [INFO ] Deduced a trap composed of 226 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:11:49] [INFO ] Deduced a trap composed of 228 places in 446 ms of which 1 ms to minimize.
[2023-03-15 08:11:50] [INFO ] Deduced a trap composed of 236 places in 512 ms of which 1 ms to minimize.
[2023-03-15 08:11:50] [INFO ] Deduced a trap composed of 228 places in 320 ms of which 0 ms to minimize.
[2023-03-15 08:11:51] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:11:51] [INFO ] Deduced a trap composed of 232 places in 466 ms of which 0 ms to minimize.
[2023-03-15 08:11:51] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:11:52] [INFO ] Deduced a trap composed of 234 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:11:52] [INFO ] Deduced a trap composed of 232 places in 465 ms of which 1 ms to minimize.
[2023-03-15 08:11:53] [INFO ] Deduced a trap composed of 226 places in 450 ms of which 1 ms to minimize.
[2023-03-15 08:11:54] [INFO ] Deduced a trap composed of 232 places in 458 ms of which 1 ms to minimize.
[2023-03-15 08:11:54] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 1 ms to minimize.
[2023-03-15 08:11:54] [INFO ] Deduced a trap composed of 232 places in 453 ms of which 1 ms to minimize.
[2023-03-15 08:11:55] [INFO ] Deduced a trap composed of 224 places in 567 ms of which 1 ms to minimize.
[2023-03-15 08:11:56] [INFO ] Deduced a trap composed of 224 places in 457 ms of which 1 ms to minimize.
[2023-03-15 08:11:56] [INFO ] Deduced a trap composed of 224 places in 307 ms of which 1 ms to minimize.
[2023-03-15 08:11:57] [INFO ] Deduced a trap composed of 228 places in 365 ms of which 1 ms to minimize.
[2023-03-15 08:11:58] [INFO ] Deduced a trap composed of 220 places in 328 ms of which 0 ms to minimize.
[2023-03-15 08:11:58] [INFO ] Deduced a trap composed of 230 places in 426 ms of which 1 ms to minimize.
[2023-03-15 08:11:59] [INFO ] Deduced a trap composed of 236 places in 443 ms of which 0 ms to minimize.
[2023-03-15 08:11:59] [INFO ] Deduced a trap composed of 234 places in 288 ms of which 1 ms to minimize.
[2023-03-15 08:12:08] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 72116 ms
[2023-03-15 08:12:08] [INFO ] After 72324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:12:08] [INFO ] After 73123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 736 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 457438 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457438 steps, saw 74051 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:12:11] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:12:11] [INFO ] Invariant cache hit.
[2023-03-15 08:12:11] [INFO ] [Real]Absence check using 75 positive place invariants in 23 ms returned sat
[2023-03-15 08:12:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-15 08:12:11] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:12:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 08:12:12] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:12:12] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:12:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:12:12] [INFO ] After 134ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:12:13] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2023-03-15 08:12:13] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 0 ms to minimize.
[2023-03-15 08:12:13] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-15 08:12:14] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-15 08:12:14] [INFO ] Deduced a trap composed of 236 places in 462 ms of which 1 ms to minimize.
[2023-03-15 08:12:15] [INFO ] Deduced a trap composed of 232 places in 529 ms of which 1 ms to minimize.
[2023-03-15 08:12:29] [INFO ] Deduced a trap composed of 234 places in 13869 ms of which 1 ms to minimize.
[2023-03-15 08:12:29] [INFO ] Deduced a trap composed of 234 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:12:29] [INFO ] Deduced a trap composed of 226 places in 297 ms of which 1 ms to minimize.
[2023-03-15 08:12:30] [INFO ] Deduced a trap composed of 224 places in 389 ms of which 1 ms to minimize.
[2023-03-15 08:12:30] [INFO ] Deduced a trap composed of 234 places in 511 ms of which 1 ms to minimize.
[2023-03-15 08:12:31] [INFO ] Deduced a trap composed of 232 places in 399 ms of which 1 ms to minimize.
[2023-03-15 08:12:32] [INFO ] Deduced a trap composed of 232 places in 475 ms of which 0 ms to minimize.
[2023-03-15 08:12:32] [INFO ] Deduced a trap composed of 236 places in 489 ms of which 0 ms to minimize.
[2023-03-15 08:12:33] [INFO ] Deduced a trap composed of 226 places in 520 ms of which 1 ms to minimize.
[2023-03-15 08:12:33] [INFO ] Deduced a trap composed of 236 places in 522 ms of which 1 ms to minimize.
[2023-03-15 08:12:34] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:12:34] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:12:35] [INFO ] Deduced a trap composed of 226 places in 466 ms of which 1 ms to minimize.
[2023-03-15 08:12:35] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 0 ms to minimize.
[2023-03-15 08:12:35] [INFO ] Deduced a trap composed of 238 places in 268 ms of which 0 ms to minimize.
[2023-03-15 08:12:36] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2023-03-15 08:12:36] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 0 ms to minimize.
[2023-03-15 08:12:36] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2023-03-15 08:12:36] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 24216 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 08:12:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:12:37] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 47 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 08:12:37] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:12:37] [INFO ] Invariant cache hit.
[2023-03-15 08:12:37] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 790 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 726 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 459613 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 459613 steps, saw 74414 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:12:40] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:12:40] [INFO ] Invariant cache hit.
[2023-03-15 08:12:41] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 08:12:41] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:12:41] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:12:41] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 08:12:41] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 08:12:41] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:12:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:12:41] [INFO ] After 136ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:12:42] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 1 ms to minimize.
[2023-03-15 08:12:42] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 0 ms to minimize.
[2023-03-15 08:12:42] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 4 ms to minimize.
[2023-03-15 08:12:43] [INFO ] Deduced a trap composed of 230 places in 449 ms of which 1 ms to minimize.
[2023-03-15 08:12:43] [INFO ] Deduced a trap composed of 236 places in 443 ms of which 0 ms to minimize.
[2023-03-15 08:12:44] [INFO ] Deduced a trap composed of 232 places in 455 ms of which 1 ms to minimize.
[2023-03-15 08:12:44] [INFO ] Deduced a trap composed of 234 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:12:44] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2023-03-15 08:12:45] [INFO ] Deduced a trap composed of 226 places in 272 ms of which 0 ms to minimize.
[2023-03-15 08:12:45] [INFO ] Deduced a trap composed of 224 places in 453 ms of which 2 ms to minimize.
[2023-03-15 08:12:46] [INFO ] Deduced a trap composed of 234 places in 459 ms of which 0 ms to minimize.
[2023-03-15 08:12:46] [INFO ] Deduced a trap composed of 232 places in 312 ms of which 0 ms to minimize.
[2023-03-15 08:12:47] [INFO ] Deduced a trap composed of 232 places in 464 ms of which 1 ms to minimize.
[2023-03-15 08:12:47] [INFO ] Deduced a trap composed of 236 places in 457 ms of which 1 ms to minimize.
[2023-03-15 08:12:48] [INFO ] Deduced a trap composed of 226 places in 425 ms of which 1 ms to minimize.
[2023-03-15 08:12:48] [INFO ] Deduced a trap composed of 236 places in 457 ms of which 1 ms to minimize.
[2023-03-15 08:12:49] [INFO ] Deduced a trap composed of 236 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:12:49] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:12:49] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 1 ms to minimize.
[2023-03-15 08:12:50] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 1 ms to minimize.
[2023-03-15 08:12:50] [INFO ] Deduced a trap composed of 238 places in 270 ms of which 0 ms to minimize.
[2023-03-15 08:12:50] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-15 08:12:51] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-15 08:12:51] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2023-03-15 08:12:52] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 0 ms to minimize.
[2023-03-15 08:12:52] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 1 ms to minimize.
[2023-03-15 08:12:53] [INFO ] Deduced a trap composed of 228 places in 452 ms of which 1 ms to minimize.
[2023-03-15 08:12:54] [INFO ] Deduced a trap composed of 230 places in 443 ms of which 1 ms to minimize.
[2023-03-15 08:12:54] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 0 ms to minimize.
[2023-03-15 08:12:55] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 1 ms to minimize.
[2023-03-15 08:12:56] [INFO ] Deduced a trap composed of 232 places in 315 ms of which 1 ms to minimize.
[2023-03-15 08:12:57] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 0 ms to minimize.
[2023-03-15 08:13:06] [INFO ] Deduced a trap composed of 9 places in 376 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 08:13:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:13:06] [INFO ] After 25400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 81 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 37 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 08:13:06] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:13:06] [INFO ] Invariant cache hit.
[2023-03-15 08:13:07] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-15 08:13:07] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:13:07] [INFO ] Invariant cache hit.
[2023-03-15 08:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:13:10] [INFO ] Implicit Places using invariants and state equation in 3001 ms returned []
Implicit Place search using SMT with State Equation took 3613 ms to find 0 implicit places.
[2023-03-15 08:13:10] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 08:13:10] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 08:13:10] [INFO ] Invariant cache hit.
[2023-03-15 08:13:10] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4275 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 216 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-15 08:13:11] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 08:13:11] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 08:13:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 08:13:11] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:13:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 43 ms returned sat
[2023-03-15 08:13:11] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 08:13:12] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:13:12] [INFO ] Deduced a trap composed of 238 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:13:13] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 1 ms to minimize.
[2023-03-15 08:13:13] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 0 ms to minimize.
[2023-03-15 08:13:13] [INFO ] Deduced a trap composed of 228 places in 295 ms of which 1 ms to minimize.
[2023-03-15 08:13:13] [INFO ] Deduced a trap composed of 230 places in 224 ms of which 0 ms to minimize.
[2023-03-15 08:13:14] [INFO ] Deduced a trap composed of 236 places in 448 ms of which 1 ms to minimize.
[2023-03-15 08:13:14] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 1 ms to minimize.
[2023-03-15 08:13:15] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 0 ms to minimize.
[2023-03-15 08:13:15] [INFO ] Deduced a trap composed of 226 places in 271 ms of which 0 ms to minimize.
[2023-03-15 08:13:15] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 0 ms to minimize.
[2023-03-15 08:13:15] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 0 ms to minimize.
[2023-03-15 08:13:16] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 0 ms to minimize.
[2023-03-15 08:13:16] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:16] [INFO ] Deduced a trap composed of 226 places in 239 ms of which 0 ms to minimize.
[2023-03-15 08:13:17] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 1 ms to minimize.
[2023-03-15 08:13:17] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 0 ms to minimize.
[2023-03-15 08:13:17] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 0 ms to minimize.
[2023-03-15 08:13:17] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 0 ms to minimize.
[2023-03-15 08:13:18] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 1 ms to minimize.
[2023-03-15 08:13:18] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:18] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:13:19] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2023-03-15 08:13:19] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:19] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:13:19] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 0 ms to minimize.
[2023-03-15 08:13:20] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 0 ms to minimize.
[2023-03-15 08:13:20] [INFO ] Deduced a trap composed of 226 places in 282 ms of which 1 ms to minimize.
[2023-03-15 08:13:20] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 0 ms to minimize.
[2023-03-15 08:13:21] [INFO ] Deduced a trap composed of 228 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:13:21] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:13:21] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 1 ms to minimize.
[2023-03-15 08:13:22] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 0 ms to minimize.
[2023-03-15 08:13:22] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 1 ms to minimize.
[2023-03-15 08:13:22] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 0 ms to minimize.
[2023-03-15 08:13:23] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-15 08:13:28] [INFO ] Deduced a trap composed of 224 places in 5693 ms of which 0 ms to minimize.
[2023-03-15 08:13:29] [INFO ] Deduced a trap composed of 228 places in 337 ms of which 0 ms to minimize.
[2023-03-15 08:13:29] [INFO ] Deduced a trap composed of 238 places in 381 ms of which 1 ms to minimize.
[2023-03-15 08:13:30] [INFO ] Deduced a trap composed of 232 places in 448 ms of which 1 ms to minimize.
[2023-03-15 08:13:30] [INFO ] Deduced a trap composed of 230 places in 621 ms of which 0 ms to minimize.
[2023-03-15 08:13:31] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:13:31] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2023-03-15 08:13:31] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 1 ms to minimize.
[2023-03-15 08:13:32] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-15 08:13:32] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2023-03-15 08:13:32] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2023-03-15 08:13:33] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:13:33] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 08:13:33] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-15 08:13:33] [INFO ] Deduced a trap composed of 244 places in 260 ms of which 0 ms to minimize.
[2023-03-15 08:13:34] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-15 08:13:34] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-15 08:13:34] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 0 ms to minimize.
[2023-03-15 08:13:35] [INFO ] Deduced a trap composed of 232 places in 413 ms of which 1 ms to minimize.
[2023-03-15 08:13:35] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:13:36] [INFO ] Deduced a trap composed of 226 places in 418 ms of which 1 ms to minimize.
[2023-03-15 08:13:36] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2023-03-15 08:13:37] [INFO ] Deduced a trap composed of 226 places in 411 ms of which 1 ms to minimize.
[2023-03-15 08:13:37] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-15 08:13:37] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 1 ms to minimize.
[2023-03-15 08:13:37] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 0 ms to minimize.
[2023-03-15 08:13:38] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 0 ms to minimize.
[2023-03-15 08:13:38] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 1 ms to minimize.
[2023-03-15 08:13:38] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 1 ms to minimize.
[2023-03-15 08:13:39] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 1 ms to minimize.
[2023-03-15 08:13:39] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 0 ms to minimize.
[2023-03-15 08:13:39] [INFO ] Deduced a trap composed of 226 places in 237 ms of which 1 ms to minimize.
[2023-03-15 08:13:40] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 1 ms to minimize.
[2023-03-15 08:13:40] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:40] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 1 ms to minimize.
[2023-03-15 08:13:40] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:41] [INFO ] Deduced a trap composed of 226 places in 237 ms of which 1 ms to minimize.
[2023-03-15 08:13:41] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 0 ms to minimize.
[2023-03-15 08:13:41] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 0 ms to minimize.
[2023-03-15 08:13:42] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 1 ms to minimize.
[2023-03-15 08:13:42] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 0 ms to minimize.
[2023-03-15 08:13:42] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 0 ms to minimize.
[2023-03-15 08:13:42] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:13:43] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 1 ms to minimize.
[2023-03-15 08:13:43] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 1 ms to minimize.
[2023-03-15 08:13:43] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 0 ms to minimize.
[2023-03-15 08:13:44] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 1 ms to minimize.
[2023-03-15 08:13:44] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 1 ms to minimize.
[2023-03-15 08:13:44] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:44] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:13:45] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 0 ms to minimize.
[2023-03-15 08:13:45] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 0 ms to minimize.
[2023-03-15 08:13:45] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 0 ms to minimize.
[2023-03-15 08:13:46] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 0 ms to minimize.
[2023-03-15 08:13:46] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:46] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 1 ms to minimize.
[2023-03-15 08:13:46] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 1 ms to minimize.
[2023-03-15 08:13:47] [INFO ] Deduced a trap composed of 226 places in 236 ms of which 0 ms to minimize.
[2023-03-15 08:13:50] [INFO ] Deduced a trap composed of 226 places in 272 ms of which 1 ms to minimize.
[2023-03-15 08:13:50] [INFO ] Deduced a trap composed of 232 places in 235 ms of which 1 ms to minimize.
[2023-03-15 08:13:52] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 1 ms to minimize.
[2023-03-15 08:13:52] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 1 ms to minimize.
[2023-03-15 08:13:52] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 0 ms to minimize.
[2023-03-15 08:13:56] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:56] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 0 ms to minimize.
[2023-03-15 08:13:56] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 1 ms to minimize.
[2023-03-15 08:13:57] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 1 ms to minimize.
[2023-03-15 08:13:57] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 1 ms to minimize.
[2023-03-15 08:13:57] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 1 ms to minimize.
[2023-03-15 08:13:58] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:13:58] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-15 08:13:58] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 0 ms to minimize.
[2023-03-15 08:13:58] [INFO ] Deduced a trap composed of 226 places in 241 ms of which 0 ms to minimize.
[2023-03-15 08:14:00] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 0 ms to minimize.
[2023-03-15 08:14:01] [INFO ] Deduced a trap composed of 226 places in 234 ms of which 1 ms to minimize.
[2023-03-15 08:14:02] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 1 ms to minimize.
[2023-03-15 08:14:02] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 1 ms to minimize.
[2023-03-15 08:14:02] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 1 ms to minimize.
[2023-03-15 08:14:02] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 0 ms to minimize.
[2023-03-15 08:14:03] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-15 08:14:03] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-15 08:14:03] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 1 ms to minimize.
[2023-03-15 08:14:04] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 1 ms to minimize.
[2023-03-15 08:14:14] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 61668 ms
[2023-03-15 08:14:14] [INFO ] After 62991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:14:14] [INFO ] After 63173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
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 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 120 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 08:14:14] [INFO ] Invariant cache hit.
[2023-03-15 08:14:14] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 08:14:14] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:14:14] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:14:14] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 08:14:14] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 08:14:15] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:14:15] [INFO ] Deduced a trap composed of 222 places in 247 ms of which 0 ms to minimize.
[2023-03-15 08:14:15] [INFO ] Deduced a trap composed of 232 places in 227 ms of which 1 ms to minimize.
[2023-03-15 08:14:15] [INFO ] Deduced a trap composed of 222 places in 225 ms of which 0 ms to minimize.
[2023-03-15 08:14:16] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 1 ms to minimize.
[2023-03-15 08:14:16] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 0 ms to minimize.
[2023-03-15 08:14:16] [INFO ] Deduced a trap composed of 220 places in 227 ms of which 1 ms to minimize.
[2023-03-15 08:14:16] [INFO ] Deduced a trap composed of 232 places in 230 ms of which 1 ms to minimize.
[2023-03-15 08:14:17] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 1 ms to minimize.
[2023-03-15 08:14:17] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 0 ms to minimize.
[2023-03-15 08:14:17] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 0 ms to minimize.
[2023-03-15 08:14:18] [INFO ] Deduced a trap composed of 222 places in 253 ms of which 1 ms to minimize.
[2023-03-15 08:14:18] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 1 ms to minimize.
[2023-03-15 08:14:18] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 0 ms to minimize.
[2023-03-15 08:14:19] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 0 ms to minimize.
[2023-03-15 08:14:19] [INFO ] Deduced a trap composed of 216 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:14:19] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 0 ms to minimize.
[2023-03-15 08:14:20] [INFO ] Deduced a trap composed of 218 places in 244 ms of which 0 ms to minimize.
[2023-03-15 08:14:20] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 0 ms to minimize.
[2023-03-15 08:14:20] [INFO ] Deduced a trap composed of 220 places in 254 ms of which 1 ms to minimize.
[2023-03-15 08:14:20] [INFO ] Deduced a trap composed of 220 places in 246 ms of which 1 ms to minimize.
[2023-03-15 08:14:21] [INFO ] Deduced a trap composed of 220 places in 250 ms of which 1 ms to minimize.
[2023-03-15 08:14:21] [INFO ] Deduced a trap composed of 222 places in 245 ms of which 1 ms to minimize.
[2023-03-15 08:14:21] [INFO ] Deduced a trap composed of 222 places in 244 ms of which 0 ms to minimize.
[2023-03-15 08:14:22] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 1 ms to minimize.
[2023-03-15 08:14:22] [INFO ] Deduced a trap composed of 226 places in 243 ms of which 0 ms to minimize.
[2023-03-15 08:14:22] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 1 ms to minimize.
[2023-03-15 08:14:22] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:14:23] [INFO ] Deduced a trap composed of 220 places in 245 ms of which 1 ms to minimize.
[2023-03-15 08:14:23] [INFO ] Deduced a trap composed of 222 places in 243 ms of which 1 ms to minimize.
[2023-03-15 08:14:23] [INFO ] Deduced a trap composed of 222 places in 244 ms of which 1 ms to minimize.
[2023-03-15 08:14:24] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 1 ms to minimize.
[2023-03-15 08:14:24] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 1 ms to minimize.
[2023-03-15 08:14:24] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 0 ms to minimize.
[2023-03-15 08:14:25] [INFO ] Deduced a trap composed of 235 places in 243 ms of which 0 ms to minimize.
[2023-03-15 08:14:25] [INFO ] Deduced a trap composed of 223 places in 248 ms of which 0 ms to minimize.
[2023-03-15 08:14:25] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2023-03-15 08:14:25] [INFO ] Deduced a trap composed of 214 places in 242 ms of which 0 ms to minimize.
[2023-03-15 08:14:26] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 1 ms to minimize.
[2023-03-15 08:14:26] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2023-03-15 08:15:54] [INFO ] Flatten gal took : 151 ms
[2023-03-15 08:15:54] [INFO ] Applying decomposition
[2023-03-15 08:15:54] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17103098605171547806.txt' '-o' '/tmp/graph17103098605171547806.bin' '-w' '/tmp/graph17103098605171547806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17103098605171547806.bin' '-l' '-1' '-v' '-w' '/tmp/graph17103098605171547806.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:15:55] [INFO ] Decomposing Gal with order
[2023-03-15 08:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:15:55] [INFO ] Removed a total of 6114 redundant transitions.
[2023-03-15 08:15:55] [INFO ] Flatten gal took : 311 ms
[2023-03-15 08:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 355 labels/synchronizations in 101 ms.
[2023-03-15 08:15:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2347727600894686566.gal : 27 ms
[2023-03-15 08:15:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2372605259024402455.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2347727600894686566.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2372605259024402455.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2372605259024402455.prop.
[2023-03-15 08:17:59] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 224590 ms
[2023-03-15 08:17:59] [INFO ] After 224919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:17:59] [INFO ] After 225035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:17:59] [INFO ] Flatten gal took : 59 ms
[2023-03-15 08:17:59] [INFO ] Flatten gal took : 56 ms
[2023-03-15 08:17:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17345939391739691121.gal : 10 ms
[2023-03-15 08:17:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10721983134147402610.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17345939391739691121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10721983134147402610.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10721983134147402610.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 70
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :70 after 72
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :72 after 74
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :74 after 76
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :76 after 78
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :78 after 81
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :81 after 86
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86 after 113
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :113 after 754
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :754 after 788
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :788 after 856
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :856 after 1072
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1072 after 34520
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :34520 after 36636
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :36636 after 46494
Detected timeout of ITS tools.
[2023-03-15 08:18:14] [INFO ] Flatten gal took : 54 ms
[2023-03-15 08:18:14] [INFO ] Applying decomposition
[2023-03-15 08:18:15] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1109120126177278512.txt' '-o' '/tmp/graph1109120126177278512.bin' '-w' '/tmp/graph1109120126177278512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1109120126177278512.bin' '-l' '-1' '-v' '-w' '/tmp/graph1109120126177278512.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:18:15] [INFO ] Decomposing Gal with order
[2023-03-15 08:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:18:15] [INFO ] Removed a total of 3438 redundant transitions.
[2023-03-15 08:18:15] [INFO ] Flatten gal took : 115 ms
[2023-03-15 08:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 55 ms.
[2023-03-15 08:18:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12987585321588804697.gal : 13 ms
[2023-03-15 08:18:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality773416436658740111.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12987585321588804697.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality773416436658740111.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality773416436658740111.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 3896
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3896 after 4156
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4156 after 4676
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4676 after 5976
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5976 after 8056
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3072
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5699539858420656991
[2023-03-15 08:18:30] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5699539858420656991
Running compilation step : cd /tmp/ltsmin5699539858420656991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2894 ms.
Running link step : cd /tmp/ltsmin5699539858420656991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5699539858420656991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:18:45] [INFO ] Flatten gal took : 51 ms
[2023-03-15 08:18:45] [INFO ] Flatten gal took : 53 ms
[2023-03-15 08:18:45] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16649708799364232112.gal : 10 ms
[2023-03-15 08:18:45] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11648460147861927080.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16649708799364232112.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11648460147861927080.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityFireability11648460147861927080.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
Detected timeout of ITS tools.
[2023-03-15 08:18:48] [INFO ] Flatten gal took : 48 ms
[2023-03-15 08:18:48] [INFO ] Applying decomposition
[2023-03-15 08:18:48] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9757468121573704602.txt' '-o' '/tmp/graph9757468121573704602.bin' '-w' '/tmp/graph9757468121573704602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9757468121573704602.bin' '-l' '-1' '-v' '-w' '/tmp/graph9757468121573704602.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:18:49] [INFO ] Decomposing Gal with order
[2023-03-15 08:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:18:49] [INFO ] Removed a total of 3070 redundant transitions.
[2023-03-15 08:18:49] [INFO ] Flatten gal took : 110 ms
[2023-03-15 08:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 30 ms.
[2023-03-15 08:18:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13169832152284183773.gal : 11 ms
[2023-03-15 08:18:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13666433558231442678.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13169832152284183773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13666433558231442678.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability13666433558231442678.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10149368098714816609
[2023-03-15 08:18:52] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10149368098714816609
Running compilation step : cd /tmp/ltsmin10149368098714816609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10149368098714816609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10149368098714816609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:18:54] [INFO ] Flatten gal took : 43 ms
[2023-03-15 08:18:54] [INFO ] Flatten gal took : 44 ms
[2023-03-15 08:18:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13062416072405137916.gal : 8 ms
[2023-03-15 08:18:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17451592070046771488.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13062416072405137916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17451592070046771488.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityFireability17451592070046771488.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :176 after 499
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :499 after 725
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :725 after 1913
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1913 after 7313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7313 after 29790
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29790 after 52516
Detected timeout of ITS tools.
[2023-03-15 08:19:24] [INFO ] Flatten gal took : 45 ms
[2023-03-15 08:19:24] [INFO ] Applying decomposition
[2023-03-15 08:19:24] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7572636182283342131.txt' '-o' '/tmp/graph7572636182283342131.bin' '-w' '/tmp/graph7572636182283342131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7572636182283342131.bin' '-l' '-1' '-v' '-w' '/tmp/graph7572636182283342131.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:19:24] [INFO ] Decomposing Gal with order
[2023-03-15 08:19:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:19:24] [INFO ] Removed a total of 3072 redundant transitions.
[2023-03-15 08:19:24] [INFO ] Flatten gal took : 112 ms
[2023-03-15 08:19:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 25 ms.
[2023-03-15 08:19:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2512882338448248139.gal : 10 ms
[2023-03-15 08:19:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4773838622728171062.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2512882338448248139.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4773838622728171062.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability4773838622728171062.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15563601110449032626
[2023-03-15 08:19:55] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15563601110449032626
Running compilation step : cd /tmp/ltsmin15563601110449032626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2479 ms.
Running link step : cd /tmp/ltsmin15563601110449032626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15563601110449032626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 08:20:25] [INFO ] Flatten gal took : 45 ms
[2023-03-15 08:20:25] [INFO ] Flatten gal took : 62 ms
[2023-03-15 08:20:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14706080099855437213.gal : 8 ms
[2023-03-15 08:20:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15071771883334868793.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14706080099855437213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15071771883334868793.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityFireability15071771883334868793.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :176 after 499
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :499 after 725
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :725 after 1913
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3072 after 5120
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1913 after 7313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7313 after 29790
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29790 after 52516
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52516 after 155030
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :155030 after 510246
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :510246 after 1.18005e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.18005e+06 after 2.83108e+06
Detected timeout of ITS tools.
[2023-03-15 08:25:25] [INFO ] Flatten gal took : 49 ms
[2023-03-15 08:25:25] [INFO ] Applying decomposition
[2023-03-15 08:25:25] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17749031531093346278.txt' '-o' '/tmp/graph17749031531093346278.bin' '-w' '/tmp/graph17749031531093346278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17749031531093346278.bin' '-l' '-1' '-v' '-w' '/tmp/graph17749031531093346278.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:25:25] [INFO ] Decomposing Gal with order
[2023-03-15 08:25:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:25:25] [INFO ] Removed a total of 3070 redundant transitions.
[2023-03-15 08:25:25] [INFO ] Flatten gal took : 104 ms
[2023-03-15 08:25:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 25 ms.
[2023-03-15 08:25:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14885656144387029727.gal : 11 ms
[2023-03-15 08:25:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15178847510186769395.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14885656144387029727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15178847510186769395.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability15178847510186769395.prop.
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2048
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11206850346621722849
[2023-03-15 08:30:26] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11206850346621722849
Running compilation step : cd /tmp/ltsmin11206850346621722849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2678 ms.
Running link step : cd /tmp/ltsmin11206850346621722849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11206850346621722849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.045: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.047: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.046: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.046: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.044: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.047: There are 1252 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.047: State length is 580, there are 1251 groups
pins2lts-mc-linux64( 0/ 8), 0.047: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.047: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.047: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.047: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.044: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.045: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.047: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.100: ~4 levels ~960 states ~8112 transitions
pins2lts-mc-linux64( 0/ 8), 0.136: ~5 levels ~1920 states ~15472 transitions
pins2lts-mc-linux64( 0/ 8), 0.207: ~6 levels ~3840 states ~21824 transitions
pins2lts-mc-linux64( 0/ 8), 0.636: ~7 levels ~7680 states ~87920 transitions
pins2lts-mc-linux64( 2/ 8), 0.912: ~6 levels ~15360 states ~115992 transitions
pins2lts-mc-linux64( 2/ 8), 1.568: ~6 levels ~30720 states ~242520 transitions
pins2lts-mc-linux64( 2/ 8), 2.750: ~7 levels ~61440 states ~494184 transitions
pins2lts-mc-linux64( 2/ 8), 4.764: ~7 levels ~122880 states ~950088 transitions
pins2lts-mc-linux64( 6/ 8), 8.188: ~6 levels ~245760 states ~848024 transitions
pins2lts-mc-linux64( 6/ 8), 14.802: ~7 levels ~491520 states ~1304712 transitions
pins2lts-mc-linux64( 6/ 8), 27.858: ~11 levels ~983040 states ~2068960 transitions
pins2lts-mc-linux64( 6/ 8), 56.512: ~12 levels ~1966080 states ~10107200 transitions
pins2lts-mc-linux64( 6/ 8), 115.607: ~13 levels ~3932160 states ~24423952 transitions
pins2lts-mc-linux64( 4/ 8), 137.639: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 137.992:
pins2lts-mc-linux64( 0/ 8), 137.992: mean standard work distribution: 14.6% (states) 41.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 137.992:
pins2lts-mc-linux64( 0/ 8), 137.992: Explored 3867336 states 63022898 transitions, fanout: 16.296
pins2lts-mc-linux64( 0/ 8), 137.992: Total exploration time 137.940 sec (137.600 sec minimum, 137.678 sec on average)
pins2lts-mc-linux64( 0/ 8), 137.992: States per second: 28036, Transitions per second: 456886
pins2lts-mc-linux64( 0/ 8), 137.992:
pins2lts-mc-linux64( 0/ 8), 137.992: Queue width: 8B, total height: 18526078, memory: 141.34MB
pins2lts-mc-linux64( 0/ 8), 137.992: Tree memory: 426.9MB, 20.0 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 137.992: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 137.992: Stored 1471 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 137.992: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 137.992: Est. total memory use: 568.2MB (~1165.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11206850346621722849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11206850346621722849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:32:47] [INFO ] Flatten gal took : 53 ms
[2023-03-15 08:32:47] [INFO ] Flatten gal took : 45 ms
[2023-03-15 08:32:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1938884453477690280.gal : 8 ms
[2023-03-15 08:32:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6969769710527723111.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability1938884453477690280.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6969769710527723111.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability6969769710527723111.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :176 after 499
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :499 after 725
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :725 after 1913
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1913 after 7313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7313 after 29790
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29790 after 52516
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52516 after 155030
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :155030 after 510246
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :510246 after 1.18005e+06
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 12241868 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15355196 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J30, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tall-167873961400427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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